/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/sina3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:38,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:38,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:38,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:38,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:38,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:38,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:38,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:38,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:38,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:38,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:38,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:38,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:38,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:38,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:38,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:38,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:38,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:38,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:38,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:38,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:38,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:38,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:38,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:38,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:38,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:38,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:38,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:38,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:38,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:38,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:38,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:38,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:38,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:38,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:38,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:38,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:38,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:38,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:38,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:38,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:38,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:38,145 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:38,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:38,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:38,147 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:38,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:38,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:38,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:38,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:38,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:38,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:38,148 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:38,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:38,149 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:38,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:38,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:38,149 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:38,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:38,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:38,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:38,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:38,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:38,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:38,151 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:38,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:38,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:38,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:38,462 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:38,462 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:38,463 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina3f.c [2020-07-10 20:21:38,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6884582cb/cc5e14e2299d4ca39c6e6f187bdf815e/FLAGa2b27d5c3 [2020-07-10 20:21:39,057 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:39,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina3f.c [2020-07-10 20:21:39,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6884582cb/cc5e14e2299d4ca39c6e6f187bdf815e/FLAGa2b27d5c3 [2020-07-10 20:21:39,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6884582cb/cc5e14e2299d4ca39c6e6f187bdf815e [2020-07-10 20:21:39,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:39,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:39,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:39,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:39,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:39,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b43373c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39, skipping insertion in model container [2020-07-10 20:21:39,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:39,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:39,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:39,685 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:39,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:39,732 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:39,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39 WrapperNode [2020-07-10 20:21:39,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:39,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:39,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:39,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:39,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:39,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:39,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:39,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:39,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (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 20:21:39,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:39,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:39,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:39,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:39,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:40,440 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:40,441 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-10 20:21:40,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:40 BoogieIcfgContainer [2020-07-10 20:21:40,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:40,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:40,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:40,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:40,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:39" (1/3) ... [2020-07-10 20:21:40,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d7de52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:40, skipping insertion in model container [2020-07-10 20:21:40,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (2/3) ... [2020-07-10 20:21:40,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d7de52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:40, skipping insertion in model container [2020-07-10 20:21:40,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:40" (3/3) ... [2020-07-10 20:21:40,454 INFO L109 eAbstractionObserver]: Analyzing ICFG sina3f.c [2020-07-10 20:21:40,466 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:40,474 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:40,487 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:40,506 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:40,506 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:40,506 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:40,506 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:40,507 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:40,507 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:40,507 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:40,507 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-07-10 20:21:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:21:40,532 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:40,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:40,533 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:40,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:40,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1651935650, now seen corresponding path program 1 times [2020-07-10 20:21:40,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:40,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1829343772] [2020-07-10 20:21:40,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:40,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {94#(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; {82#true} is VALID [2020-07-10 20:21:40,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-10 20:21:40,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-10 20:21:40,809 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} ~N~0 := 0; {82#true} is VALID [2020-07-10 20:21:40,810 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 20:21:40,810 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {82#true} {82#true} #148#return; {82#true} is VALID [2020-07-10 20:21:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:40,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#true} ~cond := #in~cond; {82#true} is VALID [2020-07-10 20:21:40,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} assume !(0 == ~cond); {82#true} is VALID [2020-07-10 20:21:40,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 20:21:40,824 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {82#true} {82#true} #144#return; {82#true} is VALID [2020-07-10 20:21:40,827 INFO L263 TraceCheckUtils]: 0: Hoare triple {82#true} call ULTIMATE.init(); {94#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:40,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {94#(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; {82#true} is VALID [2020-07-10 20:21:40,828 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-10 20:21:40,828 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-10 20:21:40,829 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} ~N~0 := 0; {82#true} is VALID [2020-07-10 20:21:40,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 20:21:40,829 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {82#true} {82#true} #148#return; {82#true} is VALID [2020-07-10 20:21:40,830 INFO L263 TraceCheckUtils]: 7: Hoare triple {82#true} call #t~ret13 := main(); {82#true} is VALID [2020-07-10 20:21:40,830 INFO L280 TraceCheckUtils]: 8: Hoare triple {82#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {82#true} is VALID [2020-07-10 20:21:40,831 INFO L280 TraceCheckUtils]: 9: Hoare triple {82#true} ~N~0 := #t~nondet0; {82#true} is VALID [2020-07-10 20:21:40,831 INFO L280 TraceCheckUtils]: 10: Hoare triple {82#true} havoc #t~nondet0; {82#true} is VALID [2020-07-10 20:21:40,831 INFO L280 TraceCheckUtils]: 11: Hoare triple {82#true} assume !(~N~0 <= 0); {82#true} is VALID [2020-07-10 20:21:40,832 INFO L263 TraceCheckUtils]: 12: Hoare triple {82#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {82#true} is VALID [2020-07-10 20:21:40,832 INFO L280 TraceCheckUtils]: 13: Hoare triple {82#true} ~cond := #in~cond; {82#true} is VALID [2020-07-10 20:21:40,833 INFO L280 TraceCheckUtils]: 14: Hoare triple {82#true} assume !(0 == ~cond); {82#true} is VALID [2020-07-10 20:21:40,833 INFO L280 TraceCheckUtils]: 15: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 20:21:40,833 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {82#true} {82#true} #144#return; {82#true} is VALID [2020-07-10 20:21:40,834 INFO L280 TraceCheckUtils]: 17: Hoare triple {82#true} havoc ~i~0; {82#true} is VALID [2020-07-10 20:21:40,834 INFO L280 TraceCheckUtils]: 18: Hoare triple {82#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {82#true} is VALID [2020-07-10 20:21:40,835 INFO L280 TraceCheckUtils]: 19: Hoare triple {82#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {82#true} is VALID [2020-07-10 20:21:40,835 INFO L280 TraceCheckUtils]: 20: Hoare triple {82#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {82#true} is VALID [2020-07-10 20:21:40,836 INFO L280 TraceCheckUtils]: 21: Hoare triple {82#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {82#true} is VALID [2020-07-10 20:21:40,836 INFO L280 TraceCheckUtils]: 22: Hoare triple {82#true} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {82#true} is VALID [2020-07-10 20:21:40,837 INFO L280 TraceCheckUtils]: 23: Hoare triple {82#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {82#true} is VALID [2020-07-10 20:21:40,837 INFO L280 TraceCheckUtils]: 24: Hoare triple {82#true} ~i~0 := 0; {82#true} is VALID [2020-07-10 20:21:40,838 INFO L280 TraceCheckUtils]: 25: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-10 20:21:40,839 INFO L280 TraceCheckUtils]: 26: Hoare triple {83#false} ~i~0 := 0; {83#false} is VALID [2020-07-10 20:21:40,840 INFO L280 TraceCheckUtils]: 27: Hoare triple {83#false} assume !(~i~0 < ~N~0); {83#false} is VALID [2020-07-10 20:21:40,840 INFO L280 TraceCheckUtils]: 28: Hoare triple {83#false} ~i~0 := 0; {83#false} is VALID [2020-07-10 20:21:40,841 INFO L280 TraceCheckUtils]: 29: Hoare triple {83#false} assume !(~i~0 < ~N~0); {83#false} is VALID [2020-07-10 20:21:40,841 INFO L280 TraceCheckUtils]: 30: Hoare triple {83#false} ~i~0 := 0; {83#false} is VALID [2020-07-10 20:21:40,841 INFO L280 TraceCheckUtils]: 31: Hoare triple {83#false} assume !true; {83#false} is VALID [2020-07-10 20:21:40,842 INFO L280 TraceCheckUtils]: 32: Hoare triple {83#false} ~i~0 := 0; {83#false} is VALID [2020-07-10 20:21:40,842 INFO L280 TraceCheckUtils]: 33: Hoare triple {83#false} assume !!(~i~0 < ~N~0); {83#false} is VALID [2020-07-10 20:21:40,843 INFO L280 TraceCheckUtils]: 34: Hoare triple {83#false} SUMMARY for call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L53 {83#false} is VALID [2020-07-10 20:21:40,843 INFO L263 TraceCheckUtils]: 35: Hoare triple {83#false} call __VERIFIER_assert((if #t~mem12 == 1 + ~N~0 then 1 else 0)); {83#false} is VALID [2020-07-10 20:21:40,843 INFO L280 TraceCheckUtils]: 36: Hoare triple {83#false} ~cond := #in~cond; {83#false} is VALID [2020-07-10 20:21:40,844 INFO L280 TraceCheckUtils]: 37: Hoare triple {83#false} assume 0 == ~cond; {83#false} is VALID [2020-07-10 20:21:40,844 INFO L280 TraceCheckUtils]: 38: Hoare triple {83#false} assume !false; {83#false} is VALID [2020-07-10 20:21:40,850 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 20:21:40,851 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:40,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1829343772] [2020-07-10 20:21:40,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:40,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:40,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611415590] [2020-07-10 20:21:40,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-10 20:21:40,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:40,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:40,938 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 20:21:40,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:40,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:40,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:40,952 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2020-07-10 20:21:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:41,472 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2020-07-10 20:21:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:41,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-10 20:21:41,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-10 20:21:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-10 20:21:41,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2020-07-10 20:21:41,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:41,730 INFO L225 Difference]: With dead ends: 141 [2020-07-10 20:21:41,730 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 20:21:41,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 20:21:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 20:21:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-10 20:21:41,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:41,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:41,836 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:41,836 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:41,844 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-07-10 20:21:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-10 20:21:41,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:41,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:41,845 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:41,846 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:41,853 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-07-10 20:21:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-10 20:21:41,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:41,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:41,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:41,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 20:21:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2020-07-10 20:21:41,861 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 39 [2020-07-10 20:21:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:41,862 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2020-07-10 20:21:41,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:41,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2020-07-10 20:21:41,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-10 20:21:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:21:41,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:41,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:41,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:41,965 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 725298104, now seen corresponding path program 1 times [2020-07-10 20:21:41,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:41,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [370393822] [2020-07-10 20:21:41,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:42,106 INFO L280 TraceCheckUtils]: 0: Hoare triple {673#(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; {659#true} is VALID [2020-07-10 20:21:42,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {659#true} #valid := #valid[0 := 0]; {659#true} is VALID [2020-07-10 20:21:42,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {659#true} assume 0 < #StackHeapBarrier; {659#true} is VALID [2020-07-10 20:21:42,107 INFO L280 TraceCheckUtils]: 3: Hoare triple {659#true} ~N~0 := 0; {659#true} is VALID [2020-07-10 20:21:42,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {659#true} assume true; {659#true} is VALID [2020-07-10 20:21:42,108 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {659#true} {659#true} #148#return; {659#true} is VALID [2020-07-10 20:21:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:42,117 INFO L280 TraceCheckUtils]: 0: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2020-07-10 20:21:42,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2020-07-10 20:21:42,118 INFO L280 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2020-07-10 20:21:42,119 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {659#true} {667#(<= 1 ~N~0)} #144#return; {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,121 INFO L263 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {673#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:42,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {673#(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; {659#true} is VALID [2020-07-10 20:21:42,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {659#true} #valid := #valid[0 := 0]; {659#true} is VALID [2020-07-10 20:21:42,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {659#true} assume 0 < #StackHeapBarrier; {659#true} is VALID [2020-07-10 20:21:42,122 INFO L280 TraceCheckUtils]: 4: Hoare triple {659#true} ~N~0 := 0; {659#true} is VALID [2020-07-10 20:21:42,123 INFO L280 TraceCheckUtils]: 5: Hoare triple {659#true} assume true; {659#true} is VALID [2020-07-10 20:21:42,123 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {659#true} {659#true} #148#return; {659#true} is VALID [2020-07-10 20:21:42,123 INFO L263 TraceCheckUtils]: 7: Hoare triple {659#true} call #t~ret13 := main(); {659#true} is VALID [2020-07-10 20:21:42,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {659#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {659#true} is VALID [2020-07-10 20:21:42,124 INFO L280 TraceCheckUtils]: 9: Hoare triple {659#true} ~N~0 := #t~nondet0; {659#true} is VALID [2020-07-10 20:21:42,124 INFO L280 TraceCheckUtils]: 10: Hoare triple {659#true} havoc #t~nondet0; {659#true} is VALID [2020-07-10 20:21:42,126 INFO L280 TraceCheckUtils]: 11: Hoare triple {659#true} assume !(~N~0 <= 0); {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,126 INFO L263 TraceCheckUtils]: 12: Hoare triple {667#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {659#true} is VALID [2020-07-10 20:21:42,127 INFO L280 TraceCheckUtils]: 13: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2020-07-10 20:21:42,127 INFO L280 TraceCheckUtils]: 14: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2020-07-10 20:21:42,127 INFO L280 TraceCheckUtils]: 15: Hoare triple {659#true} assume true; {659#true} is VALID [2020-07-10 20:21:42,129 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {659#true} {667#(<= 1 ~N~0)} #144#return; {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,130 INFO L280 TraceCheckUtils]: 17: Hoare triple {667#(<= 1 ~N~0)} havoc ~i~0; {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,131 INFO L280 TraceCheckUtils]: 18: Hoare triple {667#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,132 INFO L280 TraceCheckUtils]: 19: Hoare triple {667#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,133 INFO L280 TraceCheckUtils]: 20: Hoare triple {667#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,134 INFO L280 TraceCheckUtils]: 21: Hoare triple {667#(<= 1 ~N~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,135 INFO L280 TraceCheckUtils]: 22: Hoare triple {667#(<= 1 ~N~0)} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,137 INFO L280 TraceCheckUtils]: 23: Hoare triple {667#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {667#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:42,138 INFO L280 TraceCheckUtils]: 24: Hoare triple {667#(<= 1 ~N~0)} ~i~0 := 0; {672#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:42,139 INFO L280 TraceCheckUtils]: 25: Hoare triple {672#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {660#false} is VALID [2020-07-10 20:21:42,140 INFO L280 TraceCheckUtils]: 26: Hoare triple {660#false} ~i~0 := 0; {660#false} is VALID [2020-07-10 20:21:42,140 INFO L280 TraceCheckUtils]: 27: Hoare triple {660#false} assume !(~i~0 < ~N~0); {660#false} is VALID [2020-07-10 20:21:42,141 INFO L280 TraceCheckUtils]: 28: Hoare triple {660#false} ~i~0 := 0; {660#false} is VALID [2020-07-10 20:21:42,141 INFO L280 TraceCheckUtils]: 29: Hoare triple {660#false} assume !(~i~0 < ~N~0); {660#false} is VALID [2020-07-10 20:21:42,141 INFO L280 TraceCheckUtils]: 30: Hoare triple {660#false} ~i~0 := 0; {660#false} is VALID [2020-07-10 20:21:42,142 INFO L280 TraceCheckUtils]: 31: Hoare triple {660#false} assume !(~i~0 < ~N~0); {660#false} is VALID [2020-07-10 20:21:42,142 INFO L280 TraceCheckUtils]: 32: Hoare triple {660#false} ~i~0 := 0; {660#false} is VALID [2020-07-10 20:21:42,143 INFO L280 TraceCheckUtils]: 33: Hoare triple {660#false} assume !!(~i~0 < ~N~0); {660#false} is VALID [2020-07-10 20:21:42,143 INFO L280 TraceCheckUtils]: 34: Hoare triple {660#false} SUMMARY for call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L53 {660#false} is VALID [2020-07-10 20:21:42,144 INFO L263 TraceCheckUtils]: 35: Hoare triple {660#false} call __VERIFIER_assert((if #t~mem12 == 1 + ~N~0 then 1 else 0)); {660#false} is VALID [2020-07-10 20:21:42,144 INFO L280 TraceCheckUtils]: 36: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2020-07-10 20:21:42,144 INFO L280 TraceCheckUtils]: 37: Hoare triple {660#false} assume 0 == ~cond; {660#false} is VALID [2020-07-10 20:21:42,145 INFO L280 TraceCheckUtils]: 38: Hoare triple {660#false} assume !false; {660#false} is VALID [2020-07-10 20:21:42,150 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 20:21:42,150 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:42,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [370393822] [2020-07-10 20:21:42,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:42,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:42,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174763998] [2020-07-10 20:21:42,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-10 20:21:42,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:42,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:42,221 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 20:21:42,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:42,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:42,223 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2020-07-10 20:21:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:42,898 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2020-07-10 20:21:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:42,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-10 20:21:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2020-07-10 20:21:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2020-07-10 20:21:42,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 152 transitions. [2020-07-10 20:21:43,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:43,114 INFO L225 Difference]: With dead ends: 140 [2020-07-10 20:21:43,115 INFO L226 Difference]: Without dead ends: 100 [2020-07-10 20:21:43,117 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 20:21:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-10 20:21:43,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 74. [2020-07-10 20:21:43,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:43,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 74 states. [2020-07-10 20:21:43,230 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 74 states. [2020-07-10 20:21:43,231 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 74 states. [2020-07-10 20:21:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:43,239 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2020-07-10 20:21:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2020-07-10 20:21:43,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:43,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:43,241 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 100 states. [2020-07-10 20:21:43,241 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 100 states. [2020-07-10 20:21:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:43,248 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2020-07-10 20:21:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2020-07-10 20:21:43,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:43,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:43,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:43,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-10 20:21:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2020-07-10 20:21:43,254 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 39 [2020-07-10 20:21:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:43,254 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2020-07-10 20:21:43,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:43,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 78 transitions. [2020-07-10 20:21:43,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2020-07-10 20:21:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-10 20:21:43,359 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:43,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:43,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:43,359 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:43,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1675406230, now seen corresponding path program 1 times [2020-07-10 20:21:43,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:43,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2004993227] [2020-07-10 20:21:43,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:43,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:43,396 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:21:43,405 INFO L168 Benchmark]: Toolchain (without parser) took 3987.72 ms. Allocated memory was 145.8 MB in the beginning and 246.9 MB in the end (delta: 101.2 MB). Free memory was 103.2 MB in the beginning and 168.8 MB in the end (delta: -65.6 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:43,406 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 145.8 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:43,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.20 ms. Allocated memory is still 145.8 MB. Free memory was 103.0 MB in the beginning and 91.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:43,408 INFO L168 Benchmark]: Boogie Preprocessor took 147.89 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 91.6 MB in the beginning and 179.8 MB in the end (delta: -88.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:43,410 INFO L168 Benchmark]: RCFGBuilder took 564.20 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 145.7 MB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:43,411 INFO L168 Benchmark]: TraceAbstraction took 2952.10 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 145.0 MB in the beginning and 168.8 MB in the end (delta: -23.8 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:43,420 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.95 ms. Allocated memory is still 145.8 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 317.20 ms. Allocated memory is still 145.8 MB. Free memory was 103.0 MB in the beginning and 91.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.89 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 91.6 MB in the beginning and 179.8 MB in the end (delta: -88.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 564.20 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 145.7 MB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2952.10 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 145.0 MB in the beginning and 168.8 MB in the end (delta: -23.8 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...