/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/brs2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:25:53,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:25:53,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:25:53,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:25:53,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:25:53,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:25:53,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:25:53,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:25:53,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:25:53,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:25:53,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:25:53,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:25:53,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:25:53,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:25:53,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:25:53,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:25:53,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:25:53,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:25:53,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:25:53,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:25:53,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:25:53,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:25:53,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:25:53,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:25:53,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:25:53,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:25:53,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:25:53,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:25:53,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:25:53,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:25:53,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:25:53,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:25:53,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:25:53,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:25:53,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:25:53,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:25:53,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:25:53,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:25:53,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:25:53,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:25:53,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:25:53,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:25:53,272 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:25:53,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:25:53,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:25:53,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:25:53,275 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:25:53,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:25:53,276 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:25:53,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:25:53,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:25:53,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:25:53,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:25:53,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:25:53,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:25:53,277 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:25:53,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:25:53,279 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:25:53,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:25:53,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:25:53,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:25:53,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:25:53,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:25:53,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:53,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:25:53,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:25:53,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:25:53,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:25:53,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:25:53,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:25:53,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:25:53,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:25:53,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:25:53,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:25:53,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:25:53,601 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:25:53,601 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:25:53,602 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs2f.c [2020-07-10 15:25:53,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0833fb353/987271462d7f42c89de6ddfd0309fbe6/FLAG2572cd586 [2020-07-10 15:25:54,126 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:25:54,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2f.c [2020-07-10 15:25:54,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0833fb353/987271462d7f42c89de6ddfd0309fbe6/FLAG2572cd586 [2020-07-10 15:25:54,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0833fb353/987271462d7f42c89de6ddfd0309fbe6 [2020-07-10 15:25:54,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:25:54,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:25:54,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:54,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:25:54,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:25:54,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b42804f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54, skipping insertion in model container [2020-07-10 15:25:54,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:25:54,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:25:54,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:54,744 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:25:54,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:54,786 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:25:54,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54 WrapperNode [2020-07-10 15:25:54,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:54,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:25:54,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:25:54,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:25:54,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:25:54,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:25:54,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:25:54,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:25:54,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (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-10 15:25:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:25:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:25:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:25:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:25:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:25:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:25:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:25:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:25:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:25:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:25:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:25:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:25:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:25:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:25:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:25:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:25:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:25:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:25:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:25:55,485 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:25:55,486 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:25:55,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:55 BoogieIcfgContainer [2020-07-10 15:25:55,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:25:55,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:25:55,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:25:55,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:25:55,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:25:54" (1/3) ... [2020-07-10 15:25:55,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f27a74d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:55, skipping insertion in model container [2020-07-10 15:25:55,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (2/3) ... [2020-07-10 15:25:55,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f27a74d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:55, skipping insertion in model container [2020-07-10 15:25:55,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:55" (3/3) ... [2020-07-10 15:25:55,502 INFO L109 eAbstractionObserver]: Analyzing ICFG brs2f.c [2020-07-10 15:25:55,512 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:25:55,520 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:25:55,531 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:25:55,552 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:25:55,552 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:25:55,553 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:25:55,553 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:25:55,553 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:25:55,553 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:25:55,553 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:25:55,554 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:25:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-10 15:25:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:25:55,579 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:55,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:55,581 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:55,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1824292310, now seen corresponding path program 1 times [2020-07-10 15:25:55,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:55,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488489768] [2020-07-10 15:25:55,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {36#true} is VALID [2020-07-10 15:25:55,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:55,897 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #77#return; {36#true} is VALID [2020-07-10 15:25:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2020-07-10 15:25:55,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2020-07-10 15:25:55,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2020-07-10 15:25:55,931 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #73#return; {37#false} is VALID [2020-07-10 15:25:55,934 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:55,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {36#true} is VALID [2020-07-10 15:25:55,935 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:55,935 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #77#return; {36#true} is VALID [2020-07-10 15:25:55,936 INFO L263 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret7 := main(); {36#true} is VALID [2020-07-10 15:25:55,936 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {36#true} is VALID [2020-07-10 15:25:55,937 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} assume !(~N~0 <= 0); {36#true} is VALID [2020-07-10 15:25:55,937 INFO L263 TraceCheckUtils]: 7: Hoare triple {36#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {36#true} is VALID [2020-07-10 15:25:55,937 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2020-07-10 15:25:55,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2020-07-10 15:25:55,939 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#false} assume true; {37#false} is VALID [2020-07-10 15:25:55,940 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {37#false} {36#true} #73#return; {37#false} is VALID [2020-07-10 15:25:55,942 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {37#false} is VALID [2020-07-10 15:25:55,942 INFO L280 TraceCheckUtils]: 13: Hoare triple {37#false} assume !(~i~0 < ~N~0); {37#false} is VALID [2020-07-10 15:25:55,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2020-07-10 15:25:55,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {37#false} assume !true; {37#false} is VALID [2020-07-10 15:25:55,945 INFO L280 TraceCheckUtils]: 16: Hoare triple {37#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {37#false} is VALID [2020-07-10 15:25:55,945 INFO L263 TraceCheckUtils]: 17: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {37#false} is VALID [2020-07-10 15:25:55,946 INFO L280 TraceCheckUtils]: 18: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2020-07-10 15:25:55,946 INFO L280 TraceCheckUtils]: 19: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2020-07-10 15:25:55,947 INFO L280 TraceCheckUtils]: 20: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-10 15:25:55,952 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-10 15:25:55,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488489768] [2020-07-10 15:25:55,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:55,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:25:55,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764873466] [2020-07-10 15:25:55,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:25:55,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:55,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:56,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:56,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:56,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:25:56,087 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-07-10 15:25:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,340 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2020-07-10 15:25:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:56,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:25:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-10 15:25:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-10 15:25:56,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2020-07-10 15:25:56,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,496 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:25:56,497 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 15:25:56,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:25:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 15:25:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-10 15:25:56,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:56,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:56,591 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:56,591 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,602 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:25:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:25:56,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,611 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:56,612 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,619 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:25:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:25:56,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:56,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 15:25:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-07-10 15:25:56,628 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2020-07-10 15:25:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:56,629 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-07-10 15:25:56,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:25:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:25:56,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:56,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:56,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:25:56,641 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1767537087, now seen corresponding path program 1 times [2020-07-10 15:25:56,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:56,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295604522] [2020-07-10 15:25:56,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {217#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {206#true} is VALID [2020-07-10 15:25:56,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:25:56,807 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #77#return; {206#true} is VALID [2020-07-10 15:25:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2020-07-10 15:25:56,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2020-07-10 15:25:56,817 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:25:56,818 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {206#true} {211#(<= 1 ~N~0)} #73#return; {211#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:56,820 INFO L263 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {217#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:56,820 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {206#true} is VALID [2020-07-10 15:25:56,821 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:25:56,821 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #77#return; {206#true} is VALID [2020-07-10 15:25:56,821 INFO L263 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret7 := main(); {206#true} is VALID [2020-07-10 15:25:56,822 INFO L280 TraceCheckUtils]: 5: Hoare triple {206#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {206#true} is VALID [2020-07-10 15:25:56,823 INFO L280 TraceCheckUtils]: 6: Hoare triple {206#true} assume !(~N~0 <= 0); {211#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:56,823 INFO L263 TraceCheckUtils]: 7: Hoare triple {211#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {206#true} is VALID [2020-07-10 15:25:56,824 INFO L280 TraceCheckUtils]: 8: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2020-07-10 15:25:56,824 INFO L280 TraceCheckUtils]: 9: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2020-07-10 15:25:56,824 INFO L280 TraceCheckUtils]: 10: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:25:56,826 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {206#true} {211#(<= 1 ~N~0)} #73#return; {211#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:56,827 INFO L280 TraceCheckUtils]: 12: Hoare triple {211#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {216#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:25:56,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {216#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {207#false} is VALID [2020-07-10 15:25:56,829 INFO L280 TraceCheckUtils]: 14: Hoare triple {207#false} ~i~0 := 0; {207#false} is VALID [2020-07-10 15:25:56,829 INFO L280 TraceCheckUtils]: 15: Hoare triple {207#false} assume !(~i~0 < ~N~0); {207#false} is VALID [2020-07-10 15:25:56,830 INFO L280 TraceCheckUtils]: 16: Hoare triple {207#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {207#false} is VALID [2020-07-10 15:25:56,830 INFO L263 TraceCheckUtils]: 17: Hoare triple {207#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {207#false} is VALID [2020-07-10 15:25:56,830 INFO L280 TraceCheckUtils]: 18: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2020-07-10 15:25:56,831 INFO L280 TraceCheckUtils]: 19: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2020-07-10 15:25:56,831 INFO L280 TraceCheckUtils]: 20: Hoare triple {207#false} assume !false; {207#false} is VALID [2020-07-10 15:25:56,832 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-10 15:25:56,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295604522] [2020-07-10 15:25:56,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:56,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:25:56,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774372926] [2020-07-10 15:25:56,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:25:56,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:56,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:25:56,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:25:56,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:56,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:25:56,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:25:56,871 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2020-07-10 15:25:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,148 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-07-10 15:25:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:25:57,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:25:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:25:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:25:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:25:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:25:57,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-10 15:25:57,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,247 INFO L225 Difference]: With dead ends: 45 [2020-07-10 15:25:57,248 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:25:57,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:25:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:25:57,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-10 15:25:57,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:57,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-10 15:25:57,288 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-10 15:25:57,288 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-10 15:25:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,291 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-10 15:25:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:25:57,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,293 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-10 15:25:57,293 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-10 15:25:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,296 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-10 15:25:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:25:57,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:57,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:25:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:25:57,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2020-07-10 15:25:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:57,301 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:25:57,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:25:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:25:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:25:57,302 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:57,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:57,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:25:57,303 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:57,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash -395878216, now seen corresponding path program 1 times [2020-07-10 15:25:57,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:57,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247845646] [2020-07-10 15:25:57,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {404#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {390#true} is VALID [2020-07-10 15:25:57,541 INFO L280 TraceCheckUtils]: 1: Hoare triple {390#true} assume true; {390#true} is VALID [2020-07-10 15:25:57,541 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} #77#return; {390#true} is VALID [2020-07-10 15:25:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,555 INFO L280 TraceCheckUtils]: 0: Hoare triple {390#true} ~cond := #in~cond; {390#true} is VALID [2020-07-10 15:25:57,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {390#true} assume !(0 == ~cond); {390#true} is VALID [2020-07-10 15:25:57,556 INFO L280 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2020-07-10 15:25:57,558 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {390#true} {395#(<= 1 ~N~0)} #73#return; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,560 INFO L263 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {404#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:57,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {404#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {390#true} is VALID [2020-07-10 15:25:57,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2020-07-10 15:25:57,561 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #77#return; {390#true} is VALID [2020-07-10 15:25:57,562 INFO L263 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret7 := main(); {390#true} is VALID [2020-07-10 15:25:57,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {390#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {390#true} is VALID [2020-07-10 15:25:57,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {390#true} assume !(~N~0 <= 0); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,563 INFO L263 TraceCheckUtils]: 7: Hoare triple {395#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {390#true} is VALID [2020-07-10 15:25:57,564 INFO L280 TraceCheckUtils]: 8: Hoare triple {390#true} ~cond := #in~cond; {390#true} is VALID [2020-07-10 15:25:57,564 INFO L280 TraceCheckUtils]: 9: Hoare triple {390#true} assume !(0 == ~cond); {390#true} is VALID [2020-07-10 15:25:57,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {390#true} assume true; {390#true} is VALID [2020-07-10 15:25:57,566 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {390#true} {395#(<= 1 ~N~0)} #73#return; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {395#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,570 INFO L280 TraceCheckUtils]: 13: Hoare triple {395#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,571 INFO L280 TraceCheckUtils]: 14: Hoare triple {395#(<= 1 ~N~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,573 INFO L280 TraceCheckUtils]: 15: Hoare triple {395#(<= 1 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,575 INFO L280 TraceCheckUtils]: 16: Hoare triple {395#(<= 1 ~N~0)} assume !(~i~0 < ~N~0); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,577 INFO L280 TraceCheckUtils]: 17: Hoare triple {395#(<= 1 ~N~0)} ~i~0 := 0; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,580 INFO L280 TraceCheckUtils]: 18: Hoare triple {395#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:57,582 INFO L280 TraceCheckUtils]: 19: Hoare triple {395#(<= 1 ~N~0)} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:25:57,584 INFO L280 TraceCheckUtils]: 20: Hoare triple {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:25:57,586 INFO L280 TraceCheckUtils]: 21: Hoare triple {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(~i~0 < ~N~0); {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:25:57,587 INFO L280 TraceCheckUtils]: 22: Hoare triple {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {401#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} is VALID [2020-07-10 15:25:57,589 INFO L263 TraceCheckUtils]: 23: Hoare triple {401#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {402#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:25:57,590 INFO L280 TraceCheckUtils]: 24: Hoare triple {402#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {403#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:25:57,591 INFO L280 TraceCheckUtils]: 25: Hoare triple {403#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {391#false} is VALID [2020-07-10 15:25:57,592 INFO L280 TraceCheckUtils]: 26: Hoare triple {391#false} assume !false; {391#false} is VALID [2020-07-10 15:25:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:57,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247845646] [2020-07-10 15:25:57,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:57,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:25:57,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191165739] [2020-07-10 15:25:57,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 15:25:57,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:57,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:25:57,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:25:57,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:57,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:25:57,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:57,652 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2020-07-10 15:25:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,215 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-10 15:25:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:25:58,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 15:25:58,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:25:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-10 15:25:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:25:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-10 15:25:58,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2020-07-10 15:25:58,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,275 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:25:58,275 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 15:25:58,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:25:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 15:25:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-10 15:25:58,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:58,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-10 15:25:58,310 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-10 15:25:58,310 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-10 15:25:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,313 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:25:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:25:58,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,314 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-10 15:25:58,314 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-10 15:25:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,317 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:25:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:25:58,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:58,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:25:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-10 15:25:58,321 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 27 [2020-07-10 15:25:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:58,322 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-10 15:25:58,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:25:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:25:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:25:58,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:58,324 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:58,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:25:58,324 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:58,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1239476407, now seen corresponding path program 1 times [2020-07-10 15:25:58,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:58,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908509432] [2020-07-10 15:25:58,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {581#true} is VALID [2020-07-10 15:25:58,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:58,446 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {581#true} {581#true} #77#return; {581#true} is VALID [2020-07-10 15:25:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {581#true} ~cond := #in~cond; {581#true} is VALID [2020-07-10 15:25:58,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {581#true} assume !(0 == ~cond); {581#true} is VALID [2020-07-10 15:25:58,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:58,453 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #73#return; {581#true} is VALID [2020-07-10 15:25:58,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {581#true} call ULTIMATE.init(); {595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:58,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {581#true} is VALID [2020-07-10 15:25:58,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:58,455 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #77#return; {581#true} is VALID [2020-07-10 15:25:58,455 INFO L263 TraceCheckUtils]: 4: Hoare triple {581#true} call #t~ret7 := main(); {581#true} is VALID [2020-07-10 15:25:58,456 INFO L280 TraceCheckUtils]: 5: Hoare triple {581#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {581#true} is VALID [2020-07-10 15:25:58,456 INFO L280 TraceCheckUtils]: 6: Hoare triple {581#true} assume !(~N~0 <= 0); {581#true} is VALID [2020-07-10 15:25:58,456 INFO L263 TraceCheckUtils]: 7: Hoare triple {581#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {581#true} is VALID [2020-07-10 15:25:58,456 INFO L280 TraceCheckUtils]: 8: Hoare triple {581#true} ~cond := #in~cond; {581#true} is VALID [2020-07-10 15:25:58,457 INFO L280 TraceCheckUtils]: 9: Hoare triple {581#true} assume !(0 == ~cond); {581#true} is VALID [2020-07-10 15:25:58,457 INFO L280 TraceCheckUtils]: 10: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:58,457 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {581#true} {581#true} #73#return; {581#true} is VALID [2020-07-10 15:25:58,459 INFO L280 TraceCheckUtils]: 12: Hoare triple {581#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {590#(= 0 main_~i~0)} is VALID [2020-07-10 15:25:58,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {590#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {590#(= 0 main_~i~0)} is VALID [2020-07-10 15:25:58,460 INFO L280 TraceCheckUtils]: 14: Hoare triple {590#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {590#(= 0 main_~i~0)} is VALID [2020-07-10 15:25:58,461 INFO L280 TraceCheckUtils]: 15: Hoare triple {590#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {591#(<= main_~i~0 1)} is VALID [2020-07-10 15:25:58,462 INFO L280 TraceCheckUtils]: 16: Hoare triple {591#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {592#(<= ~N~0 1)} is VALID [2020-07-10 15:25:58,463 INFO L280 TraceCheckUtils]: 17: Hoare triple {592#(<= ~N~0 1)} ~i~0 := 0; {593#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:25:58,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(and (<= ~N~0 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {593#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:25:58,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(and (<= ~N~0 1) (= 0 main_~i~0))} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {593#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:25:58,465 INFO L280 TraceCheckUtils]: 20: Hoare triple {593#(and (<= ~N~0 1) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {594#(<= ~N~0 main_~i~0)} is VALID [2020-07-10 15:25:58,466 INFO L280 TraceCheckUtils]: 21: Hoare triple {594#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0); {582#false} is VALID [2020-07-10 15:25:58,466 INFO L280 TraceCheckUtils]: 22: Hoare triple {582#false} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {582#false} is VALID [2020-07-10 15:25:58,466 INFO L280 TraceCheckUtils]: 23: Hoare triple {582#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {582#false} is VALID [2020-07-10 15:25:58,467 INFO L280 TraceCheckUtils]: 24: Hoare triple {582#false} assume !(~i~0 < ~N~0); {582#false} is VALID [2020-07-10 15:25:58,467 INFO L280 TraceCheckUtils]: 25: Hoare triple {582#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {582#false} is VALID [2020-07-10 15:25:58,467 INFO L263 TraceCheckUtils]: 26: Hoare triple {582#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {582#false} is VALID [2020-07-10 15:25:58,467 INFO L280 TraceCheckUtils]: 27: Hoare triple {582#false} ~cond := #in~cond; {582#false} is VALID [2020-07-10 15:25:58,468 INFO L280 TraceCheckUtils]: 28: Hoare triple {582#false} assume 0 == ~cond; {582#false} is VALID [2020-07-10 15:25:58,468 INFO L280 TraceCheckUtils]: 29: Hoare triple {582#false} assume !false; {582#false} is VALID [2020-07-10 15:25:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:25:58,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908509432] [2020-07-10 15:25:58,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230079090] [2020-07-10 15:25:58,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:25:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:58,732 INFO L263 TraceCheckUtils]: 0: Hoare triple {581#true} call ULTIMATE.init(); {581#true} is VALID [2020-07-10 15:25:58,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {581#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {581#true} is VALID [2020-07-10 15:25:58,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:58,733 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #77#return; {581#true} is VALID [2020-07-10 15:25:58,733 INFO L263 TraceCheckUtils]: 4: Hoare triple {581#true} call #t~ret7 := main(); {581#true} is VALID [2020-07-10 15:25:58,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {581#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {581#true} is VALID [2020-07-10 15:25:58,734 INFO L280 TraceCheckUtils]: 6: Hoare triple {581#true} assume !(~N~0 <= 0); {581#true} is VALID [2020-07-10 15:25:58,734 INFO L263 TraceCheckUtils]: 7: Hoare triple {581#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {581#true} is VALID [2020-07-10 15:25:58,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {581#true} ~cond := #in~cond; {581#true} is VALID [2020-07-10 15:25:58,734 INFO L280 TraceCheckUtils]: 9: Hoare triple {581#true} assume !(0 == ~cond); {581#true} is VALID [2020-07-10 15:25:58,735 INFO L280 TraceCheckUtils]: 10: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:58,735 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {581#true} {581#true} #73#return; {581#true} is VALID [2020-07-10 15:25:58,737 INFO L280 TraceCheckUtils]: 12: Hoare triple {581#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {635#(<= main_~i~0 0)} is VALID [2020-07-10 15:25:58,738 INFO L280 TraceCheckUtils]: 13: Hoare triple {635#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0); {635#(<= main_~i~0 0)} is VALID [2020-07-10 15:25:58,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {635#(<= main_~i~0 0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {635#(<= main_~i~0 0)} is VALID [2020-07-10 15:25:58,740 INFO L280 TraceCheckUtils]: 15: Hoare triple {635#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {591#(<= main_~i~0 1)} is VALID [2020-07-10 15:25:58,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {591#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {592#(<= ~N~0 1)} is VALID [2020-07-10 15:25:58,742 INFO L280 TraceCheckUtils]: 17: Hoare triple {592#(<= ~N~0 1)} ~i~0 := 0; {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:25:58,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0); {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:25:58,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:25:58,745 INFO L280 TraceCheckUtils]: 20: Hoare triple {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {661#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:25:58,746 INFO L280 TraceCheckUtils]: 21: Hoare triple {661#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0); {582#false} is VALID [2020-07-10 15:25:58,746 INFO L280 TraceCheckUtils]: 22: Hoare triple {582#false} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {582#false} is VALID [2020-07-10 15:25:58,747 INFO L280 TraceCheckUtils]: 23: Hoare triple {582#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {582#false} is VALID [2020-07-10 15:25:58,747 INFO L280 TraceCheckUtils]: 24: Hoare triple {582#false} assume !(~i~0 < ~N~0); {582#false} is VALID [2020-07-10 15:25:58,747 INFO L280 TraceCheckUtils]: 25: Hoare triple {582#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {582#false} is VALID [2020-07-10 15:25:58,748 INFO L263 TraceCheckUtils]: 26: Hoare triple {582#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {582#false} is VALID [2020-07-10 15:25:58,748 INFO L280 TraceCheckUtils]: 27: Hoare triple {582#false} ~cond := #in~cond; {582#false} is VALID [2020-07-10 15:25:58,748 INFO L280 TraceCheckUtils]: 28: Hoare triple {582#false} assume 0 == ~cond; {582#false} is VALID [2020-07-10 15:25:58,749 INFO L280 TraceCheckUtils]: 29: Hoare triple {582#false} assume !false; {582#false} is VALID [2020-07-10 15:25:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:25:58,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:25:58,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:25:58,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649754262] [2020-07-10 15:25:58,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:25:58,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:58,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:25:58,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:25:58,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:25:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:25:58,817 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2020-07-10 15:25:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,263 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-10 15:25:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:25:59,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:25:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:25:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2020-07-10 15:25:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:25:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2020-07-10 15:25:59,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2020-07-10 15:25:59,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:59,340 INFO L225 Difference]: With dead ends: 55 [2020-07-10 15:25:59,340 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 15:25:59,341 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:25:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 15:25:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-07-10 15:25:59,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:59,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2020-07-10 15:25:59,376 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2020-07-10 15:25:59,376 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2020-07-10 15:25:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,379 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:25:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-10 15:25:59,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,380 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2020-07-10 15:25:59,380 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2020-07-10 15:25:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,383 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:25:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-10 15:25:59,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:59,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:25:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-10 15:25:59,386 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 30 [2020-07-10 15:25:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:59,387 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-10 15:25:59,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:25:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:25:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:25:59,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:59,388 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:59,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:59,590 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:59,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1492634651, now seen corresponding path program 1 times [2020-07-10 15:25:59,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:59,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239795931] [2020-07-10 15:25:59,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {916#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {896#true} is VALID [2020-07-10 15:26:00,123 INFO L280 TraceCheckUtils]: 1: Hoare triple {896#true} assume true; {896#true} is VALID [2020-07-10 15:26:00,123 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {896#true} {896#true} #77#return; {896#true} is VALID [2020-07-10 15:26:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {896#true} ~cond := #in~cond; {896#true} is VALID [2020-07-10 15:26:00,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {896#true} assume !(0 == ~cond); {896#true} is VALID [2020-07-10 15:26:00,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {896#true} assume true; {896#true} is VALID [2020-07-10 15:26:00,134 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {896#true} {901#(<= 1 ~N~0)} #73#return; {901#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:00,136 INFO L263 TraceCheckUtils]: 0: Hoare triple {896#true} call ULTIMATE.init(); {916#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:00,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {916#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {896#true} is VALID [2020-07-10 15:26:00,137 INFO L280 TraceCheckUtils]: 2: Hoare triple {896#true} assume true; {896#true} is VALID [2020-07-10 15:26:00,137 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {896#true} {896#true} #77#return; {896#true} is VALID [2020-07-10 15:26:00,137 INFO L263 TraceCheckUtils]: 4: Hoare triple {896#true} call #t~ret7 := main(); {896#true} is VALID [2020-07-10 15:26:00,137 INFO L280 TraceCheckUtils]: 5: Hoare triple {896#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {896#true} is VALID [2020-07-10 15:26:00,139 INFO L280 TraceCheckUtils]: 6: Hoare triple {896#true} assume !(~N~0 <= 0); {901#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:00,139 INFO L263 TraceCheckUtils]: 7: Hoare triple {901#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {896#true} is VALID [2020-07-10 15:26:00,139 INFO L280 TraceCheckUtils]: 8: Hoare triple {896#true} ~cond := #in~cond; {896#true} is VALID [2020-07-10 15:26:00,140 INFO L280 TraceCheckUtils]: 9: Hoare triple {896#true} assume !(0 == ~cond); {896#true} is VALID [2020-07-10 15:26:00,140 INFO L280 TraceCheckUtils]: 10: Hoare triple {896#true} assume true; {896#true} is VALID [2020-07-10 15:26:00,141 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {896#true} {901#(<= 1 ~N~0)} #73#return; {901#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:00,143 INFO L280 TraceCheckUtils]: 12: Hoare triple {901#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {906#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-10 15:26:00,145 INFO L280 TraceCheckUtils]: 13: Hoare triple {906#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume !!(~i~0 < ~N~0); {906#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-10 15:26:00,146 INFO L280 TraceCheckUtils]: 14: Hoare triple {906#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {906#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-10 15:26:00,147 INFO L280 TraceCheckUtils]: 15: Hoare triple {906#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {907#(and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:26:00,148 INFO L280 TraceCheckUtils]: 16: Hoare triple {907#(and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0); {907#(and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:26:00,150 INFO L280 TraceCheckUtils]: 17: Hoare triple {907#(and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2));call write~int(0, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {908#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-10 15:26:00,152 INFO L280 TraceCheckUtils]: 18: Hoare triple {908#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {908#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-10 15:26:00,153 INFO L280 TraceCheckUtils]: 19: Hoare triple {908#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume !(~i~0 < ~N~0); {908#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-10 15:26:00,155 INFO L280 TraceCheckUtils]: 20: Hoare triple {908#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} ~i~0 := 0; {909#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-10 15:26:00,156 INFO L280 TraceCheckUtils]: 21: Hoare triple {909#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume !!(~i~0 < ~N~0); {909#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-10 15:26:00,158 INFO L280 TraceCheckUtils]: 22: Hoare triple {909#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {910#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:26:00,159 INFO L280 TraceCheckUtils]: 23: Hoare triple {910#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {911#(and (= 0 (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:26:00,160 INFO L280 TraceCheckUtils]: 24: Hoare triple {911#(and (= 0 (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !!(~i~0 < ~N~0); {911#(and (= 0 (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:26:00,162 INFO L280 TraceCheckUtils]: 25: Hoare triple {911#(and (= 0 (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {912#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (* 2 ~N~0))} is VALID [2020-07-10 15:26:00,163 INFO L280 TraceCheckUtils]: 26: Hoare triple {912#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (* 2 ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {912#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (* 2 ~N~0))} is VALID [2020-07-10 15:26:00,164 INFO L280 TraceCheckUtils]: 27: Hoare triple {912#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (* 2 ~N~0))} assume !(~i~0 < ~N~0); {912#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (* 2 ~N~0))} is VALID [2020-07-10 15:26:00,166 INFO L280 TraceCheckUtils]: 28: Hoare triple {912#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (* 2 ~N~0))} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {913#(<= (+ |main_#t~mem6| 2) (* 2 ~N~0))} is VALID [2020-07-10 15:26:00,168 INFO L263 TraceCheckUtils]: 29: Hoare triple {913#(<= (+ |main_#t~mem6| 2) (* 2 ~N~0))} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {914#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:26:00,169 INFO L280 TraceCheckUtils]: 30: Hoare triple {914#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {915#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:26:00,170 INFO L280 TraceCheckUtils]: 31: Hoare triple {915#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {897#false} is VALID [2020-07-10 15:26:00,170 INFO L280 TraceCheckUtils]: 32: Hoare triple {897#false} assume !false; {897#false} is VALID [2020-07-10 15:26:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:00,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239795931] [2020-07-10 15:26:00,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335410632] [2020-07-10 15:26:00,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-10 15:26:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:00,445 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-10 15:26:00,446 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:00,456 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:00,457 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:00,458 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-07-10 15:26:00,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:00,593 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-07-10 15:26:00,595 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:00,608 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:00,609 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:00,609 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-07-10 15:26:00,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:00,778 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2020-07-10 15:26:00,794 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:00,805 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:00,809 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-10 15:26:00,810 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2020-07-10 15:26:00,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:00,969 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-07-10 15:26:00,974 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:00,981 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:00,984 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:00,984 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:7 [2020-07-10 15:26:00,989 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:00,990 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#sum~0.base|, |main_~#sum~0.offset|, main_~a~0.base, main_~a~0.offset]. (let ((.cse0 (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (<= |main_#t~mem6| .cse0) (= .cse0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|) (= .cse0 0))) [2020-07-10 15:26:00,990 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 1 ~N~0) (<= |main_#t~mem6| 0)) [2020-07-10 15:26:01,040 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:01,060 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:01,157 INFO L263 TraceCheckUtils]: 0: Hoare triple {896#true} call ULTIMATE.init(); {896#true} is VALID [2020-07-10 15:26:01,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {896#true} is VALID [2020-07-10 15:26:01,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {896#true} assume true; {896#true} is VALID [2020-07-10 15:26:01,158 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {896#true} {896#true} #77#return; {896#true} is VALID [2020-07-10 15:26:01,159 INFO L263 TraceCheckUtils]: 4: Hoare triple {896#true} call #t~ret7 := main(); {896#true} is VALID [2020-07-10 15:26:01,159 INFO L280 TraceCheckUtils]: 5: Hoare triple {896#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {896#true} is VALID [2020-07-10 15:26:01,168 INFO L280 TraceCheckUtils]: 6: Hoare triple {896#true} assume !(~N~0 <= 0); {901#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:01,170 INFO L263 TraceCheckUtils]: 7: Hoare triple {901#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {901#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:01,171 INFO L280 TraceCheckUtils]: 8: Hoare triple {901#(<= 1 ~N~0)} ~cond := #in~cond; {901#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:01,171 INFO L280 TraceCheckUtils]: 9: Hoare triple {901#(<= 1 ~N~0)} assume !(0 == ~cond); {901#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:01,172 INFO L280 TraceCheckUtils]: 10: Hoare triple {901#(<= 1 ~N~0)} assume true; {901#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:01,173 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {901#(<= 1 ~N~0)} {901#(<= 1 ~N~0)} #73#return; {901#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:01,179 INFO L280 TraceCheckUtils]: 12: Hoare triple {901#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {956#(and (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,181 INFO L280 TraceCheckUtils]: 13: Hoare triple {956#(and (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0); {956#(and (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,182 INFO L280 TraceCheckUtils]: 14: Hoare triple {956#(and (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {956#(and (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,183 INFO L280 TraceCheckUtils]: 15: Hoare triple {956#(and (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {966#(and (= 1 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,184 INFO L280 TraceCheckUtils]: 16: Hoare triple {966#(and (= 1 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0); {966#(and (= 1 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,186 INFO L280 TraceCheckUtils]: 17: Hoare triple {966#(and (= 1 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2));call write~int(0, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {973#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,187 INFO L280 TraceCheckUtils]: 18: Hoare triple {973#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {973#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,188 INFO L280 TraceCheckUtils]: 19: Hoare triple {973#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !(~i~0 < ~N~0); {973#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,189 INFO L280 TraceCheckUtils]: 20: Hoare triple {973#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} ~i~0 := 0; {983#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,191 INFO L280 TraceCheckUtils]: 21: Hoare triple {983#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0); {983#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,193 INFO L280 TraceCheckUtils]: 22: Hoare triple {983#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {990#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,195 INFO L280 TraceCheckUtils]: 23: Hoare triple {990#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 0 main_~i~0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {994#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 main_~i~0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,196 INFO L280 TraceCheckUtils]: 24: Hoare triple {994#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 main_~i~0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0); {994#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 main_~i~0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:01,198 INFO L280 TraceCheckUtils]: 25: Hoare triple {994#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 main_~i~0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {1001#(and (<= 1 ~N~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:26:01,200 INFO L280 TraceCheckUtils]: 26: Hoare triple {1001#(and (<= 1 ~N~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1001#(and (<= 1 ~N~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:26:01,201 INFO L280 TraceCheckUtils]: 27: Hoare triple {1001#(and (<= 1 ~N~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(~i~0 < ~N~0); {1001#(and (<= 1 ~N~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:26:01,202 INFO L280 TraceCheckUtils]: 28: Hoare triple {1001#(and (<= 1 ~N~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {1011#(and (<= 1 ~N~0) (<= |main_#t~mem6| 0))} is VALID [2020-07-10 15:26:01,204 INFO L263 TraceCheckUtils]: 29: Hoare triple {1011#(and (<= 1 ~N~0) (<= |main_#t~mem6| 0))} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {1015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:26:01,205 INFO L280 TraceCheckUtils]: 30: Hoare triple {1015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:26:01,206 INFO L280 TraceCheckUtils]: 31: Hoare triple {1019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {897#false} is VALID [2020-07-10 15:26:01,206 INFO L280 TraceCheckUtils]: 32: Hoare triple {897#false} assume !false; {897#false} is VALID [2020-07-10 15:26:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:01,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:01,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2020-07-10 15:26:01,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942702139] [2020-07-10 15:26:01,217 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2020-07-10 15:26:01,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:01,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-10 15:26:01,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:01,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-10 15:26:01,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:01,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-10 15:26:01,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2020-07-10 15:26:01,322 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 24 states. [2020-07-10 15:26:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:02,905 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-07-10 15:26:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:26:02,905 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2020-07-10 15:26:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 15:26:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2020-07-10 15:26:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 15:26:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2020-07-10 15:26:02,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 67 transitions. [2020-07-10 15:26:03,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,004 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:26:03,004 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 15:26:03,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2020-07-10 15:26:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 15:26:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2020-07-10 15:26:03,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:03,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2020-07-10 15:26:03,046 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2020-07-10 15:26:03,047 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2020-07-10 15:26:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,049 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 15:26:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:26:03,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,050 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2020-07-10 15:26:03,050 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2020-07-10 15:26:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,052 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 15:26:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:26:03,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:03,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 15:26:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2020-07-10 15:26:03,055 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 33 [2020-07-10 15:26:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:03,055 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2020-07-10 15:26:03,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-10 15:26:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-10 15:26:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 15:26:03,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:03,056 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:03,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:03,270 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2145280396, now seen corresponding path program 2 times [2020-07-10 15:26:03,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:03,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71805587] [2020-07-10 15:26:03,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {1275#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1259#true} is VALID [2020-07-10 15:26:03,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {1259#true} assume true; {1259#true} is VALID [2020-07-10 15:26:03,434 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1259#true} {1259#true} #77#return; {1259#true} is VALID [2020-07-10 15:26:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {1259#true} ~cond := #in~cond; {1259#true} is VALID [2020-07-10 15:26:03,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {1259#true} assume !(0 == ~cond); {1259#true} is VALID [2020-07-10 15:26:03,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {1259#true} assume true; {1259#true} is VALID [2020-07-10 15:26:03,439 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1259#true} {1259#true} #73#return; {1259#true} is VALID [2020-07-10 15:26:03,440 INFO L263 TraceCheckUtils]: 0: Hoare triple {1259#true} call ULTIMATE.init(); {1275#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:03,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {1275#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1259#true} is VALID [2020-07-10 15:26:03,441 INFO L280 TraceCheckUtils]: 2: Hoare triple {1259#true} assume true; {1259#true} is VALID [2020-07-10 15:26:03,441 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1259#true} {1259#true} #77#return; {1259#true} is VALID [2020-07-10 15:26:03,441 INFO L263 TraceCheckUtils]: 4: Hoare triple {1259#true} call #t~ret7 := main(); {1259#true} is VALID [2020-07-10 15:26:03,441 INFO L280 TraceCheckUtils]: 5: Hoare triple {1259#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1259#true} is VALID [2020-07-10 15:26:03,442 INFO L280 TraceCheckUtils]: 6: Hoare triple {1259#true} assume !(~N~0 <= 0); {1259#true} is VALID [2020-07-10 15:26:03,442 INFO L263 TraceCheckUtils]: 7: Hoare triple {1259#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1259#true} is VALID [2020-07-10 15:26:03,442 INFO L280 TraceCheckUtils]: 8: Hoare triple {1259#true} ~cond := #in~cond; {1259#true} is VALID [2020-07-10 15:26:03,442 INFO L280 TraceCheckUtils]: 9: Hoare triple {1259#true} assume !(0 == ~cond); {1259#true} is VALID [2020-07-10 15:26:03,443 INFO L280 TraceCheckUtils]: 10: Hoare triple {1259#true} assume true; {1259#true} is VALID [2020-07-10 15:26:03,443 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1259#true} {1259#true} #73#return; {1259#true} is VALID [2020-07-10 15:26:03,444 INFO L280 TraceCheckUtils]: 12: Hoare triple {1259#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1268#(= 0 main_~i~0)} is VALID [2020-07-10 15:26:03,444 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {1268#(= 0 main_~i~0)} is VALID [2020-07-10 15:26:03,445 INFO L280 TraceCheckUtils]: 14: Hoare triple {1268#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1268#(= 0 main_~i~0)} is VALID [2020-07-10 15:26:03,446 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1269#(<= main_~i~0 1)} is VALID [2020-07-10 15:26:03,447 INFO L280 TraceCheckUtils]: 16: Hoare triple {1269#(<= main_~i~0 1)} assume !!(~i~0 < ~N~0); {1269#(<= main_~i~0 1)} is VALID [2020-07-10 15:26:03,450 INFO L280 TraceCheckUtils]: 17: Hoare triple {1269#(<= main_~i~0 1)} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2));call write~int(0, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1269#(<= main_~i~0 1)} is VALID [2020-07-10 15:26:03,451 INFO L280 TraceCheckUtils]: 18: Hoare triple {1269#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1270#(<= main_~i~0 2)} is VALID [2020-07-10 15:26:03,452 INFO L280 TraceCheckUtils]: 19: Hoare triple {1270#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1271#(<= ~N~0 2)} is VALID [2020-07-10 15:26:03,453 INFO L280 TraceCheckUtils]: 20: Hoare triple {1271#(<= ~N~0 2)} ~i~0 := 0; {1272#(and (<= ~N~0 2) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:03,453 INFO L280 TraceCheckUtils]: 21: Hoare triple {1272#(and (<= ~N~0 2) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {1272#(and (<= ~N~0 2) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:03,454 INFO L280 TraceCheckUtils]: 22: Hoare triple {1272#(and (<= ~N~0 2) (= 0 main_~i~0))} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {1272#(and (<= ~N~0 2) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:03,455 INFO L280 TraceCheckUtils]: 23: Hoare triple {1272#(and (<= ~N~0 2) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1273#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-10 15:26:03,456 INFO L280 TraceCheckUtils]: 24: Hoare triple {1273#(<= ~N~0 (+ main_~i~0 1))} assume !!(~i~0 < ~N~0); {1273#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-10 15:26:03,456 INFO L280 TraceCheckUtils]: 25: Hoare triple {1273#(<= ~N~0 (+ main_~i~0 1))} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {1273#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-10 15:26:03,457 INFO L280 TraceCheckUtils]: 26: Hoare triple {1273#(<= ~N~0 (+ main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1274#(<= ~N~0 main_~i~0)} is VALID [2020-07-10 15:26:03,458 INFO L280 TraceCheckUtils]: 27: Hoare triple {1274#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0); {1260#false} is VALID [2020-07-10 15:26:03,458 INFO L280 TraceCheckUtils]: 28: Hoare triple {1260#false} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {1260#false} is VALID [2020-07-10 15:26:03,458 INFO L280 TraceCheckUtils]: 29: Hoare triple {1260#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1260#false} is VALID [2020-07-10 15:26:03,458 INFO L280 TraceCheckUtils]: 30: Hoare triple {1260#false} assume !(~i~0 < ~N~0); {1260#false} is VALID [2020-07-10 15:26:03,458 INFO L280 TraceCheckUtils]: 31: Hoare triple {1260#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {1260#false} is VALID [2020-07-10 15:26:03,458 INFO L263 TraceCheckUtils]: 32: Hoare triple {1260#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {1260#false} is VALID [2020-07-10 15:26:03,459 INFO L280 TraceCheckUtils]: 33: Hoare triple {1260#false} ~cond := #in~cond; {1260#false} is VALID [2020-07-10 15:26:03,459 INFO L280 TraceCheckUtils]: 34: Hoare triple {1260#false} assume 0 == ~cond; {1260#false} is VALID [2020-07-10 15:26:03,459 INFO L280 TraceCheckUtils]: 35: Hoare triple {1260#false} assume !false; {1260#false} is VALID [2020-07-10 15:26:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:03,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71805587] [2020-07-10 15:26:03,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885097631] [2020-07-10 15:26:03,462 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-10 15:26:03,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:03,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:03,518 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:26:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:03,722 INFO L263 TraceCheckUtils]: 0: Hoare triple {1259#true} call ULTIMATE.init(); {1259#true} is VALID [2020-07-10 15:26:03,723 INFO L280 TraceCheckUtils]: 1: Hoare triple {1259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1259#true} is VALID [2020-07-10 15:26:03,723 INFO L280 TraceCheckUtils]: 2: Hoare triple {1259#true} assume true; {1259#true} is VALID [2020-07-10 15:26:03,724 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1259#true} {1259#true} #77#return; {1259#true} is VALID [2020-07-10 15:26:03,724 INFO L263 TraceCheckUtils]: 4: Hoare triple {1259#true} call #t~ret7 := main(); {1259#true} is VALID [2020-07-10 15:26:03,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {1259#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1259#true} is VALID [2020-07-10 15:26:03,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {1259#true} assume !(~N~0 <= 0); {1259#true} is VALID [2020-07-10 15:26:03,725 INFO L263 TraceCheckUtils]: 7: Hoare triple {1259#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1259#true} is VALID [2020-07-10 15:26:03,725 INFO L280 TraceCheckUtils]: 8: Hoare triple {1259#true} ~cond := #in~cond; {1259#true} is VALID [2020-07-10 15:26:03,725 INFO L280 TraceCheckUtils]: 9: Hoare triple {1259#true} assume !(0 == ~cond); {1259#true} is VALID [2020-07-10 15:26:03,725 INFO L280 TraceCheckUtils]: 10: Hoare triple {1259#true} assume true; {1259#true} is VALID [2020-07-10 15:26:03,726 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1259#true} {1259#true} #73#return; {1259#true} is VALID [2020-07-10 15:26:03,727 INFO L280 TraceCheckUtils]: 12: Hoare triple {1259#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1315#(<= main_~i~0 0)} is VALID [2020-07-10 15:26:03,728 INFO L280 TraceCheckUtils]: 13: Hoare triple {1315#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0); {1315#(<= main_~i~0 0)} is VALID [2020-07-10 15:26:03,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {1315#(<= main_~i~0 0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1315#(<= main_~i~0 0)} is VALID [2020-07-10 15:26:03,730 INFO L280 TraceCheckUtils]: 15: Hoare triple {1315#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1269#(<= main_~i~0 1)} is VALID [2020-07-10 15:26:03,730 INFO L280 TraceCheckUtils]: 16: Hoare triple {1269#(<= main_~i~0 1)} assume !!(~i~0 < ~N~0); {1269#(<= main_~i~0 1)} is VALID [2020-07-10 15:26:03,731 INFO L280 TraceCheckUtils]: 17: Hoare triple {1269#(<= main_~i~0 1)} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2));call write~int(0, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1269#(<= main_~i~0 1)} is VALID [2020-07-10 15:26:03,731 INFO L280 TraceCheckUtils]: 18: Hoare triple {1269#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1270#(<= main_~i~0 2)} is VALID [2020-07-10 15:26:03,732 INFO L280 TraceCheckUtils]: 19: Hoare triple {1270#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1271#(<= ~N~0 2)} is VALID [2020-07-10 15:26:03,733 INFO L280 TraceCheckUtils]: 20: Hoare triple {1271#(<= ~N~0 2)} ~i~0 := 0; {1340#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-10 15:26:03,733 INFO L280 TraceCheckUtils]: 21: Hoare triple {1340#(and (<= ~N~0 2) (<= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {1340#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-10 15:26:03,734 INFO L280 TraceCheckUtils]: 22: Hoare triple {1340#(and (<= ~N~0 2) (<= 0 main_~i~0))} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {1340#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-10 15:26:03,735 INFO L280 TraceCheckUtils]: 23: Hoare triple {1340#(and (<= ~N~0 2) (<= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1350#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-10 15:26:03,745 INFO L280 TraceCheckUtils]: 24: Hoare triple {1350#(and (<= ~N~0 2) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0); {1350#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-10 15:26:03,746 INFO L280 TraceCheckUtils]: 25: Hoare triple {1350#(and (<= ~N~0 2) (<= 1 main_~i~0))} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {1350#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-10 15:26:03,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {1350#(and (<= ~N~0 2) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1360#(and (<= ~N~0 2) (<= 2 main_~i~0))} is VALID [2020-07-10 15:26:03,748 INFO L280 TraceCheckUtils]: 27: Hoare triple {1360#(and (<= ~N~0 2) (<= 2 main_~i~0))} assume !!(~i~0 < ~N~0); {1260#false} is VALID [2020-07-10 15:26:03,748 INFO L280 TraceCheckUtils]: 28: Hoare triple {1260#false} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {1260#false} is VALID [2020-07-10 15:26:03,749 INFO L280 TraceCheckUtils]: 29: Hoare triple {1260#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1260#false} is VALID [2020-07-10 15:26:03,749 INFO L280 TraceCheckUtils]: 30: Hoare triple {1260#false} assume !(~i~0 < ~N~0); {1260#false} is VALID [2020-07-10 15:26:03,749 INFO L280 TraceCheckUtils]: 31: Hoare triple {1260#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {1260#false} is VALID [2020-07-10 15:26:03,749 INFO L263 TraceCheckUtils]: 32: Hoare triple {1260#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {1260#false} is VALID [2020-07-10 15:26:03,749 INFO L280 TraceCheckUtils]: 33: Hoare triple {1260#false} ~cond := #in~cond; {1260#false} is VALID [2020-07-10 15:26:03,749 INFO L280 TraceCheckUtils]: 34: Hoare triple {1260#false} assume 0 == ~cond; {1260#false} is VALID [2020-07-10 15:26:03,750 INFO L280 TraceCheckUtils]: 35: Hoare triple {1260#false} assume !false; {1260#false} is VALID [2020-07-10 15:26:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:03,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:03,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-07-10 15:26:03,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595658384] [2020-07-10 15:26:03,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-10 15:26:03,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:03,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 15:26:03,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 15:26:03,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 15:26:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:26:03,820 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 14 states. [2020-07-10 15:26:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,515 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-10 15:26:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:26:04,515 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-10 15:26:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:26:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2020-07-10 15:26:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:26:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2020-07-10 15:26:04,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 68 transitions. [2020-07-10 15:26:04,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:04,609 INFO L225 Difference]: With dead ends: 66 [2020-07-10 15:26:04,610 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 15:26:04,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:26:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 15:26:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-07-10 15:26:04,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:04,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2020-07-10 15:26:04,651 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2020-07-10 15:26:04,651 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2020-07-10 15:26:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,655 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2020-07-10 15:26:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2020-07-10 15:26:04,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:04,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:04,656 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2020-07-10 15:26:04,656 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2020-07-10 15:26:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,658 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2020-07-10 15:26:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2020-07-10 15:26:04,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:04,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:04,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:04,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 15:26:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-10 15:26:04,661 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 36 [2020-07-10 15:26:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:04,661 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-10 15:26:04,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 15:26:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-10 15:26:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 15:26:04,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:04,663 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:04,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:04,877 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1680039082, now seen corresponding path program 3 times [2020-07-10 15:26:04,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:04,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696899573] [2020-07-10 15:26:04,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:04,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:04,975 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:04,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:26:05,029 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:05,029 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:05,029 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:05,029 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:05,029 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:05,030 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:05,031 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:05,031 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:05,031 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:05,031 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:05,031 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:05,031 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:05,031 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:05,032 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:05,032 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:05,032 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:05,032 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:05,032 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:05,032 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:05,032 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:05,033 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:05,033 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:05,033 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-10 15:26:05,033 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-10 15:26:05,033 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:26:05,033 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:26:05,033 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:05,033 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:05,033 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:05,034 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-10 15:26:05,034 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-10 15:26:05,034 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:26:05,034 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:26:05,034 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:05,034 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:05,034 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 15:26:05,035 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-10 15:26:05,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:05 BoogieIcfgContainer [2020-07-10 15:26:05,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:05,041 INFO L168 Benchmark]: Toolchain (without parser) took 10542.28 ms. Allocated memory was 137.4 MB in the beginning and 310.4 MB in the end (delta: 173.0 MB). Free memory was 100.3 MB in the beginning and 192.4 MB in the end (delta: -92.1 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:05,042 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:05,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.36 ms. Allocated memory is still 137.4 MB. Free memory was 100.1 MB in the beginning and 89.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:05,043 INFO L168 Benchmark]: Boogie Preprocessor took 148.40 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 89.1 MB in the beginning and 179.8 MB in the end (delta: -90.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:05,044 INFO L168 Benchmark]: RCFGBuilder took 554.29 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 154.6 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:05,045 INFO L168 Benchmark]: TraceAbstraction took 9546.27 ms. Allocated memory was 202.4 MB in the beginning and 310.4 MB in the end (delta: 108.0 MB). Free memory was 154.6 MB in the beginning and 192.4 MB in the end (delta: -37.8 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:05,048 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.34 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 286.36 ms. Allocated memory is still 137.4 MB. Free memory was 100.1 MB in the beginning and 89.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.40 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 89.1 MB in the beginning and 179.8 MB in the end (delta: -90.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 554.29 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 154.6 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9546.27 ms. Allocated memory was 202.4 MB in the beginning and 310.4 MB in the end (delta: 108.0 MB). Free memory was 154.6 MB in the beginning and 192.4 MB in the end (delta: -37.8 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 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 [\old(N)=22, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=3] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=3] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=3] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=3] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=3, sum={2:0}] [L29] COND TRUE i