./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-token-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-token-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35a5ccff58935eefedf723cd2243fac7c8b8e61b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:00:36,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:00:36,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:00:36,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:00:36,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:00:36,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:00:36,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:00:36,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:00:36,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:00:36,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:00:36,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:00:36,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:00:36,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:00:36,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:00:36,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:00:36,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:00:36,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:00:36,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:00:36,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:00:36,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:00:36,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:00:36,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:00:36,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:00:36,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:00:36,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:00:36,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:00:36,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:00:36,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:00:36,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:00:36,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:00:36,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:00:36,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:00:36,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:00:36,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:00:36,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:00:36,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:00:36,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:00:36,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:00:36,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:00:36,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:00:36,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:00:36,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:00:36,683 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:00:36,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:00:36,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:00:36,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:00:36,686 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:00:36,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:00:36,687 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:00:36,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:00:36,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:00:36,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:00:36,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:00:36,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:00:36,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:00:36,689 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:00:36,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:00:36,689 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:00:36,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:00:36,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:00:36,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:00:36,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:00:36,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:00:36,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:00:36,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:00:36,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:00:36,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:00:36,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:00:36,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:00:36,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:00:36,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:00:36,694 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 ! call(__VERIFIER_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35a5ccff58935eefedf723cd2243fac7c8b8e61b [2020-07-28 18:00:37,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:00:37,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:00:37,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:00:37,045 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:00:37,045 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:00:37,046 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-2.i [2020-07-28 18:00:37,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95eafb3b/3b63e10a67fe4ab19d1ff7ab58ee91a0/FLAG85e3e4d89 [2020-07-28 18:00:37,710 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:00:37,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i [2020-07-28 18:00:37,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95eafb3b/3b63e10a67fe4ab19d1ff7ab58ee91a0/FLAG85e3e4d89 [2020-07-28 18:00:37,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95eafb3b/3b63e10a67fe4ab19d1ff7ab58ee91a0 [2020-07-28 18:00:37,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:00:37,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:00:37,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:00:37,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:00:37,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:00:37,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:00:37" (1/1) ... [2020-07-28 18:00:37,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a438851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:37, skipping insertion in model container [2020-07-28 18:00:38,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:00:37" (1/1) ... [2020-07-28 18:00:38,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:00:38,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:00:38,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:00:38,566 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:00:38,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:00:38,728 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:00:38,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38 WrapperNode [2020-07-28 18:00:38,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:00:38,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:00:38,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:00:38,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:00:38,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (1/1) ... [2020-07-28 18:00:38,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (1/1) ... [2020-07-28 18:00:38,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:00:38,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:00:38,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:00:38,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:00:38,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (1/1) ... [2020-07-28 18:00:38,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (1/1) ... [2020-07-28 18:00:38,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (1/1) ... [2020-07-28 18:00:38,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (1/1) ... [2020-07-28 18:00:38,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (1/1) ... [2020-07-28 18:00:38,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (1/1) ... [2020-07-28 18:00:38,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (1/1) ... [2020-07-28 18:00:38,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:00:38,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:00:38,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:00:38,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:00:38,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (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 [2020-07-28 18:00:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 18:00:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 18:00:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 18:00:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 18:00:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 18:00:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 18:00:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:00:38,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:00:39,528 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:00:39,529 INFO L295 CfgBuilder]: Removed 19 assume(true) statements. [2020-07-28 18:00:39,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:00:39 BoogieIcfgContainer [2020-07-28 18:00:39,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:00:39,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:00:39,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:00:39,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:00:39,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:00:37" (1/3) ... [2020-07-28 18:00:39,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304e77cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:00:39, skipping insertion in model container [2020-07-28 18:00:39,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:00:38" (2/3) ... [2020-07-28 18:00:39,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304e77cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:00:39, skipping insertion in model container [2020-07-28 18:00:39,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:00:39" (3/3) ... [2020-07-28 18:00:39,543 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2020-07-28 18:00:39,553 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:00:39,561 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-28 18:00:39,576 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-28 18:00:39,601 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:00:39,601 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:00:39,601 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:00:39,602 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:00:39,602 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:00:39,602 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:00:39,602 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:00:39,602 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:00:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-28 18:00:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 18:00:39,627 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:39,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 18:00:39,629 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash 890337990, now seen corresponding path program 1 times [2020-07-28 18:00:39,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:39,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909048531] [2020-07-28 18:00:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:39,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {47#true} is VALID [2020-07-28 18:00:39,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~nondet1, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem9, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem8, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem14, main_#t~mem16, main_#t~mem17.base, main_#t~mem17.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4);call write~$Pointer$(0, 0, main_~head~0.base, 4 + main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; {47#true} is VALID [2020-07-28 18:00:39,825 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-28 18:00:39,825 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#false} call write~int(1, main_~x~0.base, 8 + main_~x~0.offset, 4);call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc5.base, main_#t~malloc5.offset, main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~$Pointer$(main_~x~0.base, main_~x~0.offset, main_#t~mem6.base, 4 + main_#t~mem6.offset, 4);havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~int(2, main_#t~mem7.base, 8 + main_#t~mem7.offset, 4);havoc main_#t~mem7.base, main_#t~mem7.offset;main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; {48#false} is VALID [2020-07-28 18:00:39,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#false} assume !(0 != main_~x~0.base || 0 != main_~x~0.offset); {48#false} is VALID [2020-07-28 18:00:39,826 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-28 18:00:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:39,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909048531] [2020-07-28 18:00:39,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:39,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:00:39,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880405937] [2020-07-28 18:00:39,839 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 18:00:39,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:39,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:00:39,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:39,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:00:39,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:39,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:00:39,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:00:39,887 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2020-07-28 18:00:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:40,032 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2020-07-28 18:00:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:00:40,034 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 18:00:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:00:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 132 transitions. [2020-07-28 18:00:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:00:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 132 transitions. [2020-07-28 18:00:40,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 132 transitions. [2020-07-28 18:00:40,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:40,269 INFO L225 Difference]: With dead ends: 86 [2020-07-28 18:00:40,270 INFO L226 Difference]: Without dead ends: 39 [2020-07-28 18:00:40,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:00:40,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-28 18:00:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-28 18:00:40,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:40,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2020-07-28 18:00:40,310 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-28 18:00:40,311 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-28 18:00:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:40,315 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-28 18:00:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-28 18:00:40,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:40,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:40,316 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-28 18:00:40,317 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-28 18:00:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:40,320 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-28 18:00:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-28 18:00:40,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:40,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:40,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:40,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-28 18:00:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-28 18:00:40,327 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 6 [2020-07-28 18:00:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:40,327 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-28 18:00:40,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:00:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-28 18:00:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 18:00:40,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:40,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 18:00:40,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:00:40,330 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash 889571369, now seen corresponding path program 1 times [2020-07-28 18:00:40,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:40,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612752914] [2020-07-28 18:00:40,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:40,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {274#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {274#true} is VALID [2020-07-28 18:00:40,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {274#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~nondet1, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem9, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem8, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem14, main_#t~mem16, main_#t~mem17.base, main_#t~mem17.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4);call write~$Pointer$(0, 0, main_~head~0.base, 4 + main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; {276#(= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)} is VALID [2020-07-28 18:00:40,457 INFO L280 TraceCheckUtils]: 2: Hoare triple {276#(= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {276#(= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)} is VALID [2020-07-28 18:00:40,461 INFO L280 TraceCheckUtils]: 3: Hoare triple {276#(= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)} assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~$Pointer$(main_~x~0.base, main_~x~0.offset, main_#t~mem3.base, 4 + main_#t~mem3.offset, 4);havoc main_#t~mem3.base, main_#t~mem3.offset;call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;call write~int(0, main_~x~0.base, 8 + main_~x~0.offset, 4); {277#(not (= 0 ULTIMATE.start_main_~x~0.base))} is VALID [2020-07-28 18:00:40,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {277#(not (= 0 ULTIMATE.start_main_~x~0.base))} assume !(0 != main_~x~0.base || 0 != main_~x~0.offset); {275#false} is VALID [2020-07-28 18:00:40,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {275#false} assume !false; {275#false} is VALID [2020-07-28 18:00:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:40,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612752914] [2020-07-28 18:00:40,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:40,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:00:40,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304778396] [2020-07-28 18:00:40,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-28 18:00:40,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:40,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:00:40,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:40,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:00:40,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:40,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:00:40,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:00:40,482 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2020-07-28 18:00:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:40,749 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-28 18:00:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:00:40,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-28 18:00:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2020-07-28 18:00:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2020-07-28 18:00:40,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2020-07-28 18:00:40,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:40,819 INFO L225 Difference]: With dead ends: 39 [2020-07-28 18:00:40,820 INFO L226 Difference]: Without dead ends: 37 [2020-07-28 18:00:40,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:00:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-28 18:00:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-28 18:00:40,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:40,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-28 18:00:40,834 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-28 18:00:40,834 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-28 18:00:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:40,837 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-28 18:00:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-28 18:00:40,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:40,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:40,839 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-28 18:00:40,839 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-28 18:00:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:40,842 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-28 18:00:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-28 18:00:40,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:40,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:40,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:40,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-28 18:00:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-28 18:00:40,847 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2020-07-28 18:00:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:40,847 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-28 18:00:40,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:00:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-28 18:00:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:00:40,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:40,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:40,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:00:40,850 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1806865149, now seen corresponding path program 1 times [2020-07-28 18:00:40,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:40,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807290283] [2020-07-28 18:00:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:40,930 INFO L280 TraceCheckUtils]: 0: Hoare triple {444#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {444#true} is VALID [2020-07-28 18:00:40,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {444#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~nondet1, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem9, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem8, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem14, main_#t~mem16, main_#t~mem17.base, main_#t~mem17.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4);call write~$Pointer$(0, 0, main_~head~0.base, 4 + main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; {446#(not (= 0 ULTIMATE.start_main_~head~0.base))} is VALID [2020-07-28 18:00:40,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {446#(not (= 0 ULTIMATE.start_main_~head~0.base))} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {446#(not (= 0 ULTIMATE.start_main_~head~0.base))} is VALID [2020-07-28 18:00:40,934 INFO L280 TraceCheckUtils]: 3: Hoare triple {446#(not (= 0 ULTIMATE.start_main_~head~0.base))} assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; {446#(not (= 0 ULTIMATE.start_main_~head~0.base))} is VALID [2020-07-28 18:00:40,937 INFO L280 TraceCheckUtils]: 4: Hoare triple {446#(not (= 0 ULTIMATE.start_main_~head~0.base))} call write~int(1, main_~x~0.base, 8 + main_~x~0.offset, 4);call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc5.base, main_#t~malloc5.offset, main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~$Pointer$(main_~x~0.base, main_~x~0.offset, main_#t~mem6.base, 4 + main_#t~mem6.offset, 4);havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~int(2, main_#t~mem7.base, 8 + main_#t~mem7.offset, 4);havoc main_#t~mem7.base, main_#t~mem7.offset;main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; {447#(not (= 0 ULTIMATE.start_main_~x~0.base))} is VALID [2020-07-28 18:00:40,938 INFO L280 TraceCheckUtils]: 5: Hoare triple {447#(not (= 0 ULTIMATE.start_main_~x~0.base))} assume !(0 != main_~x~0.base || 0 != main_~x~0.offset); {445#false} is VALID [2020-07-28 18:00:40,938 INFO L280 TraceCheckUtils]: 6: Hoare triple {445#false} assume !false; {445#false} is VALID [2020-07-28 18:00:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:40,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807290283] [2020-07-28 18:00:40,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:40,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:00:40,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776728129] [2020-07-28 18:00:40,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 18:00:40,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:40,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:00:40,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:40,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:00:40,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:40,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:00:40,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:00:40,957 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2020-07-28 18:00:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:41,171 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2020-07-28 18:00:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:00:41,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 18:00:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2020-07-28 18:00:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2020-07-28 18:00:41,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2020-07-28 18:00:41,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:41,277 INFO L225 Difference]: With dead ends: 63 [2020-07-28 18:00:41,278 INFO L226 Difference]: Without dead ends: 61 [2020-07-28 18:00:41,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:00:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-28 18:00:41,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2020-07-28 18:00:41,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:41,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 35 states. [2020-07-28 18:00:41,298 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 35 states. [2020-07-28 18:00:41,298 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 35 states. [2020-07-28 18:00:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:41,301 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2020-07-28 18:00:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2020-07-28 18:00:41,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:41,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:41,303 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 61 states. [2020-07-28 18:00:41,303 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 61 states. [2020-07-28 18:00:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:41,307 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2020-07-28 18:00:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2020-07-28 18:00:41,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:41,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:41,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:41,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 18:00:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-28 18:00:41,310 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2020-07-28 18:00:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:41,311 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-28 18:00:41,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:00:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-28 18:00:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 18:00:41,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:41,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:41,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 18:00:41,313 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:41,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:41,313 INFO L82 PathProgramCache]: Analyzing trace with hash -913382283, now seen corresponding path program 1 times [2020-07-28 18:00:41,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:41,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017864661] [2020-07-28 18:00:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:41,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {687#true} is VALID [2020-07-28 18:00:41,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {687#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~nondet1, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem9, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem8, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem14, main_#t~mem16, main_#t~mem17.base, main_#t~mem17.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4);call write~$Pointer$(0, 0, main_~head~0.base, 4 + main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; {687#true} is VALID [2020-07-28 18:00:41,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {687#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {687#true} is VALID [2020-07-28 18:00:41,388 INFO L280 TraceCheckUtils]: 3: Hoare triple {687#true} assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; {687#true} is VALID [2020-07-28 18:00:41,389 INFO L280 TraceCheckUtils]: 4: Hoare triple {687#true} call write~int(1, main_~x~0.base, 8 + main_~x~0.offset, 4);call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc5.base, main_#t~malloc5.offset, main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~$Pointer$(main_~x~0.base, main_~x~0.offset, main_#t~mem6.base, 4 + main_#t~mem6.offset, 4);havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~int(2, main_#t~mem7.base, 8 + main_#t~mem7.offset, 4);havoc main_#t~mem7.base, main_#t~mem7.offset;main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; {687#true} is VALID [2020-07-28 18:00:41,389 INFO L280 TraceCheckUtils]: 5: Hoare triple {687#true} assume !!(0 != main_~x~0.base || 0 != main_~x~0.offset); {687#true} is VALID [2020-07-28 18:00:41,389 INFO L280 TraceCheckUtils]: 6: Hoare triple {687#true} goto; {687#true} is VALID [2020-07-28 18:00:41,394 INFO L280 TraceCheckUtils]: 7: Hoare triple {687#true} call main_#t~mem8 := read~int(main_~x~0.base, 8 + main_~x~0.offset, 4); {689#(= |ULTIMATE.start_main_#t~mem8| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8)))} is VALID [2020-07-28 18:00:41,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {689#(= |ULTIMATE.start_main_#t~mem8| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8)))} assume !(1 != main_#t~mem8);havoc main_#t~mem8; {690#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8)))} is VALID [2020-07-28 18:00:41,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {690#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8)))} call main_#t~mem11 := read~int(main_~x~0.base, 8 + main_~x~0.offset, 4); {691#(= 1 |ULTIMATE.start_main_#t~mem11|)} is VALID [2020-07-28 18:00:41,401 INFO L280 TraceCheckUtils]: 10: Hoare triple {691#(= 1 |ULTIMATE.start_main_#t~mem11|)} assume !(1 == main_#t~mem11);havoc main_#t~mem11; {688#false} is VALID [2020-07-28 18:00:41,402 INFO L280 TraceCheckUtils]: 11: Hoare triple {688#false} assume !false; {688#false} is VALID [2020-07-28 18:00:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:41,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017864661] [2020-07-28 18:00:41,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:41,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:00:41,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767598303] [2020-07-28 18:00:41,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:00:41,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:41,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:00:41,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:41,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:00:41,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:00:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:00:41,427 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2020-07-28 18:00:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:41,716 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-28 18:00:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:00:41,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:00:41,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:00:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-28 18:00:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:00:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-28 18:00:41,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-28 18:00:41,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:41,781 INFO L225 Difference]: With dead ends: 35 [2020-07-28 18:00:41,782 INFO L226 Difference]: Without dead ends: 33 [2020-07-28 18:00:41,782 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:00:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-28 18:00:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-28 18:00:41,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:41,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-28 18:00:41,798 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-28 18:00:41,798 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-28 18:00:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:41,800 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-28 18:00:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-28 18:00:41,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:41,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:41,801 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-28 18:00:41,801 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-28 18:00:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:41,803 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-28 18:00:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-28 18:00:41,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:41,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:41,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:41,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-28 18:00:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-07-28 18:00:41,805 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2020-07-28 18:00:41,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:41,806 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-07-28 18:00:41,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:00:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-28 18:00:41,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 18:00:41,806 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:41,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:41,807 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 18:00:41,807 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:41,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:41,807 INFO L82 PathProgramCache]: Analyzing trace with hash -913344547, now seen corresponding path program 1 times [2020-07-28 18:00:41,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:41,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78015554] [2020-07-28 18:00:41,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:41,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {842#true} is VALID [2020-07-28 18:00:41,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {842#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~nondet1, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem9, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem8, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem14, main_#t~mem16, main_#t~mem17.base, main_#t~mem17.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4);call write~$Pointer$(0, 0, main_~head~0.base, 4 + main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; {844#(and (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~head~0.offset ULTIMATE.start_main_~x~0.offset) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (= 0 ULTIMATE.start_main_~head~0.offset))} is VALID [2020-07-28 18:00:41,981 INFO L280 TraceCheckUtils]: 2: Hoare triple {844#(and (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~head~0.offset ULTIMATE.start_main_~x~0.offset) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (= 0 ULTIMATE.start_main_~head~0.offset))} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {844#(and (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~head~0.offset ULTIMATE.start_main_~x~0.offset) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (= 0 ULTIMATE.start_main_~head~0.offset))} is VALID [2020-07-28 18:00:41,982 INFO L280 TraceCheckUtils]: 3: Hoare triple {844#(and (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~head~0.offset ULTIMATE.start_main_~x~0.offset) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (= 0 ULTIMATE.start_main_~head~0.offset))} assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; {844#(and (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~head~0.offset ULTIMATE.start_main_~x~0.offset) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (= 0 ULTIMATE.start_main_~head~0.offset))} is VALID [2020-07-28 18:00:41,985 INFO L280 TraceCheckUtils]: 4: Hoare triple {844#(and (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~head~0.offset ULTIMATE.start_main_~x~0.offset) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (= 0 ULTIMATE.start_main_~head~0.offset))} call write~int(1, main_~x~0.base, 8 + main_~x~0.offset, 4);call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc5.base, main_#t~malloc5.offset, main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~$Pointer$(main_~x~0.base, main_~x~0.offset, main_#t~mem6.base, 4 + main_#t~mem6.offset, 4);havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~int(2, main_#t~mem7.base, 8 + main_#t~mem7.offset, 4);havoc main_#t~mem7.base, main_#t~mem7.offset;main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; {845#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8))) (= 0 ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-28 18:00:41,990 INFO L280 TraceCheckUtils]: 5: Hoare triple {845#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8))) (= 0 ULTIMATE.start_main_~x~0.offset))} assume !!(0 != main_~x~0.base || 0 != main_~x~0.offset); {845#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8))) (= 0 ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-28 18:00:41,991 INFO L280 TraceCheckUtils]: 6: Hoare triple {845#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8))) (= 0 ULTIMATE.start_main_~x~0.offset))} goto; {845#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8))) (= 0 ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-28 18:00:41,992 INFO L280 TraceCheckUtils]: 7: Hoare triple {845#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 8))) (= 0 ULTIMATE.start_main_~x~0.offset))} call main_#t~mem8 := read~int(main_~x~0.base, 8 + main_~x~0.offset, 4); {846#(= 1 |ULTIMATE.start_main_#t~mem8|)} is VALID [2020-07-28 18:00:41,993 INFO L280 TraceCheckUtils]: 8: Hoare triple {846#(= 1 |ULTIMATE.start_main_#t~mem8|)} assume !!(1 != main_#t~mem8);havoc main_#t~mem8; {843#false} is VALID [2020-07-28 18:00:41,993 INFO L280 TraceCheckUtils]: 9: Hoare triple {843#false} call main_#t~mem9 := read~int(main_~x~0.base, 8 + main_~x~0.offset, 4); {843#false} is VALID [2020-07-28 18:00:41,994 INFO L280 TraceCheckUtils]: 10: Hoare triple {843#false} assume !(0 == main_#t~mem9);havoc main_#t~mem9; {843#false} is VALID [2020-07-28 18:00:41,994 INFO L280 TraceCheckUtils]: 11: Hoare triple {843#false} assume !false; {843#false} is VALID [2020-07-28 18:00:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:41,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78015554] [2020-07-28 18:00:41,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:41,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:00:41,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020224943] [2020-07-28 18:00:41,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:00:41,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:41,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:00:42,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:42,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:00:42,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:42,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:00:42,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:00:42,020 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2020-07-28 18:00:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:42,438 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2020-07-28 18:00:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:00:42,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:00:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:00:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-28 18:00:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:00:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-28 18:00:42,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2020-07-28 18:00:42,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:42,532 INFO L225 Difference]: With dead ends: 68 [2020-07-28 18:00:42,532 INFO L226 Difference]: Without dead ends: 44 [2020-07-28 18:00:42,533 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:00:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-28 18:00:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-28 18:00:42,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:42,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 40 states. [2020-07-28 18:00:42,554 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 40 states. [2020-07-28 18:00:42,554 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 40 states. [2020-07-28 18:00:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:42,556 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-28 18:00:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-28 18:00:42,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:42,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:42,557 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 44 states. [2020-07-28 18:00:42,557 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 44 states. [2020-07-28 18:00:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:42,559 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-28 18:00:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-28 18:00:42,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:42,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:42,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:42,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-28 18:00:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-28 18:00:42,562 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2020-07-28 18:00:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:42,562 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-28 18:00:42,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:00:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-28 18:00:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 18:00:42,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:42,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:42,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 18:00:42,564 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash -313255267, now seen corresponding path program 1 times [2020-07-28 18:00:42,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:42,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249300231] [2020-07-28 18:00:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:00:42,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:00:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:00:42,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:00:42,742 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 18:00:42,742 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 18:00:42,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 18:00:42,792 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:00:42,792 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:00:42,792 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-28 18:00:42,792 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-28 18:00:42,792 WARN L170 areAnnotationChecker]: L1001-3 has no Hoare annotation [2020-07-28 18:00:42,792 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-28 18:00:42,792 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-28 18:00:42,793 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-28 18:00:42,796 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-28 18:00:42,796 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-28 18:00:42,796 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-28 18:00:42,796 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-28 18:00:42,796 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-28 18:00:42,797 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2020-07-28 18:00:42,797 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2020-07-28 18:00:42,797 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-28 18:00:42,797 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-28 18:00:42,797 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-28 18:00:42,797 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-28 18:00:42,797 WARN L170 areAnnotationChecker]: L1008-1 has no Hoare annotation [2020-07-28 18:00:42,797 WARN L170 areAnnotationChecker]: L1008-1 has no Hoare annotation [2020-07-28 18:00:42,798 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-28 18:00:42,798 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-28 18:00:42,798 WARN L170 areAnnotationChecker]: L1024-4 has no Hoare annotation [2020-07-28 18:00:42,798 WARN L170 areAnnotationChecker]: L1024-4 has no Hoare annotation [2020-07-28 18:00:42,798 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-28 18:00:42,798 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-28 18:00:42,798 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-28 18:00:42,798 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-28 18:00:42,798 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-28 18:00:42,799 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-28 18:00:42,799 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-28 18:00:42,799 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-28 18:00:42,799 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-28 18:00:42,799 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-28 18:00:42,799 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-28 18:00:42,799 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-28 18:00:42,800 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-28 18:00:42,800 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-28 18:00:42,800 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-28 18:00:42,800 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-28 18:00:42,800 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-28 18:00:42,800 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-28 18:00:42,800 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-28 18:00:42,800 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-28 18:00:42,800 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-28 18:00:42,801 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-28 18:00:42,801 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-28 18:00:42,802 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-28 18:00:42,802 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-28 18:00:42,802 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2020-07-28 18:00:42,802 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2020-07-28 18:00:42,802 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-28 18:00:42,802 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-28 18:00:42,802 WARN L170 areAnnotationChecker]: L1036-4 has no Hoare annotation [2020-07-28 18:00:42,803 WARN L170 areAnnotationChecker]: L1036-4 has no Hoare annotation [2020-07-28 18:00:42,803 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-28 18:00:42,803 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-28 18:00:42,803 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-28 18:00:42,803 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-28 18:00:42,803 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2020-07-28 18:00:42,803 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2020-07-28 18:00:42,803 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2020-07-28 18:00:42,803 WARN L170 areAnnotationChecker]: L1036-3 has no Hoare annotation [2020-07-28 18:00:42,804 WARN L170 areAnnotationChecker]: L1036-3 has no Hoare annotation [2020-07-28 18:00:42,804 WARN L170 areAnnotationChecker]: L1040 has no Hoare annotation [2020-07-28 18:00:42,804 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:00:42,804 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:00:42,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:00:42 BoogieIcfgContainer [2020-07-28 18:00:42,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:00:42,808 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:00:42,808 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:00:42,809 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:00:42,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:00:39" (3/4) ... [2020-07-28 18:00:42,811 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 18:00:42,887 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:00:42,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:00:42,890 INFO L168 Benchmark]: Toolchain (without parser) took 4904.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:42,891 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:00:42,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:42,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.40 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:42,893 INFO L168 Benchmark]: Boogie Preprocessor took 67.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:00:42,893 INFO L168 Benchmark]: RCFGBuilder took 634.24 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: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:42,894 INFO L168 Benchmark]: TraceAbstraction took 3273.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:00:42,894 INFO L168 Benchmark]: Witness Printer took 78.96 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: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:42,898 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 740.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.40 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 634.24 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: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3273.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 78.96 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: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] SLL* head = malloc(sizeof(SLL)); [L994] head->next = ((void*)0) [L995] head->prev = ((void*)0) [L996] head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 [L1011] x->next = malloc(sizeof(SLL)) [L1012] EXPR x->next [L1012] x->next->prev = x [L1013] EXPR x->next [L1013] x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1019] EXPR x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next [L1025] x = x->next [L1026] EXPR x->data [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 164 SDtfs, 91 SDslu, 190 SDs, 0 SdLazy, 141 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 1533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...