./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/eqn2f.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/eqn2f.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 dcd5d60160fe184aaf94c5399f10c7136860a8a0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:54,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:49:54,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:49:54,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:49:54,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:49:54,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:49:54,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:49:54,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:49:54,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:49:54,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:49:54,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:49:54,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:49:54,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:49:54,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:49:54,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:49:54,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:49:54,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:49:54,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:49:54,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:49:54,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:49:54,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:49:54,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:49:54,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:49:54,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:49:54,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:49:54,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:49:54,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:49:54,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:49:54,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:49:54,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:49:54,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:49:54,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:49:54,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:49:54,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:49:54,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:49:54,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:49:54,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:49:54,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:49:54,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:49:54,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:49:54,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:49:54,678 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:54,692 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:49:54,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:49:54,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:49:54,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:49:54,694 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:49:54,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:49:54,695 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:49:54,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:49:54,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:49:54,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:49:54,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:49:54,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:49:54,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:49:54,697 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:49:54,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:49:54,698 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:49:54,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:49:54,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:49:54,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:49:54,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:49:54,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:49:54,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:49:54,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:49:54,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:49:54,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:49:54,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:49:54,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:49:54,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:49:54,701 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:49:54,702 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 -> dcd5d60160fe184aaf94c5399f10c7136860a8a0 [2020-07-28 14:49:55,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:49:55,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:49:55,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:49:55,020 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:49:55,021 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:49:55,022 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/eqn2f.c [2020-07-28 14:49:55,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10a79a23/167d515a02cc4e03bc99b7c0b1ea471c/FLAGbf03c4cdf [2020-07-28 14:49:55,593 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:49:55,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/eqn2f.c [2020-07-28 14:49:55,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10a79a23/167d515a02cc4e03bc99b7c0b1ea471c/FLAGbf03c4cdf [2020-07-28 14:49:55,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10a79a23/167d515a02cc4e03bc99b7c0b1ea471c [2020-07-28 14:49:55,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:49:55,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:49:55,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:49:55,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:49:55,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:49:55,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:49:55" (1/1) ... [2020-07-28 14:49:55,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c24cc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:55, skipping insertion in model container [2020-07-28 14:49:55,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:49:55" (1/1) ... [2020-07-28 14:49:55,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:49:55,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:49:56,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:49:56,149 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:49:56,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:49:56,190 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:49:56,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:56 WrapperNode [2020-07-28 14:49:56,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:49:56,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:49:56,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:49:56,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:49:56,201 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:56" (1/1) ... [2020-07-28 14:49:56,267 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:56" (1/1) ... [2020-07-28 14:49:56,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:49:56,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:49:56,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:49:56,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:49:56,305 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:56" (1/1) ... [2020-07-28 14:49:56,305 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:56" (1/1) ... [2020-07-28 14:49:56,307 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:56" (1/1) ... [2020-07-28 14:49:56,308 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:56" (1/1) ... [2020-07-28 14:49:56,315 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:56" (1/1) ... [2020-07-28 14:49:56,321 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:56" (1/1) ... [2020-07-28 14:49:56,322 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:56" (1/1) ... [2020-07-28 14:49:56,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:49:56,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:49:56,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:49:56,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:49:56,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:56" (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:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:49:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:49:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:49:56,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:49:56,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:49:56,793 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:49:56,794 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 14:49:56,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:49:56 BoogieIcfgContainer [2020-07-28 14:49:56,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:49:56,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:49:56,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:49:56,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:49:56,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:49:55" (1/3) ... [2020-07-28 14:49:56,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d48742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:49:56, skipping insertion in model container [2020-07-28 14:49:56,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:56" (2/3) ... [2020-07-28 14:49:56,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d48742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:49:56, skipping insertion in model container [2020-07-28 14:49:56,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:49:56" (3/3) ... [2020-07-28 14:49:56,808 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2f.c [2020-07-28 14:49:56,818 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:49:56,826 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:49:56,838 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:49:56,858 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:49:56,858 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:49:56,859 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:49:56,859 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:49:56,859 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:49:56,859 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:49:56,859 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:49:56,860 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:49:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-28 14:49:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 14:49:56,880 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:56,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:56,881 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2020-07-28 14:49:56,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:56,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888601636] [2020-07-28 14:49:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:57,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {24#true} is VALID [2020-07-28 14:49:57,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {24#true} is VALID [2020-07-28 14:49:57,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#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; {24#true} is VALID [2020-07-28 14:49:57,048 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2020-07-28 14:49:57,048 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#false} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {25#false} is VALID [2020-07-28 14:49:57,049 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#false} assume !(main_~i~0 < ~N~0); {25#false} is VALID [2020-07-28 14:49:57,049 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#false} main_~i~0 := 1; {25#false} is VALID [2020-07-28 14:49:57,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} assume !(main_~i~0 < ~N~0); {25#false} is VALID [2020-07-28 14:49:57,050 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} main_~i~0 := 0; {25#false} is VALID [2020-07-28 14:49:57,051 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {25#false} is VALID [2020-07-28 14:49:57,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond; {25#false} is VALID [2020-07-28 14:49:57,051 INFO L280 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-28 14:49:57,055 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:57,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888601636] [2020-07-28 14:49:57,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:49:57,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:49:57,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082370694] [2020-07-28 14:49:57,069 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-28 14:49:57,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:57,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:49:57,130 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 14:49:57,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:49:57,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:57,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:49:57,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:49:57,145 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-28 14:49:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:57,214 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-07-28 14:49:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:49:57,214 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-28 14:49:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:49:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2020-07-28 14:49:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:49:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2020-07-28 14:49:57,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2020-07-28 14:49:57,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:57,373 INFO L225 Difference]: With dead ends: 38 [2020-07-28 14:49:57,373 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 14:49:57,381 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:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 14:49:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-28 14:49:57,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:57,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-28 14:49:57,422 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 14:49:57,423 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 14:49:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:57,426 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-28 14:49:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 14:49:57,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:57,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:57,428 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 14:49:57,428 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 14:49:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:57,435 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-28 14:49:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 14:49:57,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:57,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:57,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:57,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 14:49:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-28 14:49:57,447 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2020-07-28 14:49:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:57,447 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-28 14:49:57,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:49:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 14:49:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 14:49:57,448 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:57,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:57,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:49:57,449 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:57,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2020-07-28 14:49:57,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:57,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365676504] [2020-07-28 14:49:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:57,501 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:49:57,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451869049] [2020-07-28 14:49:57,502 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:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:57,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 14:49:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:57,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:49:57,694 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:49:57,695 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-28 14:49:57,697 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:49:57,732 INFO L624 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-07-28 14:49:57,742 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:49:57,743 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2020-07-28 14:49:57,749 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 14:49:57,749 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_9|, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_~a~0.offset]. (= (let ((.cse0 (store |v_#memory_int_9| ULTIMATE.start_main_~a~0.base (store (select |v_#memory_int_9| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset 8)))) (store .cse0 ULTIMATE.start_main_~b~0.base (store (select .cse0 ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset 1))) |#memory_int|) [2020-07-28 14:49:57,750 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) [2020-07-28 14:49:57,892 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:49:57,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {128#true} is VALID [2020-07-28 14:49:57,964 INFO L280 TraceCheckUtils]: 1: Hoare triple {128#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {128#true} is VALID [2020-07-28 14:49:57,965 INFO L280 TraceCheckUtils]: 2: Hoare triple {128#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; {128#true} is VALID [2020-07-28 14:49:57,965 INFO L280 TraceCheckUtils]: 3: Hoare triple {128#true} assume !(0 == assume_abort_if_not_~cond); {128#true} is VALID [2020-07-28 14:49:57,968 INFO L280 TraceCheckUtils]: 4: Hoare triple {128#true} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {145#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset))} is VALID [2020-07-28 14:49:57,969 INFO L280 TraceCheckUtils]: 5: Hoare triple {145#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset))} assume !(main_~i~0 < ~N~0); {145#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset))} is VALID [2020-07-28 14:49:57,970 INFO L280 TraceCheckUtils]: 6: Hoare triple {145#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset))} main_~i~0 := 1; {145#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset))} is VALID [2020-07-28 14:49:57,971 INFO L280 TraceCheckUtils]: 7: Hoare triple {145#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset))} assume !(main_~i~0 < ~N~0); {145#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset))} is VALID [2020-07-28 14:49:57,972 INFO L280 TraceCheckUtils]: 8: Hoare triple {145#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset))} main_~i~0 := 0; {158#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:49:57,974 INFO L280 TraceCheckUtils]: 9: Hoare triple {158#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= 0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {162#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 14:49:57,975 INFO L280 TraceCheckUtils]: 10: Hoare triple {162#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {129#false} is VALID [2020-07-28 14:49:57,976 INFO L280 TraceCheckUtils]: 11: Hoare triple {129#false} assume !false; {129#false} is VALID [2020-07-28 14:49:57,977 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:57,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365676504] [2020-07-28 14:49:57,978 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:49:57,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451869049] [2020-07-28 14:49:57,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:49:57,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 14:49:57,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403450597] [2020-07-28 14:49:57,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 14:49:57,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:57,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 14:49:58,003 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 14:49:58,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 14:49:58,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:58,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 14:49:58,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:49:58,005 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2020-07-28 14:49:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:58,221 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-28 14:49:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 14:49:58,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 14:49:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:49:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-28 14:49:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:49:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-28 14:49:58,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2020-07-28 14:49:58,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:58,285 INFO L225 Difference]: With dead ends: 34 [2020-07-28 14:49:58,285 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 14:49:58,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-28 14:49:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 14:49:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2020-07-28 14:49:58,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:58,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 23 states. [2020-07-28 14:49:58,296 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 23 states. [2020-07-28 14:49:58,297 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 23 states. [2020-07-28 14:49:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:58,299 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-28 14:49:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-28 14:49:58,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:58,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:58,300 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 32 states. [2020-07-28 14:49:58,301 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 32 states. [2020-07-28 14:49:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:58,303 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-28 14:49:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-28 14:49:58,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:58,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:58,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:58,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 14:49:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-28 14:49:58,307 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2020-07-28 14:49:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:58,307 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-28 14:49:58,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 14:49:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-28 14:49:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 14:49:58,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:58,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:58,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 14:49:58,522 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1755224028, now seen corresponding path program 1 times [2020-07-28 14:49:58,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:58,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602487956] [2020-07-28 14:49:58,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:58,546 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:49:58,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306104468] [2020-07-28 14:49:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:49:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:58,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 14:49:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:58,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:49:58,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {307#true} is VALID [2020-07-28 14:49:58,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {307#true} is VALID [2020-07-28 14:49:58,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {307#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; {307#true} is VALID [2020-07-28 14:49:58,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {307#true} assume !(0 == assume_abort_if_not_~cond); {307#true} is VALID [2020-07-28 14:49:58,735 INFO L280 TraceCheckUtils]: 4: Hoare triple {307#true} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {324#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:49:58,736 INFO L280 TraceCheckUtils]: 5: Hoare triple {324#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {328#(<= ~N~0 1)} is VALID [2020-07-28 14:49:58,737 INFO L280 TraceCheckUtils]: 6: Hoare triple {328#(<= ~N~0 1)} main_~i~0 := 1; {332#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:49:58,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {332#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem6 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (main_~i~0 - 1), 8);call main_#t~mem7 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(main_#t~mem6 + main_#t~mem7, main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem7;havoc main_#t~mem6; {308#false} is VALID [2020-07-28 14:49:58,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {308#false} main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; {308#false} is VALID [2020-07-28 14:49:58,739 INFO L280 TraceCheckUtils]: 9: Hoare triple {308#false} assume !(main_~i~0 < ~N~0); {308#false} is VALID [2020-07-28 14:49:58,740 INFO L280 TraceCheckUtils]: 10: Hoare triple {308#false} main_~i~0 := 0; {308#false} is VALID [2020-07-28 14:49:58,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {308#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {308#false} is VALID [2020-07-28 14:49:58,740 INFO L280 TraceCheckUtils]: 12: Hoare triple {308#false} assume 0 == __VERIFIER_assert_~cond; {308#false} is VALID [2020-07-28 14:49:58,741 INFO L280 TraceCheckUtils]: 13: Hoare triple {308#false} assume !false; {308#false} is VALID [2020-07-28 14:49:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:49:58,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602487956] [2020-07-28 14:49:58,742 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:49:58,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306104468] [2020-07-28 14:49:58,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:49:58,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 14:49:58,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478439545] [2020-07-28 14:49:58,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-28 14:49:58,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:58,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 14:49:58,764 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:58,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 14:49:58,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 14:49:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:49:58,765 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2020-07-28 14:49:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:58,973 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-28 14:49:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 14:49:58,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-28 14:49:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:49:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-28 14:49:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:49:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-28 14:49:58,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2020-07-28 14:49:59,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:59,054 INFO L225 Difference]: With dead ends: 49 [2020-07-28 14:49:59,054 INFO L226 Difference]: Without dead ends: 40 [2020-07-28 14:49:59,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-28 14:49:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-28 14:49:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2020-07-28 14:49:59,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:59,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 23 states. [2020-07-28 14:49:59,069 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 23 states. [2020-07-28 14:49:59,069 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 23 states. [2020-07-28 14:49:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:59,073 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-28 14:49:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-28 14:49:59,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:59,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:59,074 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 40 states. [2020-07-28 14:49:59,074 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 40 states. [2020-07-28 14:49:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:59,078 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-28 14:49:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-28 14:49:59,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:59,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:59,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:59,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 14:49:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-28 14:49:59,081 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2020-07-28 14:49:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:59,082 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-28 14:49:59,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 14:49:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-28 14:49:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 14:49:59,083 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:59,083 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:59,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:49:59,297 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:59,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:59,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1842440164, now seen corresponding path program 1 times [2020-07-28 14:49:59,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:59,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578406734] [2020-07-28 14:49:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:59,322 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:49:59,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420532478] [2020-07-28 14:49:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:49:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:59,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 14:49:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:59,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:49:59,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {527#true} is VALID [2020-07-28 14:49:59,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {527#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {527#true} is VALID [2020-07-28 14:49:59,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {527#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; {527#true} is VALID [2020-07-28 14:49:59,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {527#true} assume !(0 == assume_abort_if_not_~cond); {527#true} is VALID [2020-07-28 14:49:59,506 INFO L280 TraceCheckUtils]: 4: Hoare triple {527#true} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {544#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:49:59,507 INFO L280 TraceCheckUtils]: 5: Hoare triple {544#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(4 + main_#t~mem4, main_~a~0.base, main_~a~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem4; {548#(<= 2 ~N~0)} is VALID [2020-07-28 14:49:59,508 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#(<= 2 ~N~0)} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {548#(<= 2 ~N~0)} is VALID [2020-07-28 14:49:59,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {548#(<= 2 ~N~0)} assume !(main_~i~0 < ~N~0); {548#(<= 2 ~N~0)} is VALID [2020-07-28 14:49:59,509 INFO L280 TraceCheckUtils]: 8: Hoare triple {548#(<= 2 ~N~0)} main_~i~0 := 1; {558#(and (<= 2 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 14:49:59,510 INFO L280 TraceCheckUtils]: 9: Hoare triple {558#(and (<= 2 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < ~N~0); {528#false} is VALID [2020-07-28 14:49:59,510 INFO L280 TraceCheckUtils]: 10: Hoare triple {528#false} main_~i~0 := 0; {528#false} is VALID [2020-07-28 14:49:59,510 INFO L280 TraceCheckUtils]: 11: Hoare triple {528#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {528#false} is VALID [2020-07-28 14:49:59,510 INFO L280 TraceCheckUtils]: 12: Hoare triple {528#false} assume 0 == __VERIFIER_assert_~cond; {528#false} is VALID [2020-07-28 14:49:59,511 INFO L280 TraceCheckUtils]: 13: Hoare triple {528#false} assume !false; {528#false} is VALID [2020-07-28 14:49:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:49:59,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578406734] [2020-07-28 14:49:59,512 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:49:59,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420532478] [2020-07-28 14:49:59,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:49:59,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-28 14:49:59,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805379314] [2020-07-28 14:49:59,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-28 14:49:59,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:59,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 14:49:59,539 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:59,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 14:49:59,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 14:49:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:49:59,541 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2020-07-28 14:49:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:59,767 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-28 14:49:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 14:49:59,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-28 14:49:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:49:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2020-07-28 14:49:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:49:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2020-07-28 14:49:59,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2020-07-28 14:49:59,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:59,834 INFO L225 Difference]: With dead ends: 44 [2020-07-28 14:49:59,835 INFO L226 Difference]: Without dead ends: 37 [2020-07-28 14:49:59,835 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-28 14:49:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-28 14:49:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2020-07-28 14:49:59,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:59,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 24 states. [2020-07-28 14:49:59,858 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 24 states. [2020-07-28 14:49:59,858 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 24 states. [2020-07-28 14:49:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:59,860 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-28 14:49:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-28 14:49:59,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:59,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:59,862 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 37 states. [2020-07-28 14:49:59,862 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 37 states. [2020-07-28 14:49:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:59,864 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-28 14:49:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-28 14:49:59,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:59,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:59,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:59,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 14:49:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2020-07-28 14:49:59,867 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2020-07-28 14:49:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:59,867 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-28 14:49:59,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 14:49:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2020-07-28 14:49:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 14:49:59,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:59,868 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:50:00,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:50:00,083 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:50:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:50:00,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1667884396, now seen corresponding path program 1 times [2020-07-28 14:50:00,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:50:00,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523316542] [2020-07-28 14:50:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:50:00,108 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:50:00,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004630959] [2020-07-28 14:50:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:50:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:50:00,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 14:50:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:50:00,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:50:00,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {736#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {736#true} is VALID [2020-07-28 14:50:00,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {736#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {736#true} is VALID [2020-07-28 14:50:00,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {736#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; {736#true} is VALID [2020-07-28 14:50:00,331 INFO L280 TraceCheckUtils]: 3: Hoare triple {736#true} assume !(0 == assume_abort_if_not_~cond); {736#true} is VALID [2020-07-28 14:50:00,332 INFO L280 TraceCheckUtils]: 4: Hoare triple {736#true} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {753#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:50:00,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {753#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {757#(<= ~N~0 1)} is VALID [2020-07-28 14:50:00,334 INFO L280 TraceCheckUtils]: 6: Hoare triple {757#(<= ~N~0 1)} main_~i~0 := 1; {757#(<= ~N~0 1)} is VALID [2020-07-28 14:50:00,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#(<= ~N~0 1)} assume !(main_~i~0 < ~N~0); {757#(<= ~N~0 1)} is VALID [2020-07-28 14:50:00,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {757#(<= ~N~0 1)} main_~i~0 := 0; {767#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:50:00,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {767#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {767#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:50:00,338 INFO L280 TraceCheckUtils]: 10: Hoare triple {767#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !(0 == __VERIFIER_assert_~cond); {767#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:50:00,339 INFO L280 TraceCheckUtils]: 11: Hoare triple {767#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} havoc main_#t~mem9; {767#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:50:00,340 INFO L280 TraceCheckUtils]: 12: Hoare triple {767#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; {780#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:50:00,342 INFO L280 TraceCheckUtils]: 13: Hoare triple {780#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {737#false} is VALID [2020-07-28 14:50:00,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {737#false} assume 0 == __VERIFIER_assert_~cond; {737#false} is VALID [2020-07-28 14:50:00,343 INFO L280 TraceCheckUtils]: 15: Hoare triple {737#false} assume !false; {737#false} is VALID [2020-07-28 14:50:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:50:00,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523316542] [2020-07-28 14:50:00,344 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:50:00,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004630959] [2020-07-28 14:50:00,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:50:00,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-28 14:50:00,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204848551] [2020-07-28 14:50:00,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-28 14:50:00,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:50:00,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 14:50:00,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:50:00,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 14:50:00,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:50:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 14:50:00,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 14:50:00,365 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2020-07-28 14:50:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:00,585 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2020-07-28 14:50:00,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 14:50:00,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-28 14:50:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:50:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:50:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-28 14:50:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:50:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-28 14:50:00,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-28 14:50:00,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:50:00,647 INFO L225 Difference]: With dead ends: 41 [2020-07-28 14:50:00,647 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 14:50:00,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-28 14:50:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 14:50:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2020-07-28 14:50:00,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:50:00,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 19 states. [2020-07-28 14:50:00,664 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 19 states. [2020-07-28 14:50:00,664 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 19 states. [2020-07-28 14:50:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:00,666 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-28 14:50:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-28 14:50:00,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:50:00,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:50:00,667 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 27 states. [2020-07-28 14:50:00,667 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 27 states. [2020-07-28 14:50:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:00,668 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-28 14:50:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-28 14:50:00,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:50:00,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:50:00,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:50:00,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:50:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 14:50:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-28 14:50:00,670 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2020-07-28 14:50:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:50:00,670 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-28 14:50:00,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 14:50:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-28 14:50:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 14:50:00,671 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:50:00,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:50:00,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:50:00,880 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:50:00,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:50:00,881 INFO L82 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2020-07-28 14:50:00,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:50:00,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693511257] [2020-07-28 14:50:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:50:00,899 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:50:00,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116009077] [2020-07-28 14:50:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:50:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:50:00,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-28 14:50:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:50:00,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:50:00,979 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-28 14:50:00,981 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:50:00,987 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:50:00,993 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-28 14:50:00,994 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 14:50:00,999 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:50:01,000 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:50:01,000 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-28 14:50:01,004 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 14:50:01,004 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, |v_#valid_6|]. (and (= 0 (select (store |v_#valid_6| ULTIMATE.start_main_~a~0.base 1) ULTIMATE.start_main_~b~0.base)) (= |#memory_int| (let ((.cse0 (store |v_#memory_int_10| ULTIMATE.start_main_~a~0.base (store (select |v_#memory_int_10| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset 8)))) (store .cse0 ULTIMATE.start_main_~b~0.base (store (select .cse0 ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset 1))))) [2020-07-28 14:50:01,005 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base))) [2020-07-28 14:50:01,093 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-28 14:50:01,094 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-28 14:50:01,097 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:50:01,132 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-28 14:50:01,140 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:50:01,144 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 14:50:01,144 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-28 14:50:01,161 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 14:50:01,161 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|, ULTIMATE.start_main_~i~0]. (let ((.cse0 (select |v_#memory_int_11| ULTIMATE.start_main_~a~0.base))) (and (= 8 (select .cse0 ULTIMATE.start_main_~a~0.offset)) (= 1 (select (select |v_#memory_int_11| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= |#memory_int| (store |v_#memory_int_11| ULTIMATE.start_main_~a~0.base (let ((.cse1 (* ULTIMATE.start_main_~i~0 8))) (store .cse0 (+ ULTIMATE.start_main_~a~0.offset .cse1) (+ (select .cse0 (+ ULTIMATE.start_main_~a~0.offset .cse1 (- 8))) 4))))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))) [2020-07-28 14:50:01,161 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~i~0]. (let ((.cse2 (* ULTIMATE.start_main_~i~0 8))) (let ((.cse1 (+ ULTIMATE.start_main_~a~0.offset .cse2)) (.cse0 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (+ (select .cse0 .cse1) (- 4)) (select .cse0 (+ ULTIMATE.start_main_~a~0.offset .cse2 (- 8)))) (or (= .cse1 ULTIMATE.start_main_~a~0.offset) (= 8 (select .cse0 ULTIMATE.start_main_~a~0.offset))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base))))) [2020-07-28 14:50:01,165 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:50:01,209 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:50:01,274 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:50:01,325 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:50:01,418 INFO L342 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-28 14:50:01,419 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:50:01,514 INFO L440 ElimStorePlain]: Different costs {12=[|v_#memory_int_12|], 20=[v_prenex_4]} [2020-07-28 14:50:01,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 14:50:01,536 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-28 14:50:01,537 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2020-07-28 14:50:01,539 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:50:01,582 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:50:01,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 14:50:01,625 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-28 14:50:01,626 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2020-07-28 14:50:01,631 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 14:50:01,715 INFO L624 ElimStorePlain]: treesize reduction 45, result has 69.6 percent of original size [2020-07-28 14:50:01,754 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-07-28 14:50:01,754 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:103 [2020-07-28 14:50:01,768 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 14:50:01,769 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_4, v_prenex_2, v_prenex_3, v_prenex_1, |v_#memory_int_12|, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_~a~0.offset]. (let ((.cse4 (+ ULTIMATE.start_main_~b~0.offset 8))) (or (let ((.cse3 (select |v_#memory_int_12| ULTIMATE.start_main_~b~0.base)) (.cse2 (select |v_#memory_int_12| ULTIMATE.start_main_~a~0.base))) (let ((.cse1 (select .cse2 ULTIMATE.start_main_~a~0.offset)) (.cse0 (select .cse3 ULTIMATE.start_main_~b~0.offset))) (and (= 1 .cse0) (= .cse1 (+ (select .cse2 (+ ULTIMATE.start_main_~a~0.offset (- 8))) 4)) (= |#memory_int| (store |v_#memory_int_12| ULTIMATE.start_main_~b~0.base (store .cse3 .cse4 (+ .cse1 .cse0)))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base))))) (let ((.cse8 (select v_prenex_4 v_prenex_2)) (.cse5 (select v_prenex_4 ULTIMATE.start_main_~b~0.base))) (let ((.cse7 (select .cse5 ULTIMATE.start_main_~b~0.offset)) (.cse6 (select .cse8 v_prenex_3))) (and (= |#memory_int| (store v_prenex_4 ULTIMATE.start_main_~b~0.base (store .cse5 .cse4 (+ .cse6 .cse7)))) (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (let ((.cse9 (* v_prenex_1 8))) (= (select .cse8 (+ v_prenex_3 .cse9)) (+ (select .cse8 (+ v_prenex_3 .cse9 (- 8))) 4))) (= 1 .cse7) (= 8 .cse6)))))) [2020-07-28 14:50:01,769 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_2, v_prenex_3, v_prenex_1, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_~a~0.offset]. (let ((.cse7 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse1 (select .cse7 ULTIMATE.start_main_~b~0.offset))) (let ((.cse2 (= 1 .cse1)) (.cse0 (select .cse7 (+ ULTIMATE.start_main_~b~0.offset 8)))) (or (let ((.cse3 (select |#memory_int| v_prenex_2))) (and (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (= .cse0 (+ .cse1 8)) .cse2 (= 8 (select .cse3 v_prenex_3)) (let ((.cse4 (* v_prenex_1 8))) (= (+ (select .cse3 (+ v_prenex_3 .cse4 (- 8))) 4) (select .cse3 (+ v_prenex_3 .cse4)))))) (let ((.cse6 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse5 (+ .cse0 (- 1)))) (and (= .cse5 (+ (select .cse6 (+ ULTIMATE.start_main_~a~0.offset (- 8))) 4)) .cse2 (= (select .cse6 ULTIMATE.start_main_~a~0.offset) .cse5) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))))))) [2020-07-28 14:50:03,419 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-28 14:50:05,180 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-28 14:50:05,263 INFO L342 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-07-28 14:50:05,263 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:50:05,299 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:50:05,330 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:50:05,348 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:50:05,370 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:50:05,399 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:50:05,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {924#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {924#true} is VALID [2020-07-28 14:50:05,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {924#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {924#true} is VALID [2020-07-28 14:50:05,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {924#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; {924#true} is VALID [2020-07-28 14:50:05,570 INFO L280 TraceCheckUtils]: 3: Hoare triple {924#true} assume !(0 == assume_abort_if_not_~cond); {924#true} is VALID [2020-07-28 14:50:05,573 INFO L280 TraceCheckUtils]: 4: Hoare triple {924#true} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {941#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))} is VALID [2020-07-28 14:50:05,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {941#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(4 + main_#t~mem4, main_~a~0.base, main_~a~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem4; {945#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~i~0 Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8))) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 4)) (or (= (* 8 ULTIMATE.start_main_~i~0) 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))} is VALID [2020-07-28 14:50:05,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {945#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~i~0 Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8))) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 4)) (or (= (* 8 ULTIMATE.start_main_~i~0) 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {945#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~i~0 Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8))) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 4)) (or (= (* 8 ULTIMATE.start_main_~i~0) 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))} is VALID [2020-07-28 14:50:05,587 INFO L280 TraceCheckUtils]: 7: Hoare triple {945#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~i~0 Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8))) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 4)) (or (= (* 8 ULTIMATE.start_main_~i~0) 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))} assume !(main_~i~0 < ~N~0); {945#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~i~0 Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8))) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 4)) (or (= (* 8 ULTIMATE.start_main_~i~0) 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))} is VALID [2020-07-28 14:50:05,592 INFO L280 TraceCheckUtils]: 8: Hoare triple {945#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~i~0 Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8))) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 4)) (or (= (* 8 ULTIMATE.start_main_~i~0) 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)))} main_~i~0 := 1; {955#(or (and (exists ((v_prenex_1 Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* v_prenex_1 8))) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* v_prenex_1 8) (- 8))) 4))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (= 1 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 4)) (= 1 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base))))} is VALID [2020-07-28 14:50:05,617 INFO L280 TraceCheckUtils]: 9: Hoare triple {955#(or (and (exists ((v_prenex_1 Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* v_prenex_1 8))) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* v_prenex_1 8) (- 8))) 4))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (= 1 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 4)) (= 1 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base))))} assume !!(main_~i~0 < ~N~0);call main_#t~mem6 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (main_~i~0 - 1), 8);call main_#t~mem7 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(main_#t~mem6 + main_#t~mem7, main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem7;havoc main_#t~mem6; {959#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 8)) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (= 8 (select (select |#memory_int| v_prenex_2) v_prenex_3)) (= (+ (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8) (- 8))) 4) (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8))))))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 5))))))} is VALID [2020-07-28 14:50:05,619 INFO L280 TraceCheckUtils]: 10: Hoare triple {959#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 8)) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (= 8 (select (select |#memory_int| v_prenex_2) v_prenex_3)) (= (+ (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8) (- 8))) 4) (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8))))))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 5))))))} main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; {959#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 8)) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (= 8 (select (select |#memory_int| v_prenex_2) v_prenex_3)) (= (+ (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8) (- 8))) 4) (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8))))))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 5))))))} is VALID [2020-07-28 14:50:05,620 INFO L280 TraceCheckUtils]: 11: Hoare triple {959#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 8)) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (= 8 (select (select |#memory_int| v_prenex_2) v_prenex_3)) (= (+ (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8) (- 8))) 4) (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8))))))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 5))))))} assume !(main_~i~0 < ~N~0); {959#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 8)) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (= 8 (select (select |#memory_int| v_prenex_2) v_prenex_3)) (= (+ (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8) (- 8))) 4) (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8))))))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 5))))))} is VALID [2020-07-28 14:50:05,622 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 8)) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (= 8 (select (select |#memory_int| v_prenex_2) v_prenex_3)) (= (+ (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8) (- 8))) 4) (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8))))))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 5))))))} main_~i~0 := 0; {969#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 8)) (= 0 ULTIMATE.start_main_~i~0) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (= 8 (select (select |#memory_int| v_prenex_2) v_prenex_3)) (= (+ (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8) (- 8))) 4) (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8))))))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= 0 ULTIMATE.start_main_~i~0) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 5))))))} is VALID [2020-07-28 14:50:05,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {969#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 8)) (= 0 ULTIMATE.start_main_~i~0) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_main_~b~0.base v_prenex_2)) (= 8 (select (select |#memory_int| v_prenex_2) v_prenex_3)) (= (+ (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8) (- 8))) 4) (select (select |#memory_int| v_prenex_2) (+ v_prenex_3 (* v_prenex_1 8))))))) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= 0 ULTIMATE.start_main_~i~0) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8))) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 8))) 5))))))} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {973#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 14:50:05,630 INFO L280 TraceCheckUtils]: 14: Hoare triple {973#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {925#false} is VALID [2020-07-28 14:50:05,631 INFO L280 TraceCheckUtils]: 15: Hoare triple {925#false} assume !false; {925#false} is VALID [2020-07-28 14:50:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:50:05,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693511257] [2020-07-28 14:50:05,635 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:50:05,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116009077] [2020-07-28 14:50:05,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:50:05,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-28 14:50:05,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436819540] [2020-07-28 14:50:05,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-28 14:50:05,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:50:05,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 14:50:07,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-28 14:50:07,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 14:50:07,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:50:07,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 14:50:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-28 14:50:07,769 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2020-07-28 14:50:20,941 WARN L193 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2020-07-28 14:50:25,521 WARN L193 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2020-07-28 14:50:30,001 WARN L193 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2020-07-28 14:50:36,587 WARN L193 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2020-07-28 14:50:42,166 WARN L193 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2020-07-28 14:50:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:45,296 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-28 14:50:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 14:50:45,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-28 14:50:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:50:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:50:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-28 14:50:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:50:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-28 14:50:45,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2020-07-28 14:50:50,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 46 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-28 14:50:50,676 INFO L225 Difference]: With dead ends: 44 [2020-07-28 14:50:50,676 INFO L226 Difference]: Without dead ends: 42 [2020-07-28 14:50:50,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=46, Invalid=109, Unknown=1, NotChecked=0, Total=156 [2020-07-28 14:50:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-28 14:50:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2020-07-28 14:50:50,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:50:50,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 28 states. [2020-07-28 14:50:50,707 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 28 states. [2020-07-28 14:50:50,708 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 28 states. [2020-07-28 14:50:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:50,710 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-28 14:50:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-28 14:50:50,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:50:50,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:50:50,711 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 42 states. [2020-07-28 14:50:50,711 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 42 states. [2020-07-28 14:50:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:50,713 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-28 14:50:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-28 14:50:50,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:50:50,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:50:50,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:50:50,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:50:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 14:50:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-28 14:50:50,715 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-28 14:50:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:50:50,716 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-28 14:50:50,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 14:50:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-28 14:50:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 14:50:50,717 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:50:50,717 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:50:50,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-28 14:50:50,919 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:50:50,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:50:50,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1267903976, now seen corresponding path program 2 times [2020-07-28 14:50:50,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:50:50,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893529940] [2020-07-28 14:50:50,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:50:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:50:51,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {1165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1165#true} is VALID [2020-07-28 14:50:51,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {1165#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {1165#true} is VALID [2020-07-28 14:50:51,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {1165#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; {1165#true} is VALID [2020-07-28 14:50:51,067 INFO L280 TraceCheckUtils]: 3: Hoare triple {1165#true} assume !(0 == assume_abort_if_not_~cond); {1165#true} is VALID [2020-07-28 14:50:51,068 INFO L280 TraceCheckUtils]: 4: Hoare triple {1165#true} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1167#(= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:50:51,069 INFO L280 TraceCheckUtils]: 5: Hoare triple {1167#(= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(4 + main_#t~mem4, main_~a~0.base, main_~a~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem4; {1167#(= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:50:51,070 INFO L280 TraceCheckUtils]: 6: Hoare triple {1167#(= 1 ULTIMATE.start_main_~i~0)} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {1168#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 14:50:51,072 INFO L280 TraceCheckUtils]: 7: Hoare triple {1168#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < ~N~0); {1169#(<= ~N~0 2)} is VALID [2020-07-28 14:50:51,073 INFO L280 TraceCheckUtils]: 8: Hoare triple {1169#(<= ~N~0 2)} main_~i~0 := 1; {1170#(and (<= ~N~0 2) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:50:51,074 INFO L280 TraceCheckUtils]: 9: Hoare triple {1170#(and (<= ~N~0 2) (= 1 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem6 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (main_~i~0 - 1), 8);call main_#t~mem7 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(main_#t~mem6 + main_#t~mem7, main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem7;havoc main_#t~mem6; {1170#(and (<= ~N~0 2) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:50:51,075 INFO L280 TraceCheckUtils]: 10: Hoare triple {1170#(and (<= ~N~0 2) (= 1 ULTIMATE.start_main_~i~0))} main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; {1171#(<= ~N~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:50:51,077 INFO L280 TraceCheckUtils]: 11: Hoare triple {1171#(<= ~N~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem6 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (main_~i~0 - 1), 8);call main_#t~mem7 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(main_#t~mem6 + main_#t~mem7, main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem7;havoc main_#t~mem6; {1166#false} is VALID [2020-07-28 14:50:51,077 INFO L280 TraceCheckUtils]: 12: Hoare triple {1166#false} main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; {1166#false} is VALID [2020-07-28 14:50:51,077 INFO L280 TraceCheckUtils]: 13: Hoare triple {1166#false} assume !(main_~i~0 < ~N~0); {1166#false} is VALID [2020-07-28 14:50:51,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {1166#false} main_~i~0 := 0; {1166#false} is VALID [2020-07-28 14:50:51,078 INFO L280 TraceCheckUtils]: 15: Hoare triple {1166#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1166#false} is VALID [2020-07-28 14:50:51,078 INFO L280 TraceCheckUtils]: 16: Hoare triple {1166#false} assume 0 == __VERIFIER_assert_~cond; {1166#false} is VALID [2020-07-28 14:50:51,078 INFO L280 TraceCheckUtils]: 17: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2020-07-28 14:50:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:50:51,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893529940] [2020-07-28 14:50:51,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132686311] [2020-07-28 14:50:51,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:50:51,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 14:50:51,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:50:51,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 14:50:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:50:51,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:50:51,304 INFO L280 TraceCheckUtils]: 0: Hoare triple {1165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1165#true} is VALID [2020-07-28 14:50:51,305 INFO L280 TraceCheckUtils]: 1: Hoare triple {1165#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {1165#true} is VALID [2020-07-28 14:50:51,305 INFO L280 TraceCheckUtils]: 2: Hoare triple {1165#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; {1165#true} is VALID [2020-07-28 14:50:51,305 INFO L280 TraceCheckUtils]: 3: Hoare triple {1165#true} assume !(0 == assume_abort_if_not_~cond); {1165#true} is VALID [2020-07-28 14:50:51,306 INFO L280 TraceCheckUtils]: 4: Hoare triple {1165#true} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1187#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:50:51,308 INFO L280 TraceCheckUtils]: 5: Hoare triple {1187#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(4 + main_#t~mem4, main_~a~0.base, main_~a~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem4; {1187#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:50:51,315 INFO L280 TraceCheckUtils]: 6: Hoare triple {1187#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {1168#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 14:50:51,316 INFO L280 TraceCheckUtils]: 7: Hoare triple {1168#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < ~N~0); {1169#(<= ~N~0 2)} is VALID [2020-07-28 14:50:51,317 INFO L280 TraceCheckUtils]: 8: Hoare triple {1169#(<= ~N~0 2)} main_~i~0 := 1; {1200#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:50:51,318 INFO L280 TraceCheckUtils]: 9: Hoare triple {1200#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem6 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (main_~i~0 - 1), 8);call main_#t~mem7 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(main_#t~mem6 + main_#t~mem7, main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem7;havoc main_#t~mem6; {1200#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:50:51,323 INFO L280 TraceCheckUtils]: 10: Hoare triple {1200#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_main_~i~0))} main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; {1207#(and (<= ~N~0 2) (<= 2 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:50:51,324 INFO L280 TraceCheckUtils]: 11: Hoare triple {1207#(and (<= ~N~0 2) (<= 2 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem6 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (main_~i~0 - 1), 8);call main_#t~mem7 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(main_#t~mem6 + main_#t~mem7, main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem7;havoc main_#t~mem6; {1166#false} is VALID [2020-07-28 14:50:51,324 INFO L280 TraceCheckUtils]: 12: Hoare triple {1166#false} main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; {1166#false} is VALID [2020-07-28 14:50:51,325 INFO L280 TraceCheckUtils]: 13: Hoare triple {1166#false} assume !(main_~i~0 < ~N~0); {1166#false} is VALID [2020-07-28 14:50:51,325 INFO L280 TraceCheckUtils]: 14: Hoare triple {1166#false} main_~i~0 := 0; {1166#false} is VALID [2020-07-28 14:50:51,325 INFO L280 TraceCheckUtils]: 15: Hoare triple {1166#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1166#false} is VALID [2020-07-28 14:50:51,325 INFO L280 TraceCheckUtils]: 16: Hoare triple {1166#false} assume 0 == __VERIFIER_assert_~cond; {1166#false} is VALID [2020-07-28 14:50:51,325 INFO L280 TraceCheckUtils]: 17: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2020-07-28 14:50:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:50:51,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:50:51,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 14:50:51,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153782859] [2020-07-28 14:50:51,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-28 14:50:51,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:50:51,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 14:50:51,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:50:51,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 14:50:51,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:50:51,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 14:50:51,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-28 14:50:51,396 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 10 states. [2020-07-28 14:50:52,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:52,377 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2020-07-28 14:50:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 14:50:52,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-28 14:50:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:50:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:50:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2020-07-28 14:50:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:50:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2020-07-28 14:50:52,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2020-07-28 14:50:52,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:50:52,595 INFO L225 Difference]: With dead ends: 61 [2020-07-28 14:50:52,595 INFO L226 Difference]: Without dead ends: 52 [2020-07-28 14:50:52,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-28 14:50:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-28 14:50:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2020-07-28 14:50:52,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:50:52,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 28 states. [2020-07-28 14:50:52,641 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 28 states. [2020-07-28 14:50:52,641 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 28 states. [2020-07-28 14:50:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:52,642 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-28 14:50:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-28 14:50:52,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:50:52,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:50:52,643 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 52 states. [2020-07-28 14:50:52,644 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 52 states. [2020-07-28 14:50:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:52,645 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-28 14:50:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-28 14:50:52,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:50:52,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:50:52,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:50:52,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:50:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 14:50:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-28 14:50:52,648 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2020-07-28 14:50:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:50:52,648 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-28 14:50:52,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 14:50:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-28 14:50:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 14:50:52,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:50:52,649 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:50:52,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:50:52,860 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:50:52,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:50:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1174519208, now seen corresponding path program 3 times [2020-07-28 14:50:52,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:50:52,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095115638] [2020-07-28 14:50:52,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:50:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:50:52,957 INFO L280 TraceCheckUtils]: 0: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1454#true} is VALID [2020-07-28 14:50:52,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {1454#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {1454#true} is VALID [2020-07-28 14:50:52,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {1454#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; {1454#true} is VALID [2020-07-28 14:50:52,958 INFO L280 TraceCheckUtils]: 3: Hoare triple {1454#true} assume !(0 == assume_abort_if_not_~cond); {1454#true} is VALID [2020-07-28 14:50:52,960 INFO L280 TraceCheckUtils]: 4: Hoare triple {1454#true} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1456#(= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:50:52,960 INFO L280 TraceCheckUtils]: 5: Hoare triple {1456#(= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(4 + main_#t~mem4, main_~a~0.base, main_~a~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem4; {1456#(= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:50:52,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {1456#(= 1 ULTIMATE.start_main_~i~0)} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {1457#(<= 2 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:50:52,962 INFO L280 TraceCheckUtils]: 7: Hoare triple {1457#(<= 2 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(4 + main_#t~mem4, main_~a~0.base, main_~a~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem4; {1458#(<= 3 ~N~0)} is VALID [2020-07-28 14:50:52,967 INFO L280 TraceCheckUtils]: 8: Hoare triple {1458#(<= 3 ~N~0)} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {1458#(<= 3 ~N~0)} is VALID [2020-07-28 14:50:52,967 INFO L280 TraceCheckUtils]: 9: Hoare triple {1458#(<= 3 ~N~0)} assume !(main_~i~0 < ~N~0); {1458#(<= 3 ~N~0)} is VALID [2020-07-28 14:50:52,968 INFO L280 TraceCheckUtils]: 10: Hoare triple {1458#(<= 3 ~N~0)} main_~i~0 := 1; {1459#(and (<= 3 ~N~0) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:50:52,969 INFO L280 TraceCheckUtils]: 11: Hoare triple {1459#(and (<= 3 ~N~0) (= 1 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem6 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (main_~i~0 - 1), 8);call main_#t~mem7 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(main_#t~mem6 + main_#t~mem7, main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem7;havoc main_#t~mem6; {1459#(and (<= 3 ~N~0) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:50:52,969 INFO L280 TraceCheckUtils]: 12: Hoare triple {1459#(and (<= 3 ~N~0) (= 1 ULTIMATE.start_main_~i~0))} main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; {1460#(<= (+ ULTIMATE.start_main_~i~0 1) ~N~0)} is VALID [2020-07-28 14:50:52,970 INFO L280 TraceCheckUtils]: 13: Hoare triple {1460#(<= (+ ULTIMATE.start_main_~i~0 1) ~N~0)} assume !(main_~i~0 < ~N~0); {1455#false} is VALID [2020-07-28 14:50:52,970 INFO L280 TraceCheckUtils]: 14: Hoare triple {1455#false} main_~i~0 := 0; {1455#false} is VALID [2020-07-28 14:50:52,971 INFO L280 TraceCheckUtils]: 15: Hoare triple {1455#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1455#false} is VALID [2020-07-28 14:50:52,971 INFO L280 TraceCheckUtils]: 16: Hoare triple {1455#false} assume 0 == __VERIFIER_assert_~cond; {1455#false} is VALID [2020-07-28 14:50:52,971 INFO L280 TraceCheckUtils]: 17: Hoare triple {1455#false} assume !false; {1455#false} is VALID [2020-07-28 14:50:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:50:52,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095115638] [2020-07-28 14:50:52,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218345032] [2020-07-28 14:50:52,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:50:53,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-28 14:50:53,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:50:53,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 14:50:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:50:53,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:50:53,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1454#true} is VALID [2020-07-28 14:50:53,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {1454#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem9, main_#t~post8, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {1454#true} is VALID [2020-07-28 14:50:53,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {1454#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; {1454#true} is VALID [2020-07-28 14:50:53,189 INFO L280 TraceCheckUtils]: 3: Hoare triple {1454#true} assume !(0 == assume_abort_if_not_~cond); {1454#true} is VALID [2020-07-28 14:50:53,190 INFO L280 TraceCheckUtils]: 4: Hoare triple {1454#true} havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1476#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:50:53,191 INFO L280 TraceCheckUtils]: 5: Hoare triple {1476#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(4 + main_#t~mem4, main_~a~0.base, main_~a~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem4; {1476#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:50:53,196 INFO L280 TraceCheckUtils]: 6: Hoare triple {1476#(<= 1 ULTIMATE.start_main_~i~0)} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {1457#(<= 2 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:50:53,197 INFO L280 TraceCheckUtils]: 7: Hoare triple {1457#(<= 2 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(4 + main_#t~mem4, main_~a~0.base, main_~a~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem4; {1458#(<= 3 ~N~0)} is VALID [2020-07-28 14:50:53,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {1458#(<= 3 ~N~0)} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {1458#(<= 3 ~N~0)} is VALID [2020-07-28 14:50:53,198 INFO L280 TraceCheckUtils]: 9: Hoare triple {1458#(<= 3 ~N~0)} assume !(main_~i~0 < ~N~0); {1458#(<= 3 ~N~0)} is VALID [2020-07-28 14:50:53,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {1458#(<= 3 ~N~0)} main_~i~0 := 1; {1495#(and (<= 3 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 14:50:53,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {1495#(and (<= 3 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem6 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (main_~i~0 - 1), 8);call main_#t~mem7 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (main_~i~0 - 1), 8);call write~int(main_#t~mem6 + main_#t~mem7, main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);havoc main_#t~mem7;havoc main_#t~mem6; {1495#(and (<= 3 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 14:50:53,205 INFO L280 TraceCheckUtils]: 12: Hoare triple {1495#(and (<= 3 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; {1502#(and (<= 3 ~N~0) (<= ULTIMATE.start_main_~i~0 2))} is VALID [2020-07-28 14:50:53,206 INFO L280 TraceCheckUtils]: 13: Hoare triple {1502#(and (<= 3 ~N~0) (<= ULTIMATE.start_main_~i~0 2))} assume !(main_~i~0 < ~N~0); {1455#false} is VALID [2020-07-28 14:50:53,206 INFO L280 TraceCheckUtils]: 14: Hoare triple {1455#false} main_~i~0 := 0; {1455#false} is VALID [2020-07-28 14:50:53,207 INFO L280 TraceCheckUtils]: 15: Hoare triple {1455#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset + 8 * main_~i~0, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 1 + (2 * main_~i~0 * main_~i~0 + 2 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1455#false} is VALID [2020-07-28 14:50:53,207 INFO L280 TraceCheckUtils]: 16: Hoare triple {1455#false} assume 0 == __VERIFIER_assert_~cond; {1455#false} is VALID [2020-07-28 14:50:53,207 INFO L280 TraceCheckUtils]: 17: Hoare triple {1455#false} assume !false; {1455#false} is VALID [2020-07-28 14:50:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:50:53,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:50:53,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 14:50:53,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740770486] [2020-07-28 14:50:53,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-28 14:50:53,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:50:53,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 14:50:53,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:50:53,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 14:50:53,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:50:53,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 14:50:53,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-28 14:50:53,267 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2020-07-28 14:50:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:54,398 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2020-07-28 14:50:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-28 14:50:54,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-28 14:50:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:50:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:50:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2020-07-28 14:50:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:50:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2020-07-28 14:50:54,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2020-07-28 14:50:54,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:50:54,570 INFO L225 Difference]: With dead ends: 56 [2020-07-28 14:50:54,570 INFO L226 Difference]: Without dead ends: 49 [2020-07-28 14:50:54,571 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-07-28 14:50:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-28 14:50:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2020-07-28 14:50:54,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:50:54,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 30 states. [2020-07-28 14:50:54,619 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 30 states. [2020-07-28 14:50:54,619 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 30 states. [2020-07-28 14:50:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:54,622 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-28 14:50:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-28 14:50:54,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:50:54,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:50:54,623 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 49 states. [2020-07-28 14:50:54,623 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 49 states. [2020-07-28 14:50:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:50:54,625 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-28 14:50:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-28 14:50:54,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:50:54,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:50:54,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:50:54,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:50:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 14:50:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-28 14:50:54,627 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2020-07-28 14:50:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:50:54,628 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-28 14:50:54,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 14:50:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-28 14:50:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 14:50:54,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:50:54,629 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:50:54,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:50:54,838 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:50:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:50:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 798963152, now seen corresponding path program 1 times [2020-07-28 14:50:54,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:50:54,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107171300] [2020-07-28 14:50:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:50:54,853 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:50:54,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33620491] [2020-07-28 14:50:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:50:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:50:54,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:50:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:50:54,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:50:54,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:50:54,939 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:50:55,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-28 14:50:55,213 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:50:55,213 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:50:55,213 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:50:55,214 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:50:55,214 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-28 14:50:55,214 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:50:55,214 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:50:55,214 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:50:55,215 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 14:50:55,215 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-28 14:50:55,215 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-28 14:50:55,215 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-28 14:50:55,215 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-28 14:50:55,216 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-28 14:50:55,216 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-28 14:50:55,216 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-28 14:50:55,216 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-28 14:50:55,216 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-28 14:50:55,217 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-28 14:50:55,217 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-28 14:50:55,217 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-28 14:50:55,217 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-28 14:50:55,217 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-28 14:50:55,218 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:50:55,218 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:50:55,218 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:50:55,218 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:50:55,218 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 14:50:55,219 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-28 14:50:55,219 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:50:55,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:50:55 BoogieIcfgContainer [2020-07-28 14:50:55,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:50:55,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:50:55,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:50:55,224 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:50:55,225 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:56" (3/4) ... [2020-07-28 14:50:55,228 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:50:55,306 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:50:55,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:50:55,310 INFO L168 Benchmark]: Toolchain (without parser) took 59393.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 954.9 MB in the beginning and 825.0 MB in the end (delta: 129.8 MB). Peak memory consumption was 404.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:50:55,311 INFO L168 Benchmark]: CDTParser took 0.31 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:50:55,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.24 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.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:50:55,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:50:55,312 INFO L168 Benchmark]: Boogie Preprocessor took 30.55 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:50:55,313 INFO L168 Benchmark]: RCFGBuilder took 472.99 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:50:55,313 INFO L168 Benchmark]: TraceAbstraction took 58423.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 1.1 GB in the beginning and 833.7 MB in the end (delta: 273.7 MB). Peak memory consumption was 405.3 MB. Max. memory is 11.5 GB. [2020-07-28 14:50:55,316 INFO L168 Benchmark]: Witness Printer took 82.41 ms. Allocated memory is still 1.3 GB. Free memory was 833.7 MB in the beginning and 825.0 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:50:55,322 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.31 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 272.24 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.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 102.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.55 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 472.99 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58423.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 1.1 GB in the beginning and 833.7 MB in the end (delta: 273.7 MB). Peak memory consumption was 405.3 MB. Max. memory is 11.5 GB. * Witness Printer took 82.41 ms. Allocated memory is still 1.3 GB. Free memory was 833.7 MB in the beginning and 825.0 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.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=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 8 [L30] b[0] = 1 [L32] i=1 VAL [N=2] [L32] COND TRUE i