/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/ms5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:36:26,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:36:26,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:36:26,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:36:26,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:36:26,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:36:26,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:36:26,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:36:26,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:36:26,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:36:26,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:36:26,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:36:26,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:36:26,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:36:26,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:36:26,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:36:26,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:36:26,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:36:26,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:36:26,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:36:26,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:36:26,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:36:26,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:36:26,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:36:26,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:36:26,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:36:26,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:36:26,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:36:26,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:36:26,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:36:26,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:36:26,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:36:26,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:36:26,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:36:26,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:36:26,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:36:26,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:36:26,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:36:26,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:36:26,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:36:26,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:36:26,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:36:26,399 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:36:26,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:36:26,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:36:26,402 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:36:26,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:36:26,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:36:26,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:36:26,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:36:26,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:36:26,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:36:26,403 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:36:26,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:36:26,405 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:36:26,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:36:26,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:36:26,406 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:36:26,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:36:26,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:36:26,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:36:26,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:36:26,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:36:26,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:36:26,407 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:36:26,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:36:26,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:36:26,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:36:26,707 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:36:26,707 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:36:26,708 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ms5f.c [2020-07-08 17:36:26,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210e77983/1c8fc359377d48bfbc755f0149bc21f6/FLAG26e26057d [2020-07-08 17:36:27,204 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:36:27,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms5f.c [2020-07-08 17:36:27,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210e77983/1c8fc359377d48bfbc755f0149bc21f6/FLAG26e26057d [2020-07-08 17:36:27,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210e77983/1c8fc359377d48bfbc755f0149bc21f6 [2020-07-08 17:36:27,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:36:27,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:36:27,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:36:27,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:36:27,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:36:27,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:36:27" (1/1) ... [2020-07-08 17:36:27,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3377739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27, skipping insertion in model container [2020-07-08 17:36:27,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:36:27" (1/1) ... [2020-07-08 17:36:27,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:36:27,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:36:27,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:36:27,892 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:36:27,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:36:27,931 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:36:27,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27 WrapperNode [2020-07-08 17:36:27,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:36:27,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:36:27,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:36:27,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:36:28,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27" (1/1) ... [2020-07-08 17:36:28,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27" (1/1) ... [2020-07-08 17:36:28,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27" (1/1) ... [2020-07-08 17:36:28,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27" (1/1) ... [2020-07-08 17:36:28,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27" (1/1) ... [2020-07-08 17:36:28,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27" (1/1) ... [2020-07-08 17:36:28,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27" (1/1) ... [2020-07-08 17:36:28,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:36:28,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:36:28,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:36:28,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:36:28,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27" (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-08 17:36:28,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:36:28,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:36:28,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:36:28,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:36:28,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:36:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:36:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:36:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:36:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:36:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:36:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 17:36:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:36:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 17:36:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 17:36:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 17:36:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 17:36:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 17:36:28,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:36:28,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:36:28,561 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:36:28,561 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 17:36:28,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:36:28 BoogieIcfgContainer [2020-07-08 17:36:28,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:36:28,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:36:28,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:36:28,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:36:28,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:36:27" (1/3) ... [2020-07-08 17:36:28,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af39533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:36:28, skipping insertion in model container [2020-07-08 17:36:28,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:27" (2/3) ... [2020-07-08 17:36:28,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af39533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:36:28, skipping insertion in model container [2020-07-08 17:36:28,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:36:28" (3/3) ... [2020-07-08 17:36:28,573 INFO L109 eAbstractionObserver]: Analyzing ICFG ms5f.c [2020-07-08 17:36:28,584 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:36:28,591 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:36:28,605 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:36:28,623 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:36:28,623 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:36:28,624 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:36:28,624 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:36:28,624 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:36:28,624 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:36:28,624 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:36:28,624 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:36:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-07-08 17:36:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 17:36:28,646 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:28,646 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] [2020-07-08 17:36:28,647 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:28,651 INFO L82 PathProgramCache]: Analyzing trace with hash -845632023, now seen corresponding path program 1 times [2020-07-08 17:36:28,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:28,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1826532005] [2020-07-08 17:36:28,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:28,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {72#(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; {60#true} is VALID [2020-07-08 17:36:28,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#true} #valid := #valid[0 := 0]; {60#true} is VALID [2020-07-08 17:36:28,887 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} assume 0 < #StackHeapBarrier; {60#true} is VALID [2020-07-08 17:36:28,887 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#true} ~N~0 := 0; {60#true} is VALID [2020-07-08 17:36:28,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-08 17:36:28,888 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {60#true} {60#true} #97#return; {60#true} is VALID [2020-07-08 17:36:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:28,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {60#true} ~cond := #in~cond; {60#true} is VALID [2020-07-08 17:36:28,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#true} assume !(0 == ~cond); {60#true} is VALID [2020-07-08 17:36:28,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-08 17:36:28,899 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #93#return; {60#true} is VALID [2020-07-08 17:36:28,901 INFO L263 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {72#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:28,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {72#(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; {60#true} is VALID [2020-07-08 17:36:28,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} #valid := #valid[0 := 0]; {60#true} is VALID [2020-07-08 17:36:28,903 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#true} assume 0 < #StackHeapBarrier; {60#true} is VALID [2020-07-08 17:36:28,903 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#true} ~N~0 := 0; {60#true} is VALID [2020-07-08 17:36:28,903 INFO L280 TraceCheckUtils]: 5: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-08 17:36:28,904 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {60#true} {60#true} #97#return; {60#true} is VALID [2020-07-08 17:36:28,904 INFO L263 TraceCheckUtils]: 7: Hoare triple {60#true} call #t~ret7 := main(); {60#true} is VALID [2020-07-08 17:36:28,905 INFO L280 TraceCheckUtils]: 8: Hoare triple {60#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {60#true} is VALID [2020-07-08 17:36:28,905 INFO L280 TraceCheckUtils]: 9: Hoare triple {60#true} ~N~0 := #t~nondet0; {60#true} is VALID [2020-07-08 17:36:28,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {60#true} havoc #t~nondet0; {60#true} is VALID [2020-07-08 17:36:28,906 INFO L280 TraceCheckUtils]: 11: Hoare triple {60#true} assume !(~N~0 <= 0); {60#true} is VALID [2020-07-08 17:36:28,907 INFO L263 TraceCheckUtils]: 12: Hoare triple {60#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {60#true} is VALID [2020-07-08 17:36:28,907 INFO L280 TraceCheckUtils]: 13: Hoare triple {60#true} ~cond := #in~cond; {60#true} is VALID [2020-07-08 17:36:28,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {60#true} assume !(0 == ~cond); {60#true} is VALID [2020-07-08 17:36:28,908 INFO L280 TraceCheckUtils]: 15: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-08 17:36:28,908 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {60#true} {60#true} #93#return; {60#true} is VALID [2020-07-08 17:36:28,909 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#true} havoc ~i~0; {60#true} is VALID [2020-07-08 17:36:28,910 INFO L280 TraceCheckUtils]: 18: Hoare triple {60#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {60#true} is VALID [2020-07-08 17:36:28,910 INFO L280 TraceCheckUtils]: 19: Hoare triple {60#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {60#true} is VALID [2020-07-08 17:36:28,910 INFO L280 TraceCheckUtils]: 20: Hoare triple {60#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {60#true} is VALID [2020-07-08 17:36:28,911 INFO L280 TraceCheckUtils]: 21: Hoare triple {60#true} ~i~0 := 0; {60#true} is VALID [2020-07-08 17:36:28,912 INFO L280 TraceCheckUtils]: 22: Hoare triple {60#true} assume !true; {61#false} is VALID [2020-07-08 17:36:28,913 INFO L280 TraceCheckUtils]: 23: Hoare triple {61#false} ~i~0 := 0; {61#false} is VALID [2020-07-08 17:36:28,913 INFO L280 TraceCheckUtils]: 24: Hoare triple {61#false} assume !true; {61#false} is VALID [2020-07-08 17:36:28,914 INFO L280 TraceCheckUtils]: 25: Hoare triple {61#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L34-6 {61#false} is VALID [2020-07-08 17:36:28,914 INFO L263 TraceCheckUtils]: 26: Hoare triple {61#false} call __VERIFIER_assert((if #t~mem6 > 4 * ~N~0 then 1 else 0)); {61#false} is VALID [2020-07-08 17:36:28,915 INFO L280 TraceCheckUtils]: 27: Hoare triple {61#false} ~cond := #in~cond; {61#false} is VALID [2020-07-08 17:36:28,915 INFO L280 TraceCheckUtils]: 28: Hoare triple {61#false} assume 0 == ~cond; {61#false} is VALID [2020-07-08 17:36:28,916 INFO L280 TraceCheckUtils]: 29: Hoare triple {61#false} assume !false; {61#false} is VALID [2020-07-08 17:36:28,920 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-08 17:36:28,920 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:28,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1826532005] [2020-07-08 17:36:28,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:28,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 17:36:28,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036882061] [2020-07-08 17:36:28,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 17:36:28,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:28,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 17:36:28,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:28,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 17:36:28,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 17:36:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:36:29,011 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-07-08 17:36:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:29,351 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2020-07-08 17:36:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 17:36:29,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 17:36:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:36:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-08 17:36:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:36:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-08 17:36:29,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-08 17:36:29,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:29,527 INFO L225 Difference]: With dead ends: 97 [2020-07-08 17:36:29,527 INFO L226 Difference]: Without dead ends: 45 [2020-07-08 17:36:29,531 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-08 17:36:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-08 17:36:29,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-08 17:36:29,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:29,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2020-07-08 17:36:29,610 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-08 17:36:29,611 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-08 17:36:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:29,616 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-08 17:36:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-08 17:36:29,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:29,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:29,617 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-08 17:36:29,617 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-08 17:36:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:29,622 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-08 17:36:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-08 17:36:29,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:29,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:29,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:29,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 17:36:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2020-07-08 17:36:29,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 30 [2020-07-08 17:36:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:29,629 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2020-07-08 17:36:29,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 17:36:29,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2020-07-08 17:36:29,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-08 17:36:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 17:36:29,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:29,688 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] [2020-07-08 17:36:29,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:36:29,689 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash 104990277, now seen corresponding path program 1 times [2020-07-08 17:36:29,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:29,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911829951] [2020-07-08 17:36:29,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:29,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#(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; {449#true} is VALID [2020-07-08 17:36:29,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} #valid := #valid[0 := 0]; {449#true} is VALID [2020-07-08 17:36:29,814 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume 0 < #StackHeapBarrier; {449#true} is VALID [2020-07-08 17:36:29,814 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#true} ~N~0 := 0; {449#true} is VALID [2020-07-08 17:36:29,815 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-08 17:36:29,815 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {449#true} {449#true} #97#return; {449#true} is VALID [2020-07-08 17:36:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:29,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-08 17:36:29,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-08 17:36:29,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-08 17:36:29,831 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {449#true} {457#(<= 1 ~N~0)} #93#return; {457#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:29,832 INFO L263 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {463#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:29,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#(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; {449#true} is VALID [2020-07-08 17:36:29,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} #valid := #valid[0 := 0]; {449#true} is VALID [2020-07-08 17:36:29,833 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#true} assume 0 < #StackHeapBarrier; {449#true} is VALID [2020-07-08 17:36:29,833 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} ~N~0 := 0; {449#true} is VALID [2020-07-08 17:36:29,834 INFO L280 TraceCheckUtils]: 5: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-08 17:36:29,834 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {449#true} {449#true} #97#return; {449#true} is VALID [2020-07-08 17:36:29,834 INFO L263 TraceCheckUtils]: 7: Hoare triple {449#true} call #t~ret7 := main(); {449#true} is VALID [2020-07-08 17:36:29,835 INFO L280 TraceCheckUtils]: 8: Hoare triple {449#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {449#true} is VALID [2020-07-08 17:36:29,835 INFO L280 TraceCheckUtils]: 9: Hoare triple {449#true} ~N~0 := #t~nondet0; {449#true} is VALID [2020-07-08 17:36:29,836 INFO L280 TraceCheckUtils]: 10: Hoare triple {449#true} havoc #t~nondet0; {449#true} is VALID [2020-07-08 17:36:29,837 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#true} assume !(~N~0 <= 0); {457#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:29,837 INFO L263 TraceCheckUtils]: 12: Hoare triple {457#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {449#true} is VALID [2020-07-08 17:36:29,837 INFO L280 TraceCheckUtils]: 13: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-08 17:36:29,838 INFO L280 TraceCheckUtils]: 14: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-08 17:36:29,838 INFO L280 TraceCheckUtils]: 15: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-08 17:36:29,839 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {449#true} {457#(<= 1 ~N~0)} #93#return; {457#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:29,840 INFO L280 TraceCheckUtils]: 17: Hoare triple {457#(<= 1 ~N~0)} havoc ~i~0; {457#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:29,840 INFO L280 TraceCheckUtils]: 18: Hoare triple {457#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {457#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:29,841 INFO L280 TraceCheckUtils]: 19: Hoare triple {457#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {457#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:29,842 INFO L280 TraceCheckUtils]: 20: Hoare triple {457#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {457#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:29,843 INFO L280 TraceCheckUtils]: 21: Hoare triple {457#(<= 1 ~N~0)} ~i~0 := 0; {462#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 17:36:29,844 INFO L280 TraceCheckUtils]: 22: Hoare triple {462#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {450#false} is VALID [2020-07-08 17:36:29,844 INFO L280 TraceCheckUtils]: 23: Hoare triple {450#false} ~i~0 := 0; {450#false} is VALID [2020-07-08 17:36:29,845 INFO L280 TraceCheckUtils]: 24: Hoare triple {450#false} assume !(~i~0 < ~N~0); {450#false} is VALID [2020-07-08 17:36:29,845 INFO L280 TraceCheckUtils]: 25: Hoare triple {450#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L34-6 {450#false} is VALID [2020-07-08 17:36:29,845 INFO L263 TraceCheckUtils]: 26: Hoare triple {450#false} call __VERIFIER_assert((if #t~mem6 > 4 * ~N~0 then 1 else 0)); {450#false} is VALID [2020-07-08 17:36:29,846 INFO L280 TraceCheckUtils]: 27: Hoare triple {450#false} ~cond := #in~cond; {450#false} is VALID [2020-07-08 17:36:29,846 INFO L280 TraceCheckUtils]: 28: Hoare triple {450#false} assume 0 == ~cond; {450#false} is VALID [2020-07-08 17:36:29,846 INFO L280 TraceCheckUtils]: 29: Hoare triple {450#false} assume !false; {450#false} is VALID [2020-07-08 17:36:29,848 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-08 17:36:29,849 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:29,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [911829951] [2020-07-08 17:36:29,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:29,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:36:29,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567761218] [2020-07-08 17:36:29,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-08 17:36:29,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:29,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:36:29,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:29,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:36:29,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:29,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:36:29,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:36:29,891 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 5 states. [2020-07-08 17:36:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:30,271 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-08 17:36:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:36:30,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-08 17:36:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-08 17:36:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-08 17:36:30,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2020-07-08 17:36:30,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:30,365 INFO L225 Difference]: With dead ends: 71 [2020-07-08 17:36:30,365 INFO L226 Difference]: Without dead ends: 53 [2020-07-08 17:36:30,367 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-08 17:36:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-08 17:36:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2020-07-08 17:36:30,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:30,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 48 states. [2020-07-08 17:36:30,444 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 48 states. [2020-07-08 17:36:30,444 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 48 states. [2020-07-08 17:36:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:30,447 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-08 17:36:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-08 17:36:30,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:30,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:30,449 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 53 states. [2020-07-08 17:36:30,449 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 53 states. [2020-07-08 17:36:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:30,452 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-08 17:36:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-08 17:36:30,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:30,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:30,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:30,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-08 17:36:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2020-07-08 17:36:30,457 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 30 [2020-07-08 17:36:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:30,457 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2020-07-08 17:36:30,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:36:30,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 50 transitions. [2020-07-08 17:36:30,516 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-08 17:36:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-07-08 17:36:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 17:36:30,518 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:30,518 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] [2020-07-08 17:36:30,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:36:30,519 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:30,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1687643347, now seen corresponding path program 1 times [2020-07-08 17:36:30,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:30,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [142574816] [2020-07-08 17:36:30,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:30,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:36:30,550 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-08 17:36:30,556 INFO L168 Benchmark]: Toolchain (without parser) took 2892.94 ms. Allocated memory was 138.4 MB in the beginning and 246.9 MB in the end (delta: 108.5 MB). Free memory was 103.4 MB in the beginning and 168.6 MB in the end (delta: -65.2 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:30,557 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 17:36:30,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.80 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 92.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:30,558 INFO L168 Benchmark]: Boogie Preprocessor took 137.84 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.3 MB in the beginning and 179.9 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:30,559 INFO L168 Benchmark]: RCFGBuilder took 494.84 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 152.5 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:30,560 INFO L168 Benchmark]: TraceAbstraction took 1985.86 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 152.5 MB in the beginning and 168.6 MB in the end (delta: -16.2 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:30,564 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.24 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 265.80 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 92.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.84 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.3 MB in the beginning and 179.9 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 494.84 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 152.5 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1985.86 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 152.5 MB in the beginning and 168.6 MB in the end (delta: -16.2 MB). Peak memory consumption was 28.4 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...