/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/loop-invgen/fragtest_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:23:12,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:23:12,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:23:12,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:23:12,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:23:12,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:23:12,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:23:12,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:23:12,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:23:12,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:23:12,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:23:12,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:23:12,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:23:12,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:23:12,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:23:12,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:23:12,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:23:12,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:23:12,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:23:12,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:23:12,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:23:12,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:23:12,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:23:12,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:23:12,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:23:12,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:23:12,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:23:12,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:23:12,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:23:12,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:23:12,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:23:12,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:23:12,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:23:12,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:23:12,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:23:12,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:23:12,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:23:12,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:23:12,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:23:12,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:23:12,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:23:12,558 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:23:12,568 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:23:12,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:23:12,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:23:12,571 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:23:12,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:23:12,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:23:12,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:23:12,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:23:12,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:23:12,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:23:12,573 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:23:12,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:23:12,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:23:12,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:23:12,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:23:12,574 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:23:12,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:23:12,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:23:12,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:23:12,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:23:12,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:23:12,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:23:12,577 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:23:12,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:23:12,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:23:12,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:23:12,957 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:23:12,958 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:23:12,959 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/fragtest_simple.i [2020-07-10 20:23:13,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606fb2975/ea2df04c02844b6eb76c878e0af967cd/FLAGfb9780893 [2020-07-10 20:23:13,628 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:23:13,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple.i [2020-07-10 20:23:13,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606fb2975/ea2df04c02844b6eb76c878e0af967cd/FLAGfb9780893 [2020-07-10 20:23:13,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606fb2975/ea2df04c02844b6eb76c878e0af967cd [2020-07-10 20:23:13,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:23:13,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:23:13,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:23:13,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:23:13,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:23:13,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:23:13" (1/1) ... [2020-07-10 20:23:14,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488f01b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:13, skipping insertion in model container [2020-07-10 20:23:14,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:23:13" (1/1) ... [2020-07-10 20:23:14,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:23:14,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:23:14,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:23:14,248 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:23:14,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:23:14,292 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:23:14,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14 WrapperNode [2020-07-10 20:23:14,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:23:14,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:23:14,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:23:14,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:23:14,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14" (1/1) ... [2020-07-10 20:23:14,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14" (1/1) ... [2020-07-10 20:23:14,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14" (1/1) ... [2020-07-10 20:23:14,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14" (1/1) ... [2020-07-10 20:23:14,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14" (1/1) ... [2020-07-10 20:23:14,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14" (1/1) ... [2020-07-10 20:23:14,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14" (1/1) ... [2020-07-10 20:23:14,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:23:14,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:23:14,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:23:14,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:23:14,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14" (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:23:14,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:23:14,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:23:14,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:23:14,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:23:14,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:23:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:23:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:23:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:23:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:23:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:23:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:23:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:23:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:23:14,936 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:23:14,936 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:23:14,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:23:14 BoogieIcfgContainer [2020-07-10 20:23:14,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:23:14,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:23:14,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:23:14,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:23:14,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:23:13" (1/3) ... [2020-07-10 20:23:14,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e29352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:23:14, skipping insertion in model container [2020-07-10 20:23:14,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:14" (2/3) ... [2020-07-10 20:23:14,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e29352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:23:14, skipping insertion in model container [2020-07-10 20:23:14,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:23:14" (3/3) ... [2020-07-10 20:23:14,956 INFO L109 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i [2020-07-10 20:23:14,966 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:23:14,974 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:23:14,989 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:23:15,014 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:23:15,014 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:23:15,014 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:23:15,014 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:23:15,015 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:23:15,015 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:23:15,015 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:23:15,015 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:23:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-07-10 20:23:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 20:23:15,043 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:15,044 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] [2020-07-10 20:23:15,045 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash -815601615, now seen corresponding path program 1 times [2020-07-10 20:23:15,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:15,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223558533] [2020-07-10 20:23:15,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:15,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-10 20:23:15,252 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50#true} {50#true} #101#return; {50#true} is VALID [2020-07-10 20:23:15,258 INFO L263 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2020-07-10 20:23:15,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-10 20:23:15,259 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50#true} {50#true} #101#return; {50#true} is VALID [2020-07-10 20:23:15,261 INFO L263 TraceCheckUtils]: 3: Hoare triple {50#true} call #t~ret3 := main(); {50#true} is VALID [2020-07-10 20:23:15,262 INFO L280 TraceCheckUtils]: 4: Hoare triple {50#true} havoc ~i~0; {50#true} is VALID [2020-07-10 20:23:15,262 INFO L280 TraceCheckUtils]: 5: Hoare triple {50#true} havoc ~pvlen~0; {50#true} is VALID [2020-07-10 20:23:15,263 INFO L280 TraceCheckUtils]: 6: Hoare triple {50#true} havoc ~tmp___1~0; {50#true} is VALID [2020-07-10 20:23:15,265 INFO L280 TraceCheckUtils]: 7: Hoare triple {50#true} ~k~0 := 0; {50#true} is VALID [2020-07-10 20:23:15,265 INFO L280 TraceCheckUtils]: 8: Hoare triple {50#true} havoc ~n~0; {50#true} is VALID [2020-07-10 20:23:15,266 INFO L280 TraceCheckUtils]: 9: Hoare triple {50#true} ~i~0 := 0; {50#true} is VALID [2020-07-10 20:23:15,267 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {50#true} is VALID [2020-07-10 20:23:15,267 INFO L280 TraceCheckUtils]: 11: Hoare triple {50#true} ~pvlen~0 := #t~nondet0; {50#true} is VALID [2020-07-10 20:23:15,268 INFO L280 TraceCheckUtils]: 12: Hoare triple {50#true} havoc #t~nondet0; {50#true} is VALID [2020-07-10 20:23:15,270 INFO L280 TraceCheckUtils]: 13: Hoare triple {50#true} assume !true; {51#false} is VALID [2020-07-10 20:23:15,271 INFO L280 TraceCheckUtils]: 14: Hoare triple {51#false} assume !(~i~0 > ~pvlen~0); {51#false} is VALID [2020-07-10 20:23:15,271 INFO L280 TraceCheckUtils]: 15: Hoare triple {51#false} ~i~0 := 0; {51#false} is VALID [2020-07-10 20:23:15,272 INFO L280 TraceCheckUtils]: 16: Hoare triple {51#false} assume !true; {51#false} is VALID [2020-07-10 20:23:15,272 INFO L280 TraceCheckUtils]: 17: Hoare triple {51#false} ~j~0 := 0; {51#false} is VALID [2020-07-10 20:23:15,273 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#false} ~n~0 := ~i~0; {51#false} is VALID [2020-07-10 20:23:15,273 INFO L280 TraceCheckUtils]: 19: Hoare triple {51#false} assume !false; {51#false} is VALID [2020-07-10 20:23:15,273 INFO L263 TraceCheckUtils]: 20: Hoare triple {51#false} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {51#false} is VALID [2020-07-10 20:23:15,274 INFO L280 TraceCheckUtils]: 21: Hoare triple {51#false} ~cond := #in~cond; {51#false} is VALID [2020-07-10 20:23:15,276 INFO L280 TraceCheckUtils]: 22: Hoare triple {51#false} assume 0 == ~cond; {51#false} is VALID [2020-07-10 20:23:15,276 INFO L280 TraceCheckUtils]: 23: Hoare triple {51#false} assume !false; {51#false} is VALID [2020-07-10 20:23:15,285 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:23:15,291 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:15,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223558533] [2020-07-10 20:23:15,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:15,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:23:15,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796269806] [2020-07-10 20:23:15,314 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-10 20:23:15,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:15,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:23:15,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:15,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:23:15,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:15,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:23:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:23:15,436 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2020-07-10 20:23:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:15,654 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2020-07-10 20:23:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:23:15,654 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-10 20:23:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:23:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2020-07-10 20:23:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:23:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2020-07-10 20:23:15,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2020-07-10 20:23:15,825 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:23:15,841 INFO L225 Difference]: With dead ends: 76 [2020-07-10 20:23:15,841 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 20:23:15,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:23:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 20:23:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-10 20:23:15,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:15,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-10 20:23:15,928 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-10 20:23:15,928 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-10 20:23:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:15,934 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2020-07-10 20:23:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-07-10 20:23:15,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:15,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:15,936 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-10 20:23:15,936 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-10 20:23:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:15,943 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2020-07-10 20:23:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-07-10 20:23:15,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:15,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:15,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:15,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 20:23:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-07-10 20:23:15,951 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 24 [2020-07-10 20:23:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:15,952 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-07-10 20:23:15,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:23:15,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2020-07-10 20:23:16,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-07-10 20:23:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 20:23:16,024 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:16,038 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] [2020-07-10 20:23:16,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:23:16,039 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:16,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2089093357, now seen corresponding path program 1 times [2020-07-10 20:23:16,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:16,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [459250435] [2020-07-10 20:23:16,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:16,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {376#true} assume true; {376#true} is VALID [2020-07-10 20:23:16,270 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {376#true} {376#true} #101#return; {376#true} is VALID [2020-07-10 20:23:16,271 INFO L263 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {376#true} is VALID [2020-07-10 20:23:16,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {376#true} assume true; {376#true} is VALID [2020-07-10 20:23:16,271 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {376#true} {376#true} #101#return; {376#true} is VALID [2020-07-10 20:23:16,272 INFO L263 TraceCheckUtils]: 3: Hoare triple {376#true} call #t~ret3 := main(); {376#true} is VALID [2020-07-10 20:23:16,272 INFO L280 TraceCheckUtils]: 4: Hoare triple {376#true} havoc ~i~0; {376#true} is VALID [2020-07-10 20:23:16,272 INFO L280 TraceCheckUtils]: 5: Hoare triple {376#true} havoc ~pvlen~0; {376#true} is VALID [2020-07-10 20:23:16,273 INFO L280 TraceCheckUtils]: 6: Hoare triple {376#true} havoc ~tmp___1~0; {376#true} is VALID [2020-07-10 20:23:16,274 INFO L280 TraceCheckUtils]: 7: Hoare triple {376#true} ~k~0 := 0; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,275 INFO L280 TraceCheckUtils]: 8: Hoare triple {380#(<= 0 main_~k~0)} havoc ~n~0; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,277 INFO L280 TraceCheckUtils]: 9: Hoare triple {380#(<= 0 main_~k~0)} ~i~0 := 0; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {380#(<= 0 main_~k~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,279 INFO L280 TraceCheckUtils]: 11: Hoare triple {380#(<= 0 main_~k~0)} ~pvlen~0 := #t~nondet0; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,280 INFO L280 TraceCheckUtils]: 12: Hoare triple {380#(<= 0 main_~k~0)} havoc #t~nondet0; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,282 INFO L280 TraceCheckUtils]: 13: Hoare triple {380#(<= 0 main_~k~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,284 INFO L280 TraceCheckUtils]: 14: Hoare triple {380#(<= 0 main_~k~0)} assume !(0 != #t~nondet1 && ~i~0 <= 1000000); {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,285 INFO L280 TraceCheckUtils]: 15: Hoare triple {380#(<= 0 main_~k~0)} havoc #t~nondet1; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {380#(<= 0 main_~k~0)} assume !(~i~0 > ~pvlen~0); {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {380#(<= 0 main_~k~0)} ~i~0 := 0; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,289 INFO L280 TraceCheckUtils]: 18: Hoare triple {380#(<= 0 main_~k~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,292 INFO L280 TraceCheckUtils]: 19: Hoare triple {380#(<= 0 main_~k~0)} assume !(0 != #t~nondet2 && ~i~0 <= 1000000); {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,293 INFO L280 TraceCheckUtils]: 20: Hoare triple {380#(<= 0 main_~k~0)} havoc #t~nondet2; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,295 INFO L280 TraceCheckUtils]: 21: Hoare triple {380#(<= 0 main_~k~0)} ~j~0 := 0; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,296 INFO L280 TraceCheckUtils]: 22: Hoare triple {380#(<= 0 main_~k~0)} ~n~0 := ~i~0; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,298 INFO L280 TraceCheckUtils]: 23: Hoare triple {380#(<= 0 main_~k~0)} assume !false; {380#(<= 0 main_~k~0)} is VALID [2020-07-10 20:23:16,299 INFO L263 TraceCheckUtils]: 24: Hoare triple {380#(<= 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {381#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:16,301 INFO L280 TraceCheckUtils]: 25: Hoare triple {381#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {382#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:16,302 INFO L280 TraceCheckUtils]: 26: Hoare triple {382#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {377#false} is VALID [2020-07-10 20:23:16,303 INFO L280 TraceCheckUtils]: 27: Hoare triple {377#false} assume !false; {377#false} is VALID [2020-07-10 20:23:16,306 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:23:16,306 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:16,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [459250435] [2020-07-10 20:23:16,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:16,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:23:16,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358313711] [2020-07-10 20:23:16,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-10 20:23:16,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:16,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:23:16,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:16,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:23:16,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:16,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:23:16,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:23:16,351 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2020-07-10 20:23:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:16,695 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-10 20:23:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:23:16,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-10 20:23:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:23:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-10 20:23:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:23:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-10 20:23:16,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2020-07-10 20:23:16,810 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:23:16,813 INFO L225 Difference]: With dead ends: 51 [2020-07-10 20:23:16,813 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 20:23:16,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:23:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 20:23:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2020-07-10 20:23:16,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:16,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2020-07-10 20:23:16,904 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2020-07-10 20:23:16,905 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2020-07-10 20:23:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:16,911 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-10 20:23:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-10 20:23:16,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:16,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:16,912 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2020-07-10 20:23:16,913 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2020-07-10 20:23:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:16,925 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-10 20:23:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-10 20:23:16,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:16,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:16,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:16,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 20:23:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-07-10 20:23:16,932 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 28 [2020-07-10 20:23:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:16,932 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-07-10 20:23:16,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:23:16,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 51 transitions. [2020-07-10 20:23:17,012 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:23:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-10 20:23:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 20:23:17,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:17,015 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:17,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:23:17,016 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash -594427423, now seen corresponding path program 1 times [2020-07-10 20:23:17,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:17,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038670967] [2020-07-10 20:23:17,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:17,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 20:23:17,174 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {683#true} {683#true} #101#return; {683#true} is VALID [2020-07-10 20:23:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:17,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-10 20:23:17,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-10 20:23:17,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 20:23:17,190 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {689#(<= main_~n~0 main_~j~0)} #105#return; {689#(<= main_~n~0 main_~j~0)} is VALID [2020-07-10 20:23:17,190 INFO L263 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2020-07-10 20:23:17,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 20:23:17,191 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {683#true} {683#true} #101#return; {683#true} is VALID [2020-07-10 20:23:17,192 INFO L263 TraceCheckUtils]: 3: Hoare triple {683#true} call #t~ret3 := main(); {683#true} is VALID [2020-07-10 20:23:17,192 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} havoc ~i~0; {683#true} is VALID [2020-07-10 20:23:17,192 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} havoc ~pvlen~0; {683#true} is VALID [2020-07-10 20:23:17,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} havoc ~tmp___1~0; {683#true} is VALID [2020-07-10 20:23:17,193 INFO L280 TraceCheckUtils]: 7: Hoare triple {683#true} ~k~0 := 0; {683#true} is VALID [2020-07-10 20:23:17,193 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} havoc ~n~0; {683#true} is VALID [2020-07-10 20:23:17,194 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} ~i~0 := 0; {683#true} is VALID [2020-07-10 20:23:17,194 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {683#true} is VALID [2020-07-10 20:23:17,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {683#true} ~pvlen~0 := #t~nondet0; {683#true} is VALID [2020-07-10 20:23:17,195 INFO L280 TraceCheckUtils]: 12: Hoare triple {683#true} havoc #t~nondet0; {683#true} is VALID [2020-07-10 20:23:17,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {683#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {683#true} is VALID [2020-07-10 20:23:17,195 INFO L280 TraceCheckUtils]: 14: Hoare triple {683#true} assume !(0 != #t~nondet1 && ~i~0 <= 1000000); {683#true} is VALID [2020-07-10 20:23:17,196 INFO L280 TraceCheckUtils]: 15: Hoare triple {683#true} havoc #t~nondet1; {683#true} is VALID [2020-07-10 20:23:17,196 INFO L280 TraceCheckUtils]: 16: Hoare triple {683#true} assume !(~i~0 > ~pvlen~0); {683#true} is VALID [2020-07-10 20:23:17,198 INFO L280 TraceCheckUtils]: 17: Hoare triple {683#true} ~i~0 := 0; {687#(<= main_~i~0 0)} is VALID [2020-07-10 20:23:17,199 INFO L280 TraceCheckUtils]: 18: Hoare triple {687#(<= main_~i~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {687#(<= main_~i~0 0)} is VALID [2020-07-10 20:23:17,200 INFO L280 TraceCheckUtils]: 19: Hoare triple {687#(<= main_~i~0 0)} assume !(0 != #t~nondet2 && ~i~0 <= 1000000); {687#(<= main_~i~0 0)} is VALID [2020-07-10 20:23:17,201 INFO L280 TraceCheckUtils]: 20: Hoare triple {687#(<= main_~i~0 0)} havoc #t~nondet2; {687#(<= main_~i~0 0)} is VALID [2020-07-10 20:23:17,203 INFO L280 TraceCheckUtils]: 21: Hoare triple {687#(<= main_~i~0 0)} ~j~0 := 0; {688#(<= main_~i~0 main_~j~0)} is VALID [2020-07-10 20:23:17,204 INFO L280 TraceCheckUtils]: 22: Hoare triple {688#(<= main_~i~0 main_~j~0)} ~n~0 := ~i~0; {689#(<= main_~n~0 main_~j~0)} is VALID [2020-07-10 20:23:17,206 INFO L280 TraceCheckUtils]: 23: Hoare triple {689#(<= main_~n~0 main_~j~0)} assume !false; {689#(<= main_~n~0 main_~j~0)} is VALID [2020-07-10 20:23:17,206 INFO L263 TraceCheckUtils]: 24: Hoare triple {689#(<= main_~n~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {683#true} is VALID [2020-07-10 20:23:17,207 INFO L280 TraceCheckUtils]: 25: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-10 20:23:17,207 INFO L280 TraceCheckUtils]: 26: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-10 20:23:17,207 INFO L280 TraceCheckUtils]: 27: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 20:23:17,209 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {683#true} {689#(<= main_~n~0 main_~j~0)} #105#return; {689#(<= main_~n~0 main_~j~0)} is VALID [2020-07-10 20:23:17,210 INFO L280 TraceCheckUtils]: 29: Hoare triple {689#(<= main_~n~0 main_~j~0)} ~k~0 := ~k~0 - 1; {689#(<= main_~n~0 main_~j~0)} is VALID [2020-07-10 20:23:17,213 INFO L280 TraceCheckUtils]: 30: Hoare triple {689#(<= main_~n~0 main_~j~0)} ~i~0 := ~i~0 - 1; {689#(<= main_~n~0 main_~j~0)} is VALID [2020-07-10 20:23:17,214 INFO L280 TraceCheckUtils]: 31: Hoare triple {689#(<= main_~n~0 main_~j~0)} ~j~0 := 1 + ~j~0; {694#(<= (+ main_~n~0 1) main_~j~0)} is VALID [2020-07-10 20:23:17,216 INFO L280 TraceCheckUtils]: 32: Hoare triple {694#(<= (+ main_~n~0 1) main_~j~0)} assume !(~j~0 >= ~n~0); {684#false} is VALID [2020-07-10 20:23:17,217 INFO L280 TraceCheckUtils]: 33: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-10 20:23:17,217 INFO L263 TraceCheckUtils]: 34: Hoare triple {684#false} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {684#false} is VALID [2020-07-10 20:23:17,218 INFO L280 TraceCheckUtils]: 35: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2020-07-10 20:23:17,218 INFO L280 TraceCheckUtils]: 36: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2020-07-10 20:23:17,218 INFO L280 TraceCheckUtils]: 37: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-10 20:23:17,222 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:23:17,222 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:17,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038670967] [2020-07-10 20:23:17,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:17,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:23:17,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117820970] [2020-07-10 20:23:17,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 20:23:17,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:17,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:23:17,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:17,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:23:17,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:23:17,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:23:17,281 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2020-07-10 20:23:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:17,765 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2020-07-10 20:23:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:23:17,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 20:23:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:23:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2020-07-10 20:23:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:23:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2020-07-10 20:23:17,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2020-07-10 20:23:17,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:17,877 INFO L225 Difference]: With dead ends: 82 [2020-07-10 20:23:17,878 INFO L226 Difference]: Without dead ends: 61 [2020-07-10 20:23:17,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:23:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-10 20:23:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2020-07-10 20:23:17,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:17,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 50 states. [2020-07-10 20:23:17,962 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 50 states. [2020-07-10 20:23:17,962 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 50 states. [2020-07-10 20:23:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:17,967 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-07-10 20:23:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2020-07-10 20:23:17,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:17,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:17,969 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 61 states. [2020-07-10 20:23:17,969 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 61 states. [2020-07-10 20:23:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:17,973 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-07-10 20:23:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2020-07-10 20:23:17,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:17,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:17,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:17,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-10 20:23:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2020-07-10 20:23:17,977 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 38 [2020-07-10 20:23:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:17,978 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2020-07-10 20:23:17,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:23:17,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 53 transitions. [2020-07-10 20:23:18,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2020-07-10 20:23:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 20:23:18,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:18,047 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:18,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:23:18,047 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1151378409, now seen corresponding path program 1 times [2020-07-10 20:23:18,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:18,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954775510] [2020-07-10 20:23:18,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:18,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:23:18,062 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:23:18,071 INFO L168 Benchmark]: Toolchain (without parser) took 4086.12 ms. Allocated memory was 142.6 MB in the beginning and 252.2 MB in the end (delta: 109.6 MB). Free memory was 101.2 MB in the beginning and 144.7 MB in the end (delta: -43.5 MB). Peak memory consumption was 66.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:18,072 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:23:18,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.63 ms. Allocated memory is still 142.6 MB. Free memory was 101.0 MB in the beginning and 90.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:18,074 INFO L168 Benchmark]: Boogie Preprocessor took 142.95 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 90.8 MB in the beginning and 178.3 MB in the end (delta: -87.5 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:18,075 INFO L168 Benchmark]: RCFGBuilder took 506.48 ms. Allocated memory is still 200.3 MB. Free memory was 178.3 MB in the beginning and 155.5 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:18,076 INFO L168 Benchmark]: TraceAbstraction took 3122.81 ms. Allocated memory was 200.3 MB in the beginning and 252.2 MB in the end (delta: 51.9 MB). Free memory was 154.8 MB in the beginning and 144.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 62.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:18,080 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.38 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 304.63 ms. Allocated memory is still 142.6 MB. Free memory was 101.0 MB in the beginning and 90.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.95 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 90.8 MB in the beginning and 178.3 MB in the end (delta: -87.5 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 506.48 ms. Allocated memory is still 200.3 MB. Free memory was 178.3 MB in the beginning and 155.5 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3122.81 ms. Allocated memory was 200.3 MB in the beginning and 252.2 MB in the end (delta: 51.9 MB). Free memory was 154.8 MB in the beginning and 144.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 62.0 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...