/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/brs1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:20:46,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:20:46,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:20:46,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:20:46,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:20:46,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:20:46,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:20:46,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:20:46,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:20:46,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:20:46,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:20:46,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:20:46,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:20:46,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:20:46,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:20:46,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:20:46,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:20:46,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:20:46,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:20:46,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:20:46,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:20:46,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:20:46,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:20:46,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:20:46,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:20:46,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:20:46,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:20:46,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:20:46,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:20:46,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:20:46,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:20:46,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:20:46,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:20:46,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:20:46,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:20:46,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:20:46,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:20:46,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:20:46,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:20:46,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:20:46,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:20:46,414 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:46,423 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:20:46,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:20:46,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:20:46,425 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:20:46,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:20:46,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:20:46,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:20:46,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:20:46,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:20:46,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:20:46,426 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:20:46,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:20:46,427 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:20:46,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:20:46,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:20:46,427 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:20:46,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:20:46,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:20:46,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:46,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:20:46,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:20:46,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:20:46,429 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:20:46,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:20:46,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:20:46,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:20:46,727 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:20:46,728 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:20:46,729 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs1f.c [2020-07-10 20:20:46,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09ca2cf2/8081ad50131947deadb7d981a20de024/FLAGebc5b349b [2020-07-10 20:20:47,231 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:20:47,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs1f.c [2020-07-10 20:20:47,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09ca2cf2/8081ad50131947deadb7d981a20de024/FLAGebc5b349b [2020-07-10 20:20:47,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09ca2cf2/8081ad50131947deadb7d981a20de024 [2020-07-10 20:20:47,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:20:47,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:20:47,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:47,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:20:47,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:20:47,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:47" (1/1) ... [2020-07-10 20:20:47,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68df813b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:47, skipping insertion in model container [2020-07-10 20:20:47,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:47" (1/1) ... [2020-07-10 20:20:47,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:20:47,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:20:47,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:47,943 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:20:47,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:47,991 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:20:47,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:47 WrapperNode [2020-07-10 20:20:47,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:47,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:20:47,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:20:47,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:20:48,092 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:47" (1/1) ... [2020-07-10 20:20:48,092 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:47" (1/1) ... [2020-07-10 20:20:48,102 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:47" (1/1) ... [2020-07-10 20:20:48,102 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:47" (1/1) ... [2020-07-10 20:20:48,114 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:47" (1/1) ... [2020-07-10 20:20:48,121 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:47" (1/1) ... [2020-07-10 20:20:48,123 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:47" (1/1) ... [2020-07-10 20:20:48,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:20:48,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:20:48,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:20:48,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:20:48,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:47" (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:48,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:20:48,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:20:48,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:20:48,193 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:20:48,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:20:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:20:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:20:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:20:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:20:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:20:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:20:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:20:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:20:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:20:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:20:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:20:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:20:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:20:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:20:48,642 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:20:48,642 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 20:20:48,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:48 BoogieIcfgContainer [2020-07-10 20:20:48,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:20:48,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:20:48,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:20:48,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:20:48,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:20:47" (1/3) ... [2020-07-10 20:20:48,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c27f64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:48, skipping insertion in model container [2020-07-10 20:20:48,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:47" (2/3) ... [2020-07-10 20:20:48,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c27f64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:48, skipping insertion in model container [2020-07-10 20:20:48,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:48" (3/3) ... [2020-07-10 20:20:48,655 INFO L109 eAbstractionObserver]: Analyzing ICFG brs1f.c [2020-07-10 20:20:48,667 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:20:48,674 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:20:48,686 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:20:48,708 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:20:48,708 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:20:48,708 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:20:48,708 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:20:48,709 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:20:48,709 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:20:48,709 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:20:48,709 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:20:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-10 20:20:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 20:20:48,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:48,740 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:48,740 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 221259408, now seen corresponding path program 1 times [2020-07-10 20:20:48,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:48,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [62433632] [2020-07-10 20:20:48,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:49,061 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:49,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-10 20:20:49,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-10 20:20:49,065 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-10 20:20:49,066 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:49,067 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-10 20:20:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:49,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-10 20:20:49,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-10 20:20:49,102 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:49,102 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-10 20:20:49,108 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:49,108 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:49,109 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-10 20:20:49,110 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-10 20:20:49,110 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-10 20:20:49,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:49,112 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-10 20:20:49,113 INFO L263 TraceCheckUtils]: 7: Hoare triple {62#true} call #t~ret7 := main(); {62#true} is VALID [2020-07-10 20:20:49,113 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {62#true} is VALID [2020-07-10 20:20:49,116 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#true} ~N~0 := #t~nondet0; {62#true} is VALID [2020-07-10 20:20:49,117 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#true} havoc #t~nondet0; {62#true} is VALID [2020-07-10 20:20:49,118 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#true} assume !(~N~0 <= 0); {62#true} is VALID [2020-07-10 20:20:49,118 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:49,119 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-10 20:20:49,120 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-10 20:20:49,121 INFO L280 TraceCheckUtils]: 15: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 20:20:49,121 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-10 20:20:49,122 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#true} havoc ~i~0; {62#true} is VALID [2020-07-10 20:20:49,124 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:49,125 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:49,126 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:49,127 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#true} ~i~0 := 0; {62#true} is VALID [2020-07-10 20:20:49,128 INFO L280 TraceCheckUtils]: 22: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-10 20:20:49,129 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-10 20:20:49,129 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(~i~0 < ~N~0); {63#false} is VALID [2020-07-10 20:20:49,130 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:49,130 INFO L263 TraceCheckUtils]: 26: Hoare triple {63#false} call __VERIFIER_assert((if #t~mem6 <= ~N~0 then 1 else 0)); {63#false} is VALID [2020-07-10 20:20:49,131 INFO L280 TraceCheckUtils]: 27: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2020-07-10 20:20:49,131 INFO L280 TraceCheckUtils]: 28: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2020-07-10 20:20:49,132 INFO L280 TraceCheckUtils]: 29: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-10 20:20:49,139 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:49,144 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:49,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [62433632] [2020-07-10 20:20:49,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:49,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:20:49,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505362425] [2020-07-10 20:20:49,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 20:20:49,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:49,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:20:49,264 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:49,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:20:49,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:49,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:20:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:20:49,281 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-10 20:20:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,693 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2020-07-10 20:20:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:20:49,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 20:20:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2020-07-10 20:20:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2020-07-10 20:20:49,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2020-07-10 20:20:49,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:49,886 INFO L225 Difference]: With dead ends: 100 [2020-07-10 20:20:49,886 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 20:20:49,890 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:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 20:20:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-10 20:20:49,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:49,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2020-07-10 20:20:49,979 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-10 20:20:49,979 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-10 20:20:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,984 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-07-10 20:20:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-10 20:20:49,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:49,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:49,986 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-10 20:20:49,986 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-10 20:20:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,990 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-07-10 20:20:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-10 20:20:49,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:49,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:49,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:49,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 20:20:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-07-10 20:20:49,997 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 30 [2020-07-10 20:20:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:49,997 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-07-10 20:20:49,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:20:49,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 48 transitions. [2020-07-10 20:20:50,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-10 20:20:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 20:20:50,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:50,064 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:50,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:20:50,065 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:50,066 INFO L82 PathProgramCache]: Analyzing trace with hash -151091841, now seen corresponding path program 1 times [2020-07-10 20:20:50,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:50,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [723668735] [2020-07-10 20:20:50,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:50,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {475#(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; {461#true} is VALID [2020-07-10 20:20:50,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {461#true} #valid := #valid[0 := 0]; {461#true} is VALID [2020-07-10 20:20:50,215 INFO L280 TraceCheckUtils]: 2: Hoare triple {461#true} assume 0 < #StackHeapBarrier; {461#true} is VALID [2020-07-10 20:20:50,215 INFO L280 TraceCheckUtils]: 3: Hoare triple {461#true} ~N~0 := 0; {461#true} is VALID [2020-07-10 20:20:50,215 INFO L280 TraceCheckUtils]: 4: Hoare triple {461#true} assume true; {461#true} is VALID [2020-07-10 20:20:50,216 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {461#true} {461#true} #103#return; {461#true} is VALID [2020-07-10 20:20:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:50,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {461#true} ~cond := #in~cond; {461#true} is VALID [2020-07-10 20:20:50,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {461#true} assume !(0 == ~cond); {461#true} is VALID [2020-07-10 20:20:50,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {461#true} assume true; {461#true} is VALID [2020-07-10 20:20:50,228 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {461#true} {469#(<= 1 ~N~0)} #99#return; {469#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:50,230 INFO L263 TraceCheckUtils]: 0: Hoare triple {461#true} call ULTIMATE.init(); {475#(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:50,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {475#(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; {461#true} is VALID [2020-07-10 20:20:50,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {461#true} #valid := #valid[0 := 0]; {461#true} is VALID [2020-07-10 20:20:50,231 INFO L280 TraceCheckUtils]: 3: Hoare triple {461#true} assume 0 < #StackHeapBarrier; {461#true} is VALID [2020-07-10 20:20:50,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {461#true} ~N~0 := 0; {461#true} is VALID [2020-07-10 20:20:50,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {461#true} assume true; {461#true} is VALID [2020-07-10 20:20:50,232 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {461#true} {461#true} #103#return; {461#true} is VALID [2020-07-10 20:20:50,233 INFO L263 TraceCheckUtils]: 7: Hoare triple {461#true} call #t~ret7 := main(); {461#true} is VALID [2020-07-10 20:20:50,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {461#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {461#true} is VALID [2020-07-10 20:20:50,233 INFO L280 TraceCheckUtils]: 9: Hoare triple {461#true} ~N~0 := #t~nondet0; {461#true} is VALID [2020-07-10 20:20:50,234 INFO L280 TraceCheckUtils]: 10: Hoare triple {461#true} havoc #t~nondet0; {461#true} is VALID [2020-07-10 20:20:50,235 INFO L280 TraceCheckUtils]: 11: Hoare triple {461#true} assume !(~N~0 <= 0); {469#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:50,235 INFO L263 TraceCheckUtils]: 12: Hoare triple {469#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {461#true} is VALID [2020-07-10 20:20:50,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {461#true} ~cond := #in~cond; {461#true} is VALID [2020-07-10 20:20:50,236 INFO L280 TraceCheckUtils]: 14: Hoare triple {461#true} assume !(0 == ~cond); {461#true} is VALID [2020-07-10 20:20:50,236 INFO L280 TraceCheckUtils]: 15: Hoare triple {461#true} assume true; {461#true} is VALID [2020-07-10 20:20:50,237 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {461#true} {469#(<= 1 ~N~0)} #99#return; {469#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:50,239 INFO L280 TraceCheckUtils]: 17: Hoare triple {469#(<= 1 ~N~0)} havoc ~i~0; {469#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:50,240 INFO L280 TraceCheckUtils]: 18: Hoare triple {469#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {469#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:50,241 INFO L280 TraceCheckUtils]: 19: Hoare triple {469#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {469#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:50,242 INFO L280 TraceCheckUtils]: 20: Hoare triple {469#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {469#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:50,243 INFO L280 TraceCheckUtils]: 21: Hoare triple {469#(<= 1 ~N~0)} ~i~0 := 0; {474#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:20:50,245 INFO L280 TraceCheckUtils]: 22: Hoare triple {474#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {462#false} is VALID [2020-07-10 20:20:50,245 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#false} ~i~0 := 0; {462#false} is VALID [2020-07-10 20:20:50,246 INFO L280 TraceCheckUtils]: 24: Hoare triple {462#false} assume !(~i~0 < ~N~0); {462#false} is VALID [2020-07-10 20:20:50,246 INFO L280 TraceCheckUtils]: 25: Hoare triple {462#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {462#false} is VALID [2020-07-10 20:20:50,246 INFO L263 TraceCheckUtils]: 26: Hoare triple {462#false} call __VERIFIER_assert((if #t~mem6 <= ~N~0 then 1 else 0)); {462#false} is VALID [2020-07-10 20:20:50,247 INFO L280 TraceCheckUtils]: 27: Hoare triple {462#false} ~cond := #in~cond; {462#false} is VALID [2020-07-10 20:20:50,247 INFO L280 TraceCheckUtils]: 28: Hoare triple {462#false} assume 0 == ~cond; {462#false} is VALID [2020-07-10 20:20:50,247 INFO L280 TraceCheckUtils]: 29: Hoare triple {462#false} assume !false; {462#false} is VALID [2020-07-10 20:20:50,249 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:50,250 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:50,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [723668735] [2020-07-10 20:20:50,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:50,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:20:50,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570689580] [2020-07-10 20:20:50,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 20:20:50,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:50,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:20:50,299 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:50,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:20:50,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:50,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:20:50,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:20:50,301 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 5 states. [2020-07-10 20:20:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:50,753 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2020-07-10 20:20:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:20:50,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 20:20:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-10 20:20:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-10 20:20:50,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-10 20:20:50,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:50,871 INFO L225 Difference]: With dead ends: 73 [2020-07-10 20:20:50,871 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 20:20:50,872 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:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 20:20:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2020-07-10 20:20:50,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:50,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 49 states. [2020-07-10 20:20:50,961 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 49 states. [2020-07-10 20:20:50,961 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 49 states. [2020-07-10 20:20:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:50,965 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-10 20:20:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-10 20:20:50,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:50,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:50,967 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 55 states. [2020-07-10 20:20:50,967 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 55 states. [2020-07-10 20:20:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:50,970 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-10 20:20:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-10 20:20:50,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:50,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:50,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:50,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 20:20:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-10 20:20:50,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 30 [2020-07-10 20:20:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:50,975 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-10 20:20:50,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:20:50,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2020-07-10 20:20:51,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-10 20:20:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 20:20:51,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:51,047 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:51,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:20:51,048 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1707000309, now seen corresponding path program 1 times [2020-07-10 20:20:51,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:51,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461470957] [2020-07-10 20:20:51,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:51,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:20:51,087 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:51,093 INFO L168 Benchmark]: Toolchain (without parser) took 3394.56 ms. Allocated memory was 135.8 MB in the beginning and 251.7 MB in the end (delta: 115.9 MB). Free memory was 100.8 MB in the beginning and 172.0 MB in the end (delta: -71.2 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:51,094 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:20:51,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.86 ms. Allocated memory is still 135.8 MB. Free memory was 100.6 MB in the beginning and 89.6 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:51,096 INFO L168 Benchmark]: Boogie Preprocessor took 133.18 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 89.6 MB in the beginning and 177.1 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:51,097 INFO L168 Benchmark]: RCFGBuilder took 520.58 ms. Allocated memory is still 200.3 MB. Free memory was 177.1 MB in the beginning and 149.6 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:51,098 INFO L168 Benchmark]: TraceAbstraction took 2442.00 ms. Allocated memory was 200.3 MB in the beginning and 251.7 MB in the end (delta: 51.4 MB). Free memory was 148.9 MB in the beginning and 172.0 MB in the end (delta: -23.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:51,102 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.25 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.86 ms. Allocated memory is still 135.8 MB. Free memory was 100.6 MB in the beginning and 89.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.18 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 89.6 MB in the beginning and 177.1 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 520.58 ms. Allocated memory is still 200.3 MB. Free memory was 177.1 MB in the beginning and 149.6 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2442.00 ms. Allocated memory was 200.3 MB in the beginning and 251.7 MB in the end (delta: 51.4 MB). Free memory was 148.9 MB in the beginning and 172.0 MB in the end (delta: -23.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...