./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6692e4fc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e9d0e89ee237165e6cd15cb730148b321ca31eb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:26:18,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:26:18,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:26:19,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:26:19,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:26:19,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:26:19,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:26:19,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:26:19,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:26:19,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:26:19,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:26:19,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:26:19,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:26:19,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:26:19,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:26:19,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:26:19,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:26:19,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:26:19,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:26:19,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:26:19,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:26:19,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:26:19,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:26:19,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:26:19,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:26:19,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:26:19,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:26:19,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:26:19,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:26:19,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:26:19,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:26:19,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:26:19,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:26:19,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:26:19,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:26:19,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:26:19,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:26:19,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:26:19,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:26:19,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:26:19,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:26:19,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 17:26:19,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:26:19,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:26:19,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:26:19,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:26:19,059 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:26:19,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:26:19,060 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:26:19,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:26:19,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:26:19,061 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:26:19,061 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:26:19,061 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:26:19,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:26:19,062 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:26:19,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:26:19,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:26:19,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:26:19,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:26:19,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:26:19,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:26:19,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:26:19,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:26:19,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:26:19,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:26:19,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e9d0e89ee237165e6cd15cb730148b321ca31eb [2019-11-25 17:26:19,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:26:19,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:26:19,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:26:19,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:26:19,403 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:26:19,404 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max.c [2019-11-25 17:26:19,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6b11974/f36fa2303ca54feab36d6b01a720c77f/FLAGf2181f231 [2019-11-25 17:26:19,928 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:26:19,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2019-11-25 17:26:19,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6b11974/f36fa2303ca54feab36d6b01a720c77f/FLAGf2181f231 [2019-11-25 17:26:20,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6b11974/f36fa2303ca54feab36d6b01a720c77f [2019-11-25 17:26:20,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:26:20,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:26:20,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:26:20,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:26:20,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:26:20,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:26:20" (1/1) ... [2019-11-25 17:26:20,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf4c1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20, skipping insertion in model container [2019-11-25 17:26:20,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:26:20" (1/1) ... [2019-11-25 17:26:20,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:26:20,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:26:20,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:26:20,620 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:26:20,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:26:20,679 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:26:20,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20 WrapperNode [2019-11-25 17:26:20,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:26:20,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:26:20,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:26:20,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:26:20,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20" (1/1) ... [2019-11-25 17:26:20,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20" (1/1) ... [2019-11-25 17:26:20,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20" (1/1) ... [2019-11-25 17:26:20,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20" (1/1) ... [2019-11-25 17:26:20,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20" (1/1) ... [2019-11-25 17:26:20,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20" (1/1) ... [2019-11-25 17:26:20,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20" (1/1) ... [2019-11-25 17:26:20,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:26:20,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:26:20,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:26:20,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:26:20,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:26:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:26:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:26:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 17:26:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:26:20,891 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:26:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:26:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:26:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:26:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 17:26:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 17:26:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:26:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:26:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:26:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:26:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:26:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:26:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:26:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:26:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:26:21,301 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:26:21,301 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-25 17:26:21,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:26:21 BoogieIcfgContainer [2019-11-25 17:26:21,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:26:21,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:26:21,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:26:21,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:26:21,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:26:20" (1/3) ... [2019-11-25 17:26:21,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b3e5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:26:21, skipping insertion in model container [2019-11-25 17:26:21,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:20" (2/3) ... [2019-11-25 17:26:21,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b3e5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:26:21, skipping insertion in model container [2019-11-25 17:26:21,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:26:21" (3/3) ... [2019-11-25 17:26:21,309 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2019-11-25 17:26:21,316 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:26:21,322 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-25 17:26:21,332 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-25 17:26:21,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:26:21,354 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:26:21,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:26:21,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:26:21,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:26:21,354 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:26:21,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:26:21,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:26:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-25 17:26:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 17:26:21,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:21,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:21,381 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612475, now seen corresponding path program 1 times [2019-11-25 17:26:21,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:21,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297824548] [2019-11-25 17:26:21,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:21,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297824548] [2019-11-25 17:26:21,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:21,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:26:21,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309950] [2019-11-25 17:26:21,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:26:21,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:26:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:26:21,713 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-25 17:26:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:22,056 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-25 17:26:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:26:22,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-25 17:26:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:22,067 INFO L225 Difference]: With dead ends: 46 [2019-11-25 17:26:22,068 INFO L226 Difference]: Without dead ends: 43 [2019-11-25 17:26:22,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:26:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-25 17:26:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-25 17:26:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-25 17:26:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-25 17:26:22,111 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 13 [2019-11-25 17:26:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:22,112 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-25 17:26:22,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:26:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-25 17:26:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 17:26:22,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:22,113 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:22,114 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:22,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:22,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612476, now seen corresponding path program 1 times [2019-11-25 17:26:22,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:22,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361726587] [2019-11-25 17:26:22,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:22,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361726587] [2019-11-25 17:26:22,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:22,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:26:22,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630193183] [2019-11-25 17:26:22,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:26:22,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:22,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:26:22,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:26:22,280 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 7 states. [2019-11-25 17:26:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:22,776 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-11-25 17:26:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:26:22,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-25 17:26:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:22,779 INFO L225 Difference]: With dead ends: 89 [2019-11-25 17:26:22,779 INFO L226 Difference]: Without dead ends: 89 [2019-11-25 17:26:22,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:26:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-25 17:26:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-11-25 17:26:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 17:26:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-11-25 17:26:22,795 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 13 [2019-11-25 17:26:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:22,796 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-11-25 17:26:22,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:26:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-11-25 17:26:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 17:26:22,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:22,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:22,798 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2016377715, now seen corresponding path program 1 times [2019-11-25 17:26:22,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:22,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617773278] [2019-11-25 17:26:22,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:22,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617773278] [2019-11-25 17:26:22,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:22,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:26:22,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105494950] [2019-11-25 17:26:22,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:26:22,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:22,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:26:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:26:22,970 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 7 states. [2019-11-25 17:26:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:23,243 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-11-25 17:26:23,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:26:23,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-25 17:26:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:23,245 INFO L225 Difference]: With dead ends: 75 [2019-11-25 17:26:23,245 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 17:26:23,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:26:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 17:26:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-11-25 17:26:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 17:26:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-25 17:26:23,257 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 14 [2019-11-25 17:26:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:23,257 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-25 17:26:23,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:26:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-25 17:26:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 17:26:23,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:23,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:23,259 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:23,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:23,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2016379159, now seen corresponding path program 1 times [2019-11-25 17:26:23,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:23,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753775013] [2019-11-25 17:26:23,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:23,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753775013] [2019-11-25 17:26:23,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:23,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:26:23,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962292947] [2019-11-25 17:26:23,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:26:23,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:23,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:26:23,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:26:23,414 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2019-11-25 17:26:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:23,827 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-11-25 17:26:23,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:26:23,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-25 17:26:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:23,829 INFO L225 Difference]: With dead ends: 85 [2019-11-25 17:26:23,829 INFO L226 Difference]: Without dead ends: 85 [2019-11-25 17:26:23,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:26:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-25 17:26:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 60. [2019-11-25 17:26:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 17:26:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-25 17:26:23,839 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 14 [2019-11-25 17:26:23,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:23,839 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-25 17:26:23,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:26:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-25 17:26:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 17:26:23,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:23,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:23,841 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1916800304, now seen corresponding path program 1 times [2019-11-25 17:26:23,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:23,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397053717] [2019-11-25 17:26:23,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:23,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397053717] [2019-11-25 17:26:23,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:23,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:26:23,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856033706] [2019-11-25 17:26:23,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:26:23,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:23,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:26:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:26:23,942 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 8 states. [2019-11-25 17:26:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:24,215 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-11-25 17:26:24,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:26:24,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-25 17:26:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:24,217 INFO L225 Difference]: With dead ends: 81 [2019-11-25 17:26:24,217 INFO L226 Difference]: Without dead ends: 81 [2019-11-25 17:26:24,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:26:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-25 17:26:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-11-25 17:26:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 17:26:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-11-25 17:26:24,226 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 15 [2019-11-25 17:26:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:24,226 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-11-25 17:26:24,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:26:24,227 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-11-25 17:26:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:26:24,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:24,228 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:24,229 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:24,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:24,229 INFO L82 PathProgramCache]: Analyzing trace with hash 538883906, now seen corresponding path program 1 times [2019-11-25 17:26:24,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:24,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923369647] [2019-11-25 17:26:24,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:24,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923369647] [2019-11-25 17:26:24,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:24,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:26:24,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319612556] [2019-11-25 17:26:24,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:26:24,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:26:24,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:26:24,367 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 8 states. [2019-11-25 17:26:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:24,860 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-25 17:26:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:26:24,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-25 17:26:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:24,863 INFO L225 Difference]: With dead ends: 109 [2019-11-25 17:26:24,863 INFO L226 Difference]: Without dead ends: 109 [2019-11-25 17:26:24,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:26:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-25 17:26:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 55. [2019-11-25 17:26:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 17:26:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-25 17:26:24,871 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 17 [2019-11-25 17:26:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:24,871 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-25 17:26:24,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:26:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-25 17:26:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 17:26:24,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:24,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:24,872 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1823655338, now seen corresponding path program 1 times [2019-11-25 17:26:24,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:24,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48621365] [2019-11-25 17:26:24,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:24,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48621365] [2019-11-25 17:26:24,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:24,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:26:24,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046599360] [2019-11-25 17:26:24,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:26:24,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:26:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:26:24,982 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2019-11-25 17:26:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:25,402 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-25 17:26:25,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:26:25,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-25 17:26:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:25,404 INFO L225 Difference]: With dead ends: 109 [2019-11-25 17:26:25,404 INFO L226 Difference]: Without dead ends: 109 [2019-11-25 17:26:25,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:26:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-25 17:26:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 39. [2019-11-25 17:26:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 17:26:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-25 17:26:25,410 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 19 [2019-11-25 17:26:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:25,410 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-25 17:26:25,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:26:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-25 17:26:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 17:26:25,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:25,411 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:25,413 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1786595156, now seen corresponding path program 1 times [2019-11-25 17:26:25,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:25,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932217313] [2019-11-25 17:26:25,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:26:25,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932217313] [2019-11-25 17:26:25,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818581508] [2019-11-25 17:26:25,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:25,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 17:26:25,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:26:25,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:26:25,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-11-25 17:26:25,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321831829] [2019-11-25 17:26:25,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:26:25,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:26:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:26:25,817 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-25 17:26:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:25,945 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-25 17:26:25,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:26:25,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-25 17:26:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:25,947 INFO L225 Difference]: With dead ends: 61 [2019-11-25 17:26:25,947 INFO L226 Difference]: Without dead ends: 61 [2019-11-25 17:26:25,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:26:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-25 17:26:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-11-25 17:26:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-25 17:26:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-25 17:26:25,955 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 33 [2019-11-25 17:26:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:25,955 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-25 17:26:25,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:26:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-25 17:26:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 17:26:25,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:25,957 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:26,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:26,162 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash 450123521, now seen corresponding path program 1 times [2019-11-25 17:26:26,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:26,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020456721] [2019-11-25 17:26:26,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 17:26:26,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020456721] [2019-11-25 17:26:26,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:26,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:26:26,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279381395] [2019-11-25 17:26:26,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:26:26,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:26,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:26:26,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:26:26,269 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-11-25 17:26:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:26,389 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-25 17:26:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:26:26,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-25 17:26:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:26,391 INFO L225 Difference]: With dead ends: 51 [2019-11-25 17:26:26,391 INFO L226 Difference]: Without dead ends: 51 [2019-11-25 17:26:26,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:26:26,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-25 17:26:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-25 17:26:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-25 17:26:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-25 17:26:26,397 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2019-11-25 17:26:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:26,397 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-25 17:26:26,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:26:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-25 17:26:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 17:26:26,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:26,399 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:26,400 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:26,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:26,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1222990268, now seen corresponding path program 1 times [2019-11-25 17:26:26,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:26,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978849251] [2019-11-25 17:26:26,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 17:26:26,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978849251] [2019-11-25 17:26:26,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:26,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:26:26,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794240911] [2019-11-25 17:26:26,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:26:26,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:26,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:26:26,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:26:26,530 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 7 states. [2019-11-25 17:26:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:26,673 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-25 17:26:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:26:26,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-25 17:26:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:26,674 INFO L225 Difference]: With dead ends: 50 [2019-11-25 17:26:26,674 INFO L226 Difference]: Without dead ends: 34 [2019-11-25 17:26:26,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:26:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-25 17:26:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-25 17:26:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 17:26:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-25 17:26:26,679 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-11-25 17:26:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:26,680 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-25 17:26:26,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:26:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-25 17:26:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 17:26:26,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:26,682 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:26,682 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:26:26,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash 438004402, now seen corresponding path program 1 times [2019-11-25 17:26:26,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:26,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710818929] [2019-11-25 17:26:26,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:26:26,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710818929] [2019-11-25 17:26:26,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729756210] [2019-11-25 17:26:26,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 17:26:26,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:26:27,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:27,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-25 17:26:27,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372019048] [2019-11-25 17:26:27,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-25 17:26:27,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 17:26:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-25 17:26:27,149 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 16 states. [2019-11-25 17:26:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:30,487 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2019-11-25 17:26:30,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-25 17:26:30,488 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-11-25 17:26:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:30,489 INFO L225 Difference]: With dead ends: 96 [2019-11-25 17:26:30,489 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:26:30,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2019-11-25 17:26:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:26:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:26:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:26:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:26:30,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-25 17:26:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:30,493 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:26:30,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-25 17:26:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:26:30,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:26:30,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:30,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:26:30 BoogieIcfgContainer [2019-11-25 17:26:30,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:26:30,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:26:30,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:26:30,705 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:26:30,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:26:21" (3/4) ... [2019-11-25 17:26:30,711 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:26:30,722 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:26:30,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:26:30,724 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 17:26:30,724 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 17:26:30,744 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-25 17:26:30,744 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 17:26:30,745 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 17:26:30,745 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:26:30,866 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:26:30,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:26:30,870 INFO L168 Benchmark]: Toolchain (without parser) took 10572.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -248.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:30,872 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:26:30,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.96 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:30,874 INFO L168 Benchmark]: Boogie Preprocessor took 134.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:30,875 INFO L168 Benchmark]: RCFGBuilder took 487.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:30,880 INFO L168 Benchmark]: TraceAbstraction took 9401.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:30,881 INFO L168 Benchmark]: Witness Printer took 162.05 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:30,884 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.96 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9401.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Witness Printer took 162.05 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 53 locations, 16 error locations. Result: SAFE, OverallTime: 9.3s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 327 SDtfs, 964 SDslu, 531 SDs, 0 SdLazy, 1951 SolverSat, 388 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 212 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 302 ConstructedInterpolants, 8 QuantifiedInterpolants, 49561 SizeOfPredicates, 7 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 33/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...