./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condgf.c --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/array-fpi/condgf.c -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 3db997e4c6db3c411598e419466e5d2758daf642 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:49:17,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:49:17,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:49:17,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:49:17,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:49:17,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:49:17,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:49:17,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:49:17,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:49:17,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:49:17,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:49:17,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:49:17,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:49:17,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:49:17,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:49:17,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:49:17,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:49:17,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:49:17,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:49:17,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:49:17,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:49:17,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:49:17,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:49:17,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:49:17,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:49:17,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:49:17,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:49:17,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:49:17,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:49:17,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:49:17,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:49:17,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:49:17,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:49:17,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:49:17,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:49:17,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:49:17,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:49:17,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:49:17,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:49:17,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:49:17,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:49:17,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 14:49:17,667 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:49:17,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:49:17,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:49:17,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:49:17,669 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:49:17,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:49:17,670 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:49:17,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:49:17,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:49:17,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:49:17,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:49:17,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:49:17,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:49:17,672 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:49:17,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:49:17,673 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:49:17,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:49:17,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:49:17,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:49:17,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:49:17,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:49:17,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:49:17,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:49:17,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:49:17,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:49:17,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:49:17,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:49:17,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:49:17,677 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:49:17,677 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 -> 3db997e4c6db3c411598e419466e5d2758daf642 [2020-07-28 14:49:17,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:49:18,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:49:18,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:49:18,017 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:49:18,018 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:49:18,019 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condgf.c [2020-07-28 14:49:18,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2ddb4df/0eac9a7265ad4a29b70c6f8fee4151c1/FLAG780735190 [2020-07-28 14:49:18,553 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:49:18,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condgf.c [2020-07-28 14:49:18,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2ddb4df/0eac9a7265ad4a29b70c6f8fee4151c1/FLAG780735190 [2020-07-28 14:49:18,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2ddb4df/0eac9a7265ad4a29b70c6f8fee4151c1 [2020-07-28 14:49:18,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:49:18,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:49:18,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:49:18,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:49:18,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:49:18,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:49:18" (1/1) ... [2020-07-28 14:49:18,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d085cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:18, skipping insertion in model container [2020-07-28 14:49:18,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:49:18" (1/1) ... [2020-07-28 14:49:18,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:49:18,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:49:19,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:49:19,111 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:49:19,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:49:19,153 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:49:19,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19 WrapperNode [2020-07-28 14:49:19,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:49:19,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:49:19,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:49:19,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:49:19,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (1/1) ... [2020-07-28 14:49:19,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (1/1) ... [2020-07-28 14:49:19,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:49:19,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:49:19,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:49:19,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:49:19,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (1/1) ... [2020-07-28 14:49:19,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (1/1) ... [2020-07-28 14:49:19,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (1/1) ... [2020-07-28 14:49:19,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (1/1) ... [2020-07-28 14:49:19,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (1/1) ... [2020-07-28 14:49:19,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (1/1) ... [2020-07-28 14:49:19,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (1/1) ... [2020-07-28 14:49:19,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:49:19,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:49:19,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:49:19,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:49:19,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (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 14:49:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:49:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:49:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:49:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:49:19,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:49:19,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:49:19,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:49:19,885 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:49:19,885 INFO L295 CfgBuilder]: Removed 12 assume(true) statements. [2020-07-28 14:49:19,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:49:19 BoogieIcfgContainer [2020-07-28 14:49:19,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:49:19,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:49:19,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:49:19,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:49:19,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:49:18" (1/3) ... [2020-07-28 14:49:19,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1fc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:49:19, skipping insertion in model container [2020-07-28 14:49:19,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:19" (2/3) ... [2020-07-28 14:49:19,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1fc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:49:19, skipping insertion in model container [2020-07-28 14:49:19,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:49:19" (3/3) ... [2020-07-28 14:49:19,900 INFO L109 eAbstractionObserver]: Analyzing ICFG condgf.c [2020-07-28 14:49:19,911 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:49:19,920 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:49:19,934 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:49:19,956 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:49:19,957 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:49:19,957 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:49:19,957 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:49:19,957 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:49:19,958 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:49:19,958 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:49:19,958 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:49:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-28 14:49:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 14:49:19,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:19,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:19,983 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:19,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:19,990 INFO L82 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2020-07-28 14:49:19,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:19,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803847583] [2020-07-28 14:49:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:20,149 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {28#true} is VALID [2020-07-28 14:49:20,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~post6, main_#t~mem11, main_#t~post10, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {28#true} is VALID [2020-07-28 14:49:20,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {28#true} is VALID [2020-07-28 14:49:20,152 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#true} assume 0 == assume_abort_if_not_~cond;assume false; {29#false} is VALID [2020-07-28 14:49:20,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#false} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(0, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {29#false} is VALID [2020-07-28 14:49:20,153 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#false} assume !(main_~i~0 < ~N~0); {29#false} is VALID [2020-07-28 14:49:20,153 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#false} main_~i~0 := 0; {29#false} is VALID [2020-07-28 14:49:20,153 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#false} assume !(main_~i~0 < ~N~0); {29#false} is VALID [2020-07-28 14:49:20,154 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#false} main_~i~0 := 0; {29#false} is VALID [2020-07-28 14:49:20,155 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#false} assume !(main_~i~0 < ~N~0); {29#false} is VALID [2020-07-28 14:49:20,155 INFO L280 TraceCheckUtils]: 10: Hoare triple {29#false} main_~i~0 := 0; {29#false} is VALID [2020-07-28 14:49:20,155 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem11 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {29#false} is VALID [2020-07-28 14:49:20,156 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} assume 0 == __VERIFIER_assert_~cond; {29#false} is VALID [2020-07-28 14:49:20,158 INFO L280 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-28 14:49:20,161 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 14:49:20,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803847583] [2020-07-28 14:49:20,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:49:20,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:49:20,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313898899] [2020-07-28 14:49:20,176 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-28 14:49:20,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:20,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:49:20,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:20,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:49:20,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:49:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:49:20,239 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2020-07-28 14:49:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:20,310 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2020-07-28 14:49:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:49:20,311 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-28 14:49:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:49:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2020-07-28 14:49:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:49:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2020-07-28 14:49:20,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2020-07-28 14:49:20,490 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 14:49:20,501 INFO L225 Difference]: With dead ends: 46 [2020-07-28 14:49:20,503 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 14:49:20,510 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 14:49:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 14:49:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-28 14:49:20,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:20,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-28 14:49:20,580 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 14:49:20,580 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 14:49:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:20,584 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-28 14:49:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-28 14:49:20,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:20,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:20,585 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 14:49:20,586 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 14:49:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:20,589 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-28 14:49:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-28 14:49:20,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:20,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:20,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:20,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 14:49:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-28 14:49:20,595 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-28 14:49:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:20,595 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-28 14:49:20,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:49:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-28 14:49:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 14:49:20,597 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:20,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:20,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:49:20,598 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2020-07-28 14:49:20,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:20,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757607862] [2020-07-28 14:49:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:20,700 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {155#true} is VALID [2020-07-28 14:49:20,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~post6, main_#t~mem11, main_#t~post10, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {155#true} is VALID [2020-07-28 14:49:20,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {155#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {157#(<= 1 ~N~0)} is VALID [2020-07-28 14:49:20,705 INFO L280 TraceCheckUtils]: 3: Hoare triple {157#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond); {157#(<= 1 ~N~0)} is VALID [2020-07-28 14:49:20,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {157#(<= 1 ~N~0)} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(0, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {158#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-28 14:49:20,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {158#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} assume !(main_~i~0 < ~N~0); {156#false} is VALID [2020-07-28 14:49:20,719 INFO L280 TraceCheckUtils]: 6: Hoare triple {156#false} main_~i~0 := 0; {156#false} is VALID [2020-07-28 14:49:20,719 INFO L280 TraceCheckUtils]: 7: Hoare triple {156#false} assume !(main_~i~0 < ~N~0); {156#false} is VALID [2020-07-28 14:49:20,720 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#false} main_~i~0 := 0; {156#false} is VALID [2020-07-28 14:49:20,720 INFO L280 TraceCheckUtils]: 9: Hoare triple {156#false} assume !(main_~i~0 < ~N~0); {156#false} is VALID [2020-07-28 14:49:20,720 INFO L280 TraceCheckUtils]: 10: Hoare triple {156#false} main_~i~0 := 0; {156#false} is VALID [2020-07-28 14:49:20,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {156#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem11 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {156#false} is VALID [2020-07-28 14:49:20,721 INFO L280 TraceCheckUtils]: 12: Hoare triple {156#false} assume 0 == __VERIFIER_assert_~cond; {156#false} is VALID [2020-07-28 14:49:20,722 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#false} assume !false; {156#false} is VALID [2020-07-28 14:49:20,723 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 14:49:20,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757607862] [2020-07-28 14:49:20,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:49:20,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:49:20,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344232413] [2020-07-28 14:49:20,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 14:49:20,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:20,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:49:20,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:20,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:49:20,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:20,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:49:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:49:20,775 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2020-07-28 14:49:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:20,984 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2020-07-28 14:49:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:49:20,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 14:49:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:49:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-28 14:49:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:49:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-28 14:49:21,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2020-07-28 14:49:21,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:21,091 INFO L225 Difference]: With dead ends: 48 [2020-07-28 14:49:21,091 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 14:49:21,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:49:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 14:49:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2020-07-28 14:49:21,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:21,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 24 states. [2020-07-28 14:49:21,117 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 24 states. [2020-07-28 14:49:21,117 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 24 states. [2020-07-28 14:49:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:21,122 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-28 14:49:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-28 14:49:21,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:21,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:21,123 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 34 states. [2020-07-28 14:49:21,123 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 34 states. [2020-07-28 14:49:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:21,131 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-28 14:49:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-28 14:49:21,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:21,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:21,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:21,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 14:49:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-28 14:49:21,143 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2020-07-28 14:49:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:21,145 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-28 14:49:21,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:49:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-28 14:49:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:49:21,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:21,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:21,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:49:21,148 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:21,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:21,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2020-07-28 14:49:21,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:21,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560419542] [2020-07-28 14:49:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:21,631 INFO L280 TraceCheckUtils]: 0: Hoare triple {319#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {319#true} is VALID [2020-07-28 14:49:21,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {319#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~post6, main_#t~mem11, main_#t~post10, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {319#true} is VALID [2020-07-28 14:49:21,632 INFO L280 TraceCheckUtils]: 2: Hoare triple {319#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {319#true} is VALID [2020-07-28 14:49:21,632 INFO L280 TraceCheckUtils]: 3: Hoare triple {319#true} assume !(0 == assume_abort_if_not_~cond); {319#true} is VALID [2020-07-28 14:49:21,636 INFO L280 TraceCheckUtils]: 4: Hoare triple {319#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(0, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {321#(and (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)) 2)) |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:49:21,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {321#(and (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)) 2)) |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !!(main_~i~0 < ~N~0);call write~int(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {322#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:21,639 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {323#(and (= 0 ULTIMATE.start_main_~a~0.offset) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ULTIMATE.start_main_~i~0 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 2))} is VALID [2020-07-28 14:49:21,640 INFO L280 TraceCheckUtils]: 7: Hoare triple {323#(and (= 0 ULTIMATE.start_main_~a~0.offset) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ULTIMATE.start_main_~i~0 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 2))} assume !(main_~i~0 < ~N~0); {324#(and (<= ~N~0 1) (= 0 ULTIMATE.start_main_~a~0.offset) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 2))} is VALID [2020-07-28 14:49:21,641 INFO L280 TraceCheckUtils]: 8: Hoare triple {324#(and (<= ~N~0 1) (= 0 ULTIMATE.start_main_~a~0.offset) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 2))} main_~i~0 := 0; {325#(and (not (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) ~N~0)) (= 0 ULTIMATE.start_main_~a~0.offset) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:21,643 INFO L280 TraceCheckUtils]: 9: Hoare triple {325#(and (not (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) ~N~0)) (= 0 ULTIMATE.start_main_~a~0.offset) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem5 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem4 + main_#t~mem5, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem4;havoc main_#t~mem5; {326#(not (= ~N~0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:21,644 INFO L280 TraceCheckUtils]: 10: Hoare triple {326#(not (= ~N~0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {326#(not (= ~N~0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:21,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {326#(not (= ~N~0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} assume !(main_~i~0 < ~N~0); {326#(not (= ~N~0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:21,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {326#(not (= ~N~0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} main_~i~0 := 0; {326#(not (= ~N~0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:21,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {326#(not (= ~N~0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem7 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8); {327#(not (= ~N~0 |ULTIMATE.start_main_#t~mem7|))} is VALID [2020-07-28 14:49:21,648 INFO L280 TraceCheckUtils]: 14: Hoare triple {327#(not (= ~N~0 |ULTIMATE.start_main_#t~mem7|))} assume main_#t~mem7 == ~N~0;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem8 - 1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem8; {320#false} is VALID [2020-07-28 14:49:21,648 INFO L280 TraceCheckUtils]: 15: Hoare triple {320#false} main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; {320#false} is VALID [2020-07-28 14:49:21,648 INFO L280 TraceCheckUtils]: 16: Hoare triple {320#false} assume !(main_~i~0 < ~N~0); {320#false} is VALID [2020-07-28 14:49:21,648 INFO L280 TraceCheckUtils]: 17: Hoare triple {320#false} main_~i~0 := 0; {320#false} is VALID [2020-07-28 14:49:21,649 INFO L280 TraceCheckUtils]: 18: Hoare triple {320#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem11 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {320#false} is VALID [2020-07-28 14:49:21,649 INFO L280 TraceCheckUtils]: 19: Hoare triple {320#false} assume 0 == __VERIFIER_assert_~cond; {320#false} is VALID [2020-07-28 14:49:21,650 INFO L280 TraceCheckUtils]: 20: Hoare triple {320#false} assume !false; {320#false} is VALID [2020-07-28 14:49:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:49:21,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560419542] [2020-07-28 14:49:21,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101531541] [2020-07-28 14:49:21,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:49:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:21,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-28 14:49:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:21,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:49:21,900 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-28 14:49:21,901 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:49:21,910 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:49:21,911 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:49:21,911 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-28 14:49:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 14:49:21,994 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-28 14:49:21,995 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:49:22,006 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:49:22,007 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:49:22,007 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-07-28 14:49:22,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 14:49:22,262 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-07-28 14:49:22,266 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:49:22,275 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:49:22,284 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-28 14:49:22,285 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:27 [2020-07-28 14:49:22,292 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 14:49:22,293 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_~a~0.offset]. (let ((.cse1 (select |v_#memory_int_15| |ULTIMATE.start_main_~#sum~0.base|))) (let ((.cse0 (select (select |v_#memory_int_15| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (.cse2 (select .cse1 |ULTIMATE.start_main_~#sum~0.offset|))) (and (= 2 .cse0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 1) (= |#memory_int| (store |v_#memory_int_15| |ULTIMATE.start_main_~#sum~0.base| (store .cse1 |ULTIMATE.start_main_~#sum~0.offset| (+ .cse0 .cse2)))) (= 0 .cse2)))) [2020-07-28 14:49:22,293 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_~a~0.offset]. (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|))) (and (= 2 .cse0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) .cse0))) [2020-07-28 14:49:22,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 14:49:22,544 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2020-07-28 14:49:22,546 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:49:22,555 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:49:22,566 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:49:22,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:7 [2020-07-28 14:49:22,570 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 14:49:22,570 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_~a~0.offset, |ULTIMATE.start_main_~#sum~0.base|, |ULTIMATE.start_main_~#sum~0.offset|]. (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|))) (and (= 2 .cse0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= .cse0 |ULTIMATE.start_main_#t~mem7|) (<= ~N~0 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) .cse0))) [2020-07-28 14:49:22,571 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ~N~0 1) (<= 2 |ULTIMATE.start_main_#t~mem7|)) [2020-07-28 14:49:22,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {319#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {319#true} is VALID [2020-07-28 14:49:22,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {319#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~post6, main_#t~mem11, main_#t~post10, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {319#true} is VALID [2020-07-28 14:49:22,653 INFO L280 TraceCheckUtils]: 2: Hoare triple {319#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {319#true} is VALID [2020-07-28 14:49:22,653 INFO L280 TraceCheckUtils]: 3: Hoare triple {319#true} assume !(0 == assume_abort_if_not_~cond); {319#true} is VALID [2020-07-28 14:49:22,660 INFO L280 TraceCheckUtils]: 4: Hoare triple {319#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(0, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {343#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 0 ULTIMATE.start_main_~i~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:22,671 INFO L280 TraceCheckUtils]: 5: Hoare triple {343#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 0 ULTIMATE.start_main_~i~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} assume !!(main_~i~0 < ~N~0);call write~int(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {347#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 0 ULTIMATE.start_main_~i~0) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:22,672 INFO L280 TraceCheckUtils]: 6: Hoare triple {347#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 0 ULTIMATE.start_main_~i~0) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {351#(and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 14:49:22,677 INFO L280 TraceCheckUtils]: 7: Hoare triple {351#(and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < ~N~0); {355#(and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 1) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:22,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {355#(and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 1) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} main_~i~0 := 0; {359#(and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:49:22,684 INFO L280 TraceCheckUtils]: 9: Hoare triple {359#(and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem5 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem4 + main_#t~mem5, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem4;havoc main_#t~mem5; {363#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ~N~0 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))))} is VALID [2020-07-28 14:49:22,685 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ~N~0 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {363#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ~N~0 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))))} is VALID [2020-07-28 14:49:22,686 INFO L280 TraceCheckUtils]: 11: Hoare triple {363#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ~N~0 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))))} assume !(main_~i~0 < ~N~0); {363#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ~N~0 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))))} is VALID [2020-07-28 14:49:22,689 INFO L280 TraceCheckUtils]: 12: Hoare triple {363#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ~N~0 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))))} main_~i~0 := 0; {363#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ~N~0 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))))} is VALID [2020-07-28 14:49:22,691 INFO L280 TraceCheckUtils]: 13: Hoare triple {363#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= ~N~0 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))))} assume !!(main_~i~0 < ~N~0);call main_#t~mem7 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8); {376#(and (<= ~N~0 1) (<= 2 |ULTIMATE.start_main_#t~mem7|))} is VALID [2020-07-28 14:49:22,692 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#(and (<= ~N~0 1) (<= 2 |ULTIMATE.start_main_#t~mem7|))} assume main_#t~mem7 == ~N~0;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem8 - 1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem8; {320#false} is VALID [2020-07-28 14:49:22,693 INFO L280 TraceCheckUtils]: 15: Hoare triple {320#false} main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; {320#false} is VALID [2020-07-28 14:49:22,693 INFO L280 TraceCheckUtils]: 16: Hoare triple {320#false} assume !(main_~i~0 < ~N~0); {320#false} is VALID [2020-07-28 14:49:22,693 INFO L280 TraceCheckUtils]: 17: Hoare triple {320#false} main_~i~0 := 0; {320#false} is VALID [2020-07-28 14:49:22,693 INFO L280 TraceCheckUtils]: 18: Hoare triple {320#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem11 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {320#false} is VALID [2020-07-28 14:49:22,694 INFO L280 TraceCheckUtils]: 19: Hoare triple {320#false} assume 0 == __VERIFIER_assert_~cond; {320#false} is VALID [2020-07-28 14:49:22,694 INFO L280 TraceCheckUtils]: 20: Hoare triple {320#false} assume !false; {320#false} is VALID [2020-07-28 14:49:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:49:22,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:49:22,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-28 14:49:22,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171963968] [2020-07-28 14:49:22,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-07-28 14:49:22,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:22,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-28 14:49:22,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:22,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-28 14:49:22,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:22,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-28 14:49:22,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-07-28 14:49:22,770 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 16 states. [2020-07-28 14:49:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:23,893 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2020-07-28 14:49:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 14:49:23,894 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-07-28 14:49:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 14:49:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2020-07-28 14:49:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 14:49:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2020-07-28 14:49:23,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2020-07-28 14:49:24,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:24,004 INFO L225 Difference]: With dead ends: 57 [2020-07-28 14:49:24,004 INFO L226 Difference]: Without dead ends: 47 [2020-07-28 14:49:24,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2020-07-28 14:49:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-28 14:49:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-07-28 14:49:24,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:24,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 36 states. [2020-07-28 14:49:24,035 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 36 states. [2020-07-28 14:49:24,035 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 36 states. [2020-07-28 14:49:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:24,039 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-28 14:49:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-28 14:49:24,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:24,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:24,040 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 47 states. [2020-07-28 14:49:24,041 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 47 states. [2020-07-28 14:49:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:24,043 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-28 14:49:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-28 14:49:24,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:24,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:24,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:24,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-28 14:49:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-07-28 14:49:24,046 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 21 [2020-07-28 14:49:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:24,046 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-07-28 14:49:24,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-28 14:49:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-28 14:49:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:49:24,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:24,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:24,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 14:49:24,250 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:24,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:24,251 INFO L82 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2020-07-28 14:49:24,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:24,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562025450] [2020-07-28 14:49:24,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:49:24,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:49:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:49:24,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:49:24,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:49:24,336 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:49:24,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 14:49:24,381 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:49:24,381 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:49:24,381 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:49:24,381 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:49:24,382 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-28 14:49:24,382 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:49:24,382 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:49:24,382 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:49:24,382 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 14:49:24,382 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:49:24,383 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:49:24,383 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:49:24,383 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-28 14:49:24,383 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-28 14:49:24,383 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:49:24,384 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:49:24,384 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:49:24,384 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-28 14:49:24,384 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 14:49:24,384 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-28 14:49:24,384 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-28 14:49:24,385 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-28 14:49:24,385 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-28 14:49:24,385 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 14:49:24,385 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 14:49:24,385 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-28 14:49:24,388 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-28 14:49:24,390 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-28 14:49:24,390 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-28 14:49:24,391 WARN L170 areAnnotationChecker]: L49-4 has no Hoare annotation [2020-07-28 14:49:24,391 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:49:24,391 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:49:24,391 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:49:24,391 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:49:24,391 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 14:49:24,391 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-28 14:49:24,391 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 14:49:24,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:49:24 BoogieIcfgContainer [2020-07-28 14:49:24,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:49:24,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:49:24,395 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:49:24,399 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:49:24,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:49:19" (3/4) ... [2020-07-28 14:49:24,402 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:49:24,499 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:49:24,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:49:24,503 INFO L168 Benchmark]: Toolchain (without parser) took 5629.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 950.8 MB in the beginning and 1.0 GB in the end (delta: -54.4 MB). Peak memory consumption was 153.2 MB. Max. memory is 11.5 GB. [2020-07-28 14:49:24,503 INFO L168 Benchmark]: CDTParser took 0.37 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 14:49:24,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.48 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:49:24,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:49:24,505 INFO L168 Benchmark]: Boogie Preprocessor took 39.43 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 14:49:24,506 INFO L168 Benchmark]: RCFGBuilder took 585.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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:49:24,507 INFO L168 Benchmark]: TraceAbstraction took 4503.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.9 MB). Peak memory consumption was 151.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:49:24,507 INFO L168 Benchmark]: Witness Printer took 105.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:49:24,510 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.37 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 278.48 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 110.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.43 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 585.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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4503.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.9 MB). Peak memory consumption was 151.8 MB. Max. memory is 11.5 GB. * Witness Printer took 105.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 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: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) [L11] COND FALSE !(!cond) VAL [N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 0 [L30] i=0 VAL [N=1] [L30] COND TRUE i