/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/loops/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:58,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:58,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:58,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:58,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:58,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:58,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:58,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:58,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:58,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:58,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:58,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:58,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:58,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:58,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:58,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:58,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:58,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:58,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:58,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:58,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:58,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:58,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:58,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:58,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:58,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:58,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:58,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:58,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:58,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:58,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:58,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:58,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:58,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:58,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:58,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:58,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:58,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:58,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:58,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:58,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:58,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:58,305 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:58,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:58,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:58,311 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:58,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:58,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:58,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:58,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:58,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:58,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:58,312 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:58,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:58,315 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:58,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:58,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:58,316 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:58,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:58,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:58,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:58,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:58,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:58,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:58,317 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:58,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:58,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:58,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:58,623 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:58,624 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:58,625 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2020-07-10 20:21:58,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac4fda8a/d4727814a196430d9f878e35c2ee4675/FLAGd3a686e89 [2020-07-10 20:21:59,192 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:59,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2020-07-10 20:21:59,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac4fda8a/d4727814a196430d9f878e35c2ee4675/FLAGd3a686e89 [2020-07-10 20:21:59,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac4fda8a/d4727814a196430d9f878e35c2ee4675 [2020-07-10 20:21:59,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:59,573 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:59,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:59,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:59,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:59,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480a8356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59, skipping insertion in model container [2020-07-10 20:21:59,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:59,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:59,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:59,784 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:59,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:59,818 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:59,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59 WrapperNode [2020-07-10 20:21:59,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:59,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:59,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:59,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:59,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:59,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:59,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:59,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:59,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59" (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:22:00,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:00,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:00,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:00,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-10 20:22:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:00,302 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:00,302 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:22:00,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:00 BoogieIcfgContainer [2020-07-10 20:22:00,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:00,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:00,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:00,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:00,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:59" (1/3) ... [2020-07-10 20:22:00,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dd31ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:00, skipping insertion in model container [2020-07-10 20:22:00,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59" (2/3) ... [2020-07-10 20:22:00,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dd31ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:00, skipping insertion in model container [2020-07-10 20:22:00,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:00" (3/3) ... [2020-07-10 20:22:00,335 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2020-07-10 20:22:00,347 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:00,354 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:00,367 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:00,391 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:00,391 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:00,391 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:00,392 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:00,392 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:00,392 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:00,392 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:00,392 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-10 20:22:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 20:22:00,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:00,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:00,422 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:00,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:00,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1882057920, now seen corresponding path program 1 times [2020-07-10 20:22:00,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:00,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101583232] [2020-07-10 20:22:00,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:00,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 20:22:00,599 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-10 20:22:00,601 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-10 20:22:00,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 20:22:00,603 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-10 20:22:00,603 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret2 := main(); {29#true} is VALID [2020-07-10 20:22:00,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} havoc ~i~0; {29#true} is VALID [2020-07-10 20:22:00,604 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {29#true} is VALID [2020-07-10 20:22:00,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} havoc #t~nondet0; {29#true} is VALID [2020-07-10 20:22:00,605 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#true} ~sn~0 := 0; {29#true} is VALID [2020-07-10 20:22:00,605 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#true} ~i~0 := 1; {29#true} is VALID [2020-07-10 20:22:00,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#true} assume !true; {30#false} is VALID [2020-07-10 20:22:00,607 INFO L263 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {30#false} is VALID [2020-07-10 20:22:00,607 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2020-07-10 20:22:00,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2020-07-10 20:22:00,608 INFO L280 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-10 20:22:00,610 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:22:00,610 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:00,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101583232] [2020-07-10 20:22:00,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:00,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:22:00,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136759557] [2020-07-10 20:22:00,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-10 20:22:00,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:00,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:22:00,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:22:00,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:22:00,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:22:00,679 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2020-07-10 20:22:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,770 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-10 20:22:00,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:22:00,770 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-10 20:22:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-10 20:22:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-10 20:22:00,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 41 transitions. [2020-07-10 20:22:00,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,875 INFO L225 Difference]: With dead ends: 37 [2020-07-10 20:22:00,876 INFO L226 Difference]: Without dead ends: 20 [2020-07-10 20:22:00,879 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:22:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-10 20:22:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-10 20:22:00,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:00,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-10 20:22:00,939 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 20:22:00,939 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 20:22:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,943 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-10 20:22:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 20:22:00,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:00,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:00,944 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 20:22:00,944 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 20:22:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,948 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-10 20:22:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 20:22:00,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:00,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:00,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:00,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 20:22:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-10 20:22:00,954 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2020-07-10 20:22:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:00,954 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-10 20:22:00,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:22:00,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2020-07-10 20:22:00,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 20:22:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 20:22:00,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:00,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:00,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:00,988 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1869128626, now seen corresponding path program 1 times [2020-07-10 20:22:00,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:00,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584159020] [2020-07-10 20:22:00,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:01,091 INFO L280 TraceCheckUtils]: 0: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-10 20:22:01,092 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-10 20:22:01,092 INFO L263 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2020-07-10 20:22:01,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-10 20:22:01,093 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-10 20:22:01,093 INFO L263 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2020-07-10 20:22:01,093 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-10 20:22:01,094 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {189#true} is VALID [2020-07-10 20:22:01,094 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} havoc #t~nondet0; {189#true} is VALID [2020-07-10 20:22:01,095 INFO L280 TraceCheckUtils]: 7: Hoare triple {189#true} ~sn~0 := 0; {193#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:01,096 INFO L280 TraceCheckUtils]: 8: Hoare triple {193#(= 0 main_~sn~0)} ~i~0 := 1; {193#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:01,097 INFO L280 TraceCheckUtils]: 9: Hoare triple {193#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {193#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:01,099 INFO L263 TraceCheckUtils]: 10: Hoare triple {193#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:01,101 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {195#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:01,102 INFO L280 TraceCheckUtils]: 12: Hoare triple {195#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {190#false} is VALID [2020-07-10 20:22:01,102 INFO L280 TraceCheckUtils]: 13: Hoare triple {190#false} assume !false; {190#false} is VALID [2020-07-10 20:22:01,104 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:22:01,104 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:01,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584159020] [2020-07-10 20:22:01,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:01,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:22:01,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032945608] [2020-07-10 20:22:01,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 20:22:01,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:01,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:22:01,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:01,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:22:01,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:01,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:22:01,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:22:01,134 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2020-07-10 20:22:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,288 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 20:22:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:22:01,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 20:22:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 20:22:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 20:22:01,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-10 20:22:01,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:01,339 INFO L225 Difference]: With dead ends: 31 [2020-07-10 20:22:01,340 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 20:22:01,341 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:22:01,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 20:22:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-10 20:22:01,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:01,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-10 20:22:01,364 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-10 20:22:01,364 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-10 20:22:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,367 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-10 20:22:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-10 20:22:01,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:01,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:01,368 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-10 20:22:01,369 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-10 20:22:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,371 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-10 20:22:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-10 20:22:01,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:01,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:01,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:01,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 20:22:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-10 20:22:01,375 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2020-07-10 20:22:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:01,376 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-10 20:22:01,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:22:01,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-10 20:22:01,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 20:22:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 20:22:01,418 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:01,418 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] [2020-07-10 20:22:01,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:01,419 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1535432394, now seen corresponding path program 1 times [2020-07-10 20:22:01,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:01,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [976433625] [2020-07-10 20:22:01,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 [2020-07-10 20:22:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:04,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-10 20:22:04,216 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-10 20:22:04,216 INFO L263 TraceCheckUtils]: 0: Hoare triple {364#true} call ULTIMATE.init(); {364#true} is VALID [2020-07-10 20:22:04,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-10 20:22:04,217 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-10 20:22:04,217 INFO L263 TraceCheckUtils]: 3: Hoare triple {364#true} call #t~ret2 := main(); {364#true} is VALID [2020-07-10 20:22:04,218 INFO L280 TraceCheckUtils]: 4: Hoare triple {364#true} havoc ~i~0; {364#true} is VALID [2020-07-10 20:22:04,218 INFO L280 TraceCheckUtils]: 5: Hoare triple {364#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {364#true} is VALID [2020-07-10 20:22:04,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {364#true} havoc #t~nondet0; {364#true} is VALID [2020-07-10 20:22:04,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#true} ~sn~0 := 0; {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:04,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 20:22:04,225 INFO L280 TraceCheckUtils]: 9: Hoare triple {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} [50] L13-6-->L13-7_primed: Formula: (let ((.cse4 (div (+ (* v_oct_main_~sn~0_in_1 (- 1)) v_oct_main_~sn~0_out_1 (- 4)) 2)) (.cse2 (div (+ v_oct_main_~sn~0_in_1 (* v_oct_main_~sn~0_out_1 (- 1)) 4) (- 2)))) (let ((.cse5 (+ .cse2 v_oct_main_~i~0_in_1 2)) (.cse1 (<= v_oct_main_~n~0_out_1 v_oct_main_~n~0_in_1)) (.cse0 (<= v_oct_main_~n~0_in_1 v_oct_main_~n~0_out_1)) (.cse3 (+ v_oct_main_~i~0_in_1 .cse4 2))) (or (and .cse0 .cse1 (<= (+ .cse2 v_oct_main_~i~0_in_1) 8) (<= v_oct_main_~i~0_out_1 .cse3) (<= 0 .cse4) (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~n~0_in_1 1)) (<= .cse5 v_oct_main_~i~0_out_1)) (let ((.cse6 (+ v_oct_main_~i~0_in_1 1)) (.cse7 (+ v_oct_main_~sn~0_in_1 2))) (and .cse0 (<= .cse6 v_oct_main_~i~0_out_1) (<= (* 2 v_oct_main_~i~0_in_1) 18) .cse1 (<= v_oct_main_~i~0_in_1 v_oct_main_~n~0_in_1) (<= v_oct_main_~i~0_out_1 .cse6) (<= v_oct_main_~sn~0_out_1 .cse7) (or (< v_oct_main_~i~0_out_1 .cse5) (not .cse1) (< .cse4 0) (< v_oct_main_~n~0_in_1 (+ .cse2 v_oct_main_~i~0_in_1 1)) (not .cse0) (< 10 v_oct_main_~i~0_out_1) (< .cse3 v_oct_main_~i~0_out_1)) (<= .cse7 v_oct_main_~sn~0_out_1)))))) InVars {main_~i~0=v_oct_main_~i~0_in_1, main_~n~0=v_oct_main_~n~0_in_1, main_~sn~0=v_oct_main_~sn~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_~n~0=v_oct_main_~n~0_out_1, main_~sn~0=v_oct_main_~sn~0_out_1, main_#t~post1=|v_oct_main_#t~post1_out_1|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0, main_~n~0] {370#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< (* 2 main_~n~0) (+ main_~sn~0 1))))} is VALID [2020-07-10 20:22:04,227 INFO L280 TraceCheckUtils]: 10: Hoare triple {370#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< (* 2 main_~n~0) (+ main_~sn~0 1))))} [49] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_3 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {371#(and (<= main_~sn~0 (* 2 main_~n~0)) (< (* 2 main_~n~0) (+ main_~sn~0 1)))} is VALID [2020-07-10 20:22:04,228 INFO L263 TraceCheckUtils]: 11: Hoare triple {371#(and (<= main_~sn~0 (* 2 main_~n~0)) (< (* 2 main_~n~0) (+ main_~sn~0 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {372#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:04,229 INFO L280 TraceCheckUtils]: 12: Hoare triple {372#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {373#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:04,230 INFO L280 TraceCheckUtils]: 13: Hoare triple {373#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {365#false} is VALID [2020-07-10 20:22:04,230 INFO L280 TraceCheckUtils]: 14: Hoare triple {365#false} assume !false; {365#false} is VALID [2020-07-10 20:22:04,232 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:22:04,527 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:04,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [976433625] [2020-07-10 20:22:04,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:04,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 20:22:04,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656101065] [2020-07-10 20:22:04,528 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2020-07-10 20:22:04,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:04,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 20:22:04,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:04,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 20:22:04,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:04,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 20:22:04,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:22:04,559 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2020-07-10 20:22:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,094 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-10 20:22:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 20:22:05,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2020-07-10 20:22:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:22:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2020-07-10 20:22:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:22:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2020-07-10 20:22:05,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2020-07-10 20:22:05,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:05,163 INFO L225 Difference]: With dead ends: 50 [2020-07-10 20:22:05,164 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 20:22:05,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-07-10 20:22:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 20:22:05,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-10 20:22:05,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:05,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-10 20:22:05,199 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-10 20:22:05,199 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-10 20:22:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,202 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 20:22:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 20:22:05,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,203 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-10 20:22:05,203 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-10 20:22:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,206 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 20:22:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 20:22:05,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:05,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 20:22:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-10 20:22:05,209 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2020-07-10 20:22:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:05,209 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-10 20:22:05,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 20:22:05,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-10 20:22:05,243 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:22:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-10 20:22:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 20:22:05,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:05,245 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] [2020-07-10 20:22:05,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:05,245 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash -927596731, now seen corresponding path program 1 times [2020-07-10 20:22:05,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:05,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1426092668] [2020-07-10 20:22:05,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-10 20:22:08,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:22:08,021 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: must have same length at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.pairwiseEquality(SmtUtils.java:418) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.constructEpsilon(AcceleratedInterpolation.java:510) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:449) 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:22:08,027 INFO L168 Benchmark]: Toolchain (without parser) took 8453.34 ms. Allocated memory was 138.4 MB in the beginning and 247.5 MB in the end (delta: 109.1 MB). Free memory was 103.7 MB in the beginning and 181.5 MB in the end (delta: -77.8 MB). Peak memory consumption was 116.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,028 INFO L168 Benchmark]: CDTParser took 1.00 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.68 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 93.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,030 INFO L168 Benchmark]: Boogie Preprocessor took 120.65 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 93.8 MB in the beginning and 182.5 MB in the end (delta: -88.7 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,030 INFO L168 Benchmark]: RCFGBuilder took 366.38 ms. Allocated memory is still 202.4 MB. Free memory was 182.5 MB in the beginning and 165.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,032 INFO L168 Benchmark]: TraceAbstraction took 7707.28 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 165.9 MB in the beginning and 181.5 MB in the end (delta: -15.6 MB). Peak memory consumption was 114.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,036 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 1.00 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.68 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 93.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.65 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 93.8 MB in the beginning and 182.5 MB in the end (delta: -88.7 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 366.38 ms. Allocated memory is still 202.4 MB. Free memory was 182.5 MB in the beginning and 165.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7707.28 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 165.9 MB in the beginning and 181.5 MB in the end (delta: -15.6 MB). Peak memory consumption was 114.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: must have same length de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: must have same length: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.pairwiseEquality(SmtUtils.java:418) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...