/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/brs2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:20:48,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:20:48,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:20:48,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:20:48,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:20:48,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:20:48,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:20:48,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:20:48,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:20:48,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:20:48,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:20:48,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:20:48,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:20:48,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:20:48,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:20:48,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:20:48,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:20:48,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:20:48,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:20:48,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:20:48,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:20:48,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:20:48,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:20:48,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:20:48,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:20:48,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:20:48,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:20:48,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:20:48,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:20:48,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:20:48,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:20:48,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:20:48,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:20:48,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:20:48,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:20:48,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:20:48,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:20:48,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:20:48,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:20:48,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:20:48,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:20:48,731 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:20:48,746 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:20:48,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:20:48,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:20:48,749 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:20:48,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:20:48,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:20:48,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:20:48,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:20:48,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:20:48,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:20:48,752 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:20:48,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:20:48,752 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:20:48,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:20:48,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:20:48,753 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:20:48,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:20:48,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:20:48,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:48,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:20:48,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:20:48,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:20:48,755 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:20:49,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:20:49,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:20:49,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:20:49,067 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:20:49,067 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:20:49,068 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs2f.c [2020-07-10 20:20:49,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75dfa1a9/4fef5cc0a417468db812693c48f0219d/FLAGe498ee1d7 [2020-07-10 20:20:49,688 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:20:49,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2f.c [2020-07-10 20:20:49,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75dfa1a9/4fef5cc0a417468db812693c48f0219d/FLAGe498ee1d7 [2020-07-10 20:20:50,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75dfa1a9/4fef5cc0a417468db812693c48f0219d [2020-07-10 20:20:50,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:20:50,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:20:50,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:50,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:20:50,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:20:50,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:50" (1/1) ... [2020-07-10 20:20:50,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc26102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50, skipping insertion in model container [2020-07-10 20:20:50,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:50" (1/1) ... [2020-07-10 20:20:50,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:20:50,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:20:50,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:50,359 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:20:50,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:50,406 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:20:50,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50 WrapperNode [2020-07-10 20:20:50,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:50,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:20:50,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:20:50,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:20:50,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50" (1/1) ... [2020-07-10 20:20:50,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50" (1/1) ... [2020-07-10 20:20:50,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50" (1/1) ... [2020-07-10 20:20:50,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50" (1/1) ... [2020-07-10 20:20:50,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50" (1/1) ... [2020-07-10 20:20:50,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50" (1/1) ... [2020-07-10 20:20:50,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50" (1/1) ... [2020-07-10 20:20:50,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:20:50,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:20:50,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:20:50,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:20:50,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50" (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:20:50,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:20:50,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:20:50,627 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:20:50,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:20:50,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:20:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:20:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:20:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:20:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:20:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:20:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:20:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:20:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:20:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:20:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:20:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:20:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:20:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:20:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:20:51,076 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:20:51,076 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 20:20:51,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:51 BoogieIcfgContainer [2020-07-10 20:20:51,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:20:51,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:20:51,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:20:51,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:20:51,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:20:50" (1/3) ... [2020-07-10 20:20:51,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f9d4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:51, skipping insertion in model container [2020-07-10 20:20:51,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:50" (2/3) ... [2020-07-10 20:20:51,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f9d4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:51, skipping insertion in model container [2020-07-10 20:20:51,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:51" (3/3) ... [2020-07-10 20:20:51,091 INFO L109 eAbstractionObserver]: Analyzing ICFG brs2f.c [2020-07-10 20:20:51,102 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:20:51,111 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:20:51,126 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:20:51,149 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:20:51,150 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:20:51,150 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:20:51,150 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:20:51,150 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:20:51,151 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:20:51,151 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:20:51,151 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:20:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-10 20:20:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 20:20:51,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:51,177 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-10 20:20:51,178 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:51,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash 221259408, now seen corresponding path program 1 times [2020-07-10 20:20:51,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:51,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [493946747] [2020-07-10 20:20:51,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:51,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(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; {62#true} is VALID [2020-07-10 20:20:51,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-10 20:20:51,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-10 20:20:51,422 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-10 20:20:51,423 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:51,423 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-10 20:20:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:51,435 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-10 20:20:51,436 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-10 20:20:51,436 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:51,437 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-10 20:20:51,439 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {74#(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:20:51,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(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; {62#true} is VALID [2020-07-10 20:20:51,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-10 20:20:51,441 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-10 20:20:51,441 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-10 20:20:51,441 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:51,442 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-10 20:20:51,442 INFO L263 TraceCheckUtils]: 7: Hoare triple {62#true} call #t~ret7 := main(); {62#true} is VALID [2020-07-10 20:20:51,443 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {62#true} is VALID [2020-07-10 20:20:51,443 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#true} ~N~0 := #t~nondet0; {62#true} is VALID [2020-07-10 20:20:51,444 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#true} havoc #t~nondet0; {62#true} is VALID [2020-07-10 20:20:51,444 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#true} assume !(~N~0 <= 0); {62#true} is VALID [2020-07-10 20:20:51,445 INFO L263 TraceCheckUtils]: 12: Hoare triple {62#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {62#true} is VALID [2020-07-10 20:20:51,445 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-10 20:20:51,445 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-10 20:20:51,446 INFO L280 TraceCheckUtils]: 15: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:51,446 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-10 20:20:51,447 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#true} havoc ~i~0; {62#true} is VALID [2020-07-10 20:20:51,447 INFO L280 TraceCheckUtils]: 18: Hoare triple {62#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {62#true} is VALID [2020-07-10 20:20:51,448 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {62#true} is VALID [2020-07-10 20:20:51,448 INFO L280 TraceCheckUtils]: 20: Hoare triple {62#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {62#true} is VALID [2020-07-10 20:20:51,448 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#true} ~i~0 := 0; {62#true} is VALID [2020-07-10 20:20:51,450 INFO L280 TraceCheckUtils]: 22: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-10 20:20:51,450 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-10 20:20:51,451 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(~i~0 < ~N~0); {63#false} is VALID [2020-07-10 20:20:51,451 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {63#false} is VALID [2020-07-10 20:20:51,452 INFO L263 TraceCheckUtils]: 26: Hoare triple {63#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {63#false} is VALID [2020-07-10 20:20:51,452 INFO L280 TraceCheckUtils]: 27: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2020-07-10 20:20:51,453 INFO L280 TraceCheckUtils]: 28: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2020-07-10 20:20:51,453 INFO L280 TraceCheckUtils]: 29: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-10 20:20:51,458 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:20:51,458 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:51,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [493946747] [2020-07-10 20:20:51,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:51,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:20:51,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436394502] [2020-07-10 20:20:51,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 20:20:51,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:51,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:20:51,536 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-10 20:20:51,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:20:51,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:51,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:20:51,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:20:51,549 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-10 20:20:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:51,956 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-07-10 20:20:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:20:51,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 20:20:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-10 20:20:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-10 20:20:51,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2020-07-10 20:20:52,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:52,150 INFO L225 Difference]: With dead ends: 101 [2020-07-10 20:20:52,151 INFO L226 Difference]: Without dead ends: 47 [2020-07-10 20:20:52,155 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:20:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-10 20:20:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-10 20:20:52,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:52,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-10 20:20:52,251 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-10 20:20:52,252 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-10 20:20:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:52,258 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-10 20:20:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-10 20:20:52,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:52,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:52,259 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-10 20:20:52,259 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-10 20:20:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:52,265 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-10 20:20:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-10 20:20:52,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:52,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:52,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:52,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 20:20:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-10 20:20:52,272 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 30 [2020-07-10 20:20:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:52,273 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-10 20:20:52,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:20:52,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2020-07-10 20:20:52,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-10 20:20:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 20:20:52,341 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:52,341 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-10 20:20:52,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:20:52,342 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash -151091841, now seen corresponding path program 1 times [2020-07-10 20:20:52,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:52,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045942431] [2020-07-10 20:20:52,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:52,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#(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; {467#true} is VALID [2020-07-10 20:20:52,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-10 20:20:52,543 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-10 20:20:52,543 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-10 20:20:52,544 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-10 20:20:52,544 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-10 20:20:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:52,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-10 20:20:52,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-10 20:20:52,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-10 20:20:52,555 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:52,557 INFO L263 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {481#(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:20:52,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#(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; {467#true} is VALID [2020-07-10 20:20:52,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-10 20:20:52,558 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-10 20:20:52,558 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-10 20:20:52,558 INFO L280 TraceCheckUtils]: 5: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-10 20:20:52,559 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-10 20:20:52,559 INFO L263 TraceCheckUtils]: 7: Hoare triple {467#true} call #t~ret7 := main(); {467#true} is VALID [2020-07-10 20:20:52,559 INFO L280 TraceCheckUtils]: 8: Hoare triple {467#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {467#true} is VALID [2020-07-10 20:20:52,560 INFO L280 TraceCheckUtils]: 9: Hoare triple {467#true} ~N~0 := #t~nondet0; {467#true} is VALID [2020-07-10 20:20:52,560 INFO L280 TraceCheckUtils]: 10: Hoare triple {467#true} havoc #t~nondet0; {467#true} is VALID [2020-07-10 20:20:52,562 INFO L280 TraceCheckUtils]: 11: Hoare triple {467#true} assume !(~N~0 <= 0); {475#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:52,562 INFO L263 TraceCheckUtils]: 12: Hoare triple {475#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {467#true} is VALID [2020-07-10 20:20:52,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-10 20:20:52,563 INFO L280 TraceCheckUtils]: 14: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-10 20:20:52,563 INFO L280 TraceCheckUtils]: 15: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-10 20:20:52,564 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:52,566 INFO L280 TraceCheckUtils]: 17: Hoare triple {475#(<= 1 ~N~0)} havoc ~i~0; {475#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:52,567 INFO L280 TraceCheckUtils]: 18: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {475#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:52,568 INFO L280 TraceCheckUtils]: 19: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {475#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:52,569 INFO L280 TraceCheckUtils]: 20: Hoare triple {475#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {475#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:52,571 INFO L280 TraceCheckUtils]: 21: Hoare triple {475#(<= 1 ~N~0)} ~i~0 := 0; {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:20:52,572 INFO L280 TraceCheckUtils]: 22: Hoare triple {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-10 20:20:52,572 INFO L280 TraceCheckUtils]: 23: Hoare triple {468#false} ~i~0 := 0; {468#false} is VALID [2020-07-10 20:20:52,573 INFO L280 TraceCheckUtils]: 24: Hoare triple {468#false} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-10 20:20:52,573 INFO L280 TraceCheckUtils]: 25: Hoare triple {468#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {468#false} is VALID [2020-07-10 20:20:52,574 INFO L263 TraceCheckUtils]: 26: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {468#false} is VALID [2020-07-10 20:20:52,574 INFO L280 TraceCheckUtils]: 27: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2020-07-10 20:20:52,574 INFO L280 TraceCheckUtils]: 28: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2020-07-10 20:20:52,575 INFO L280 TraceCheckUtils]: 29: Hoare triple {468#false} assume !false; {468#false} is VALID [2020-07-10 20:20:52,577 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:20:52,577 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:52,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045942431] [2020-07-10 20:20:52,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:52,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:20:52,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245900519] [2020-07-10 20:20:52,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 20:20:52,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:52,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:20:52,623 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-10 20:20:52,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:20:52,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:52,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:20:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:20:52,625 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2020-07-10 20:20:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:53,090 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2020-07-10 20:20:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:20:53,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 20:20:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-10 20:20:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-10 20:20:53,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2020-07-10 20:20:53,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:53,218 INFO L225 Difference]: With dead ends: 81 [2020-07-10 20:20:53,218 INFO L226 Difference]: Without dead ends: 56 [2020-07-10 20:20:53,220 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:20:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-10 20:20:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2020-07-10 20:20:53,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:53,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 51 states. [2020-07-10 20:20:53,321 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 51 states. [2020-07-10 20:20:53,321 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 51 states. [2020-07-10 20:20:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:53,329 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-10 20:20:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-10 20:20:53,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:53,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:53,331 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 56 states. [2020-07-10 20:20:53,332 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 56 states. [2020-07-10 20:20:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:53,335 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-10 20:20:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-10 20:20:53,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:53,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:53,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:53,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 20:20:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-07-10 20:20:53,347 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 30 [2020-07-10 20:20:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:53,347 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-07-10 20:20:53,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:20:53,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2020-07-10 20:20:53,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-10 20:20:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 20:20:53,423 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:53,423 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] [2020-07-10 20:20:53,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:20:53,423 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:53,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1707000309, now seen corresponding path program 1 times [2020-07-10 20:20:53,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:53,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1814496604] [2020-07-10 20:20:53,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:53,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:20:53,459 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:20:53,466 INFO L168 Benchmark]: Toolchain (without parser) took 3395.71 ms. Allocated memory was 138.9 MB in the beginning and 245.9 MB in the end (delta: 107.0 MB). Free memory was 102.2 MB in the beginning and 151.9 MB in the end (delta: -49.7 MB). Peak memory consumption was 57.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:53,467 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:20:53,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.99 ms. Allocated memory is still 138.9 MB. Free memory was 102.2 MB in the beginning and 91.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:53,469 INFO L168 Benchmark]: Boogie Preprocessor took 147.52 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 91.2 MB in the beginning and 181.4 MB in the end (delta: -90.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:53,470 INFO L168 Benchmark]: RCFGBuilder took 526.18 ms. Allocated memory is still 203.4 MB. Free memory was 181.4 MB in the beginning and 153.3 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:53,471 INFO L168 Benchmark]: TraceAbstraction took 2380.25 ms. Allocated memory was 203.4 MB in the beginning and 245.9 MB in the end (delta: 42.5 MB). Free memory was 152.4 MB in the beginning and 151.9 MB in the end (delta: 445.3 kB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:53,475 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.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 335.99 ms. Allocated memory is still 138.9 MB. Free memory was 102.2 MB in the beginning and 91.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.52 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 91.2 MB in the beginning and 181.4 MB in the end (delta: -90.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.18 ms. Allocated memory is still 203.4 MB. Free memory was 181.4 MB in the beginning and 153.3 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2380.25 ms. Allocated memory was 203.4 MB in the beginning and 245.9 MB in the end (delta: 42.5 MB). Free memory was 152.4 MB in the beginning and 151.9 MB in the end (delta: 445.3 kB). Peak memory consumption was 42.9 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...