/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_bug02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:56,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:56,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:56,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:56,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:56,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:56,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:56,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:56,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:56,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:56,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:56,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:56,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:56,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:56,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:56,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:56,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:56,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:56,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:56,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:56,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:56,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:56,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:56,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:56,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:56,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:56,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:56,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:56,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:56,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:56,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:56,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:56,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:56,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:56,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:56,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:56,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:56,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:56,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:56,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:56,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:56,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:56,604 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:56,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:56,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:56,606 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:56,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:56,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:56,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:56,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:56,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:56,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:56,607 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:56,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:56,608 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:56,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:56,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:56,608 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:56,608 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:56,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:56,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:56,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:56,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:56,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:56,610 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:56,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:56,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:56,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:56,906 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:56,906 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:56,907 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-18 00:47:56,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569acfe90/f6006c97f9dd4fb9acd6aa7f7e67744a/FLAGc79e213d3 [2020-07-18 00:47:57,473 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:57,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-18 00:47:57,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569acfe90/f6006c97f9dd4fb9acd6aa7f7e67744a/FLAGc79e213d3 [2020-07-18 00:47:57,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569acfe90/f6006c97f9dd4fb9acd6aa7f7e67744a [2020-07-18 00:47:57,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:57,891 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:57,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:57,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:57,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:57,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8154e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57, skipping insertion in model container [2020-07-18 00:47:57,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:57,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:58,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:58,116 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:58,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:58,147 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:58,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58 WrapperNode [2020-07-18 00:47:58,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:58,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:58,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:58,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:58,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58" (1/1) ... [2020-07-18 00:47:58,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58" (1/1) ... [2020-07-18 00:47:58,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58" (1/1) ... [2020-07-18 00:47:58,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58" (1/1) ... [2020-07-18 00:47:58,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58" (1/1) ... [2020-07-18 00:47:58,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58" (1/1) ... [2020-07-18 00:47:58,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58" (1/1) ... [2020-07-18 00:47:58,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:58,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:58,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:58,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:58,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58" (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-18 00:47:58,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-18 00:47:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:58,539 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:58,540 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:47:58,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:58 BoogieIcfgContainer [2020-07-18 00:47:58,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:58,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:58,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:58,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:58,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:57" (1/3) ... [2020-07-18 00:47:58,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:58, skipping insertion in model container [2020-07-18 00:47:58,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:58" (2/3) ... [2020-07-18 00:47:58,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:58, skipping insertion in model container [2020-07-18 00:47:58,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:58" (3/3) ... [2020-07-18 00:47:58,552 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2020-07-18 00:47:58,576 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:58,590 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:58,626 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:58,659 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:58,659 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:58,659 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:58,659 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:58,660 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:58,660 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:58,660 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:58,660 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-18 00:47:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-18 00:47:58,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:58,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:58,705 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:58,711 INFO L82 PathProgramCache]: Analyzing trace with hash 79158399, now seen corresponding path program 1 times [2020-07-18 00:47:58,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:58,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1509279196] [2020-07-18 00:47:58,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:58,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 00:47:58,888 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #49#return; {33#true} is VALID [2020-07-18 00:47:58,890 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-18 00:47:58,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 00:47:58,891 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #49#return; {33#true} is VALID [2020-07-18 00:47:58,891 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-18 00:47:58,892 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} havoc ~i~0; {33#true} is VALID [2020-07-18 00:47:58,892 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~j~0 := 10; {33#true} is VALID [2020-07-18 00:47:58,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {33#true} is VALID [2020-07-18 00:47:58,893 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#true} havoc #t~nondet0; {33#true} is VALID [2020-07-18 00:47:58,893 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~sn~0 := 0; {33#true} is VALID [2020-07-18 00:47:58,894 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} ~i~0 := 1; {33#true} is VALID [2020-07-18 00:47:58,895 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-18 00:47:58,896 INFO L263 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {34#false} is VALID [2020-07-18 00:47:58,896 INFO L280 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2020-07-18 00:47:58,896 INFO L280 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2020-07-18 00:47:58,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-18 00:47:58,898 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-18 00:47:58,901 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:58,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1509279196] [2020-07-18 00:47:58,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:58,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 00:47:58,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225687568] [2020-07-18 00:47:58,912 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-18 00:47:58,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:58,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 00:47:58,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:58,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 00:47:58,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:58,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 00:47:58,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:47:58,989 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-07-18 00:47:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:59,137 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-07-18 00:47:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 00:47:59,138 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-18 00:47:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:47:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-18 00:47:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:47:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-18 00:47:59,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-18 00:47:59,269 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-18 00:47:59,280 INFO L225 Difference]: With dead ends: 41 [2020-07-18 00:47:59,280 INFO L226 Difference]: Without dead ends: 24 [2020-07-18 00:47:59,284 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-18 00:47:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-18 00:47:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-18 00:47:59,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:59,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-18 00:47:59,335 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-18 00:47:59,335 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-18 00:47:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:59,340 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-18 00:47:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-18 00:47:59,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:59,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:59,341 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-18 00:47:59,342 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-18 00:47:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:59,346 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-18 00:47:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-18 00:47:59,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:59,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:59,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:59,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-18 00:47:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-18 00:47:59,352 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2020-07-18 00:47:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:59,353 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-18 00:47:59,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 00:47:59,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2020-07-18 00:47:59,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-18 00:47:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-18 00:47:59,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:59,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:59,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:59,391 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:59,392 INFO L82 PathProgramCache]: Analyzing trace with hash 62535021, now seen corresponding path program 1 times [2020-07-18 00:47:59,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:59,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [303504843] [2020-07-18 00:47:59,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:59,505 INFO L280 TraceCheckUtils]: 0: Hoare triple {217#true} assume true; {217#true} is VALID [2020-07-18 00:47:59,506 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {217#true} {217#true} #49#return; {217#true} is VALID [2020-07-18 00:47:59,506 INFO L263 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2020-07-18 00:47:59,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#true} assume true; {217#true} is VALID [2020-07-18 00:47:59,508 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {217#true} {217#true} #49#return; {217#true} is VALID [2020-07-18 00:47:59,508 INFO L263 TraceCheckUtils]: 3: Hoare triple {217#true} call #t~ret3 := main(); {217#true} is VALID [2020-07-18 00:47:59,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {217#true} havoc ~i~0; {217#true} is VALID [2020-07-18 00:47:59,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {217#true} ~j~0 := 10; {217#true} is VALID [2020-07-18 00:47:59,509 INFO L280 TraceCheckUtils]: 6: Hoare triple {217#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {217#true} is VALID [2020-07-18 00:47:59,510 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#true} havoc #t~nondet0; {217#true} is VALID [2020-07-18 00:47:59,511 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#true} ~sn~0 := 0; {221#(= 0 main_~sn~0)} is VALID [2020-07-18 00:47:59,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#(= 0 main_~sn~0)} ~i~0 := 1; {221#(= 0 main_~sn~0)} is VALID [2020-07-18 00:47:59,513 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {221#(= 0 main_~sn~0)} is VALID [2020-07-18 00:47:59,516 INFO L263 TraceCheckUtils]: 11: Hoare triple {221#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {222#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:47:59,517 INFO L280 TraceCheckUtils]: 12: Hoare triple {222#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {223#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:47:59,518 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {218#false} is VALID [2020-07-18 00:47:59,519 INFO L280 TraceCheckUtils]: 14: Hoare triple {218#false} assume !false; {218#false} is VALID [2020-07-18 00:47:59,522 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-18 00:47:59,526 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:59,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [303504843] [2020-07-18 00:47:59,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:59,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:59,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460482409] [2020-07-18 00:47:59,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-18 00:47:59,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:59,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:59,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:59,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:59,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:59,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:59,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:59,557 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2020-07-18 00:47:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:59,777 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-18 00:47:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:47:59,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-18 00:47:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 00:47:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 00:47:59,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-18 00:47:59,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:59,846 INFO L225 Difference]: With dead ends: 38 [2020-07-18 00:47:59,846 INFO L226 Difference]: Without dead ends: 33 [2020-07-18 00:47:59,849 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-18 00:47:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-18 00:47:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-18 00:47:59,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:59,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-18 00:47:59,887 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-18 00:47:59,887 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-18 00:47:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:59,891 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-18 00:47:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-18 00:47:59,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:59,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:59,892 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-18 00:47:59,892 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-18 00:47:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:59,897 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-18 00:47:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-18 00:47:59,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:59,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:59,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:59,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 00:47:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-18 00:47:59,910 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2020-07-18 00:47:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:59,911 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-18 00:47:59,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:59,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-18 00:47:59,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 00:47:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 00:47:59,954 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:59,954 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-18 00:47:59,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:59,955 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:59,956 INFO L82 PathProgramCache]: Analyzing trace with hash 268436001, now seen corresponding path program 1 times [2020-07-18 00:47:59,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:59,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409384991] [2020-07-18 00:47:59,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:00,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-18 00:48:00,922 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #49#return; {434#true} is VALID [2020-07-18 00:48:00,922 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-18 00:48:00,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-18 00:48:00,923 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #49#return; {434#true} is VALID [2020-07-18 00:48:00,923 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret3 := main(); {434#true} is VALID [2020-07-18 00:48:00,924 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~i~0; {434#true} is VALID [2020-07-18 00:48:00,924 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} ~j~0 := 10; {434#true} is VALID [2020-07-18 00:48:00,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {434#true} is VALID [2020-07-18 00:48:00,925 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-18 00:48:00,926 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} ~sn~0 := 0; {438#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:00,927 INFO L280 TraceCheckUtils]: 9: Hoare triple {438#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {439#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 00:48:00,930 INFO L280 TraceCheckUtils]: 10: Hoare triple {439#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} [55] L13-6-->L13-7_primed: Formula: (let ((.cse1 (* (- 1) v_oct_main_~n~0_in_1)) (.cse0 (* (- 1) v_oct_main_~n~0_out_1))) (or (let ((.cse2 (div (+ v_oct_main_~sn~0_in_1 (* v_oct_main_~sn~0_out_1 (- 1)) 4) (- 2)))) (and (<= (+ .cse0 v_oct_main_~n~0_in_1) 0) (<= (+ v_oct_main_~n~0_out_1 .cse1) 0) (<= (+ v_oct_main_~j~0_out_1 2) v_oct_main_~j~0_in_1) (<= (+ .cse2 v_oct_main_~i~0_in_1 1) v_oct_main_~n~0_in_1) (<= (+ v_oct_main_~i~0_out_1 v_oct_main_~j~0_out_1) (+ v_oct_main_~i~0_in_1 v_oct_main_~j~0_in_1)) (<= (+ .cse2 v_oct_main_~i~0_in_1 2) v_oct_main_~i~0_out_1) (<= v_oct_main_~j~0_in_1 (+ v_oct_main_~j~0_out_1 (div (+ (* v_oct_main_~sn~0_in_1 (- 1)) v_oct_main_~sn~0_out_1 (- 4)) 2) 2)) (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~i~0_in_1 (div (+ v_oct_main_~j~0_in_1 (* v_oct_main_~i~0_in_1 (- 1)) (- 3)) 2) 2)))) (let ((.cse3 (* (- 1) v_oct_main_~j~0_in_1))) (and (<= (+ (* (- 1) v_oct_main_~sn~0_in_1) v_oct_main_~sn~0_out_1) 2) (<= (+ (* (- 1) v_oct_main_~i~0_out_1) v_oct_main_~i~0_in_1) (- 1)) (<= (+ .cse1 v_oct_main_~i~0_in_1) 0) (<= (+ .cse3 v_oct_main_~j~0_out_1) (- 1)) (<= (+ .cse1 v_oct_main_~n~0_out_1) 0) (<= (+ (* (- 1) v_oct_main_~j~0_out_1) v_oct_main_~j~0_in_1) 1) (<= (+ .cse3 v_oct_main_~i~0_in_1) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_1) v_oct_main_~i~0_out_1) 1) (<= (+ v_oct_main_~n~0_in_1 .cse0) 0) (<= (+ (* (- 1) v_oct_main_~sn~0_out_1) v_oct_main_~sn~0_in_1) (- 2)))))) 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, main_~j~0=v_oct_main_~j~0_in_1} OutVars{main_~sn~0=v_oct_main_~sn~0_out_1, main_#t~post1=|v_oct_main_#t~post1_out_1|, main_~j~0=v_oct_main_~j~0_out_1, main_~i~0=v_oct_main_~i~0_out_1, main_#t~post2=|v_oct_main_#t~post2_out_1|, main_~n~0=v_oct_main_~n~0_out_1} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~j~0, main_~i~0, main_#t~post2, main_~n~0] {440#(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-18 00:48:00,932 INFO L280 TraceCheckUtils]: 11: Hoare triple {440#(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))))} [54] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_3 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (< (* 2 main_~n~0) (+ main_~sn~0 1)))} is VALID [2020-07-18 00:48:00,933 INFO L263 TraceCheckUtils]: 12: Hoare triple {441#(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)); {442#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:00,934 INFO L280 TraceCheckUtils]: 13: Hoare triple {442#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {443#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:00,935 INFO L280 TraceCheckUtils]: 14: Hoare triple {443#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-18 00:48:00,935 INFO L280 TraceCheckUtils]: 15: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-18 00:48:00,936 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-18 00:48:01,342 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:01,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409384991] [2020-07-18 00:48:01,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:01,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-18 00:48:01,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202327064] [2020-07-18 00:48:01,344 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2020-07-18 00:48:01,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:01,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-18 00:48:01,376 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-18 00:48:01,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-18 00:48:01,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-18 00:48:01,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-07-18 00:48:01,378 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 16 states. [2020-07-18 00:48:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:02,395 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 00:48:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-18 00:48:02,395 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2020-07-18 00:48:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 00:48:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2020-07-18 00:48:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 00:48:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2020-07-18 00:48:02,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 64 transitions. [2020-07-18 00:48:02,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:02,477 INFO L225 Difference]: With dead ends: 60 [2020-07-18 00:48:02,478 INFO L226 Difference]: Without dead ends: 55 [2020-07-18 00:48:02,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2020-07-18 00:48:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-18 00:48:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2020-07-18 00:48:02,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:02,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 43 states. [2020-07-18 00:48:02,558 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 43 states. [2020-07-18 00:48:02,558 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 43 states. [2020-07-18 00:48:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:02,562 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-18 00:48:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-18 00:48:02,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:02,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:02,563 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 55 states. [2020-07-18 00:48:02,564 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 55 states. [2020-07-18 00:48:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:02,567 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-18 00:48:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-18 00:48:02,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:02,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:02,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:02,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-18 00:48:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-07-18 00:48:02,572 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2020-07-18 00:48:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:02,572 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-18 00:48:02,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-18 00:48:02,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2020-07-18 00:48:02,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-18 00:48:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 00:48:02,624 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:02,624 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:02,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:48:02,625 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash -635017609, now seen corresponding path program 1 times [2020-07-18 00:48:02,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:02,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1167079350] [2020-07-18 00:48:02,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:07,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:48:07,075 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:526) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:465) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) 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-18 00:48:07,080 INFO L168 Benchmark]: Toolchain (without parser) took 9190.76 ms. Allocated memory was 137.9 MB in the beginning and 271.6 MB in the end (delta: 133.7 MB). Free memory was 103.2 MB in the beginning and 230.4 MB in the end (delta: -127.2 MB). Peak memory consumption was 117.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:07,081 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 00:48:07,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.83 ms. Allocated memory is still 137.9 MB. Free memory was 102.7 MB in the beginning and 93.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:07,082 INFO L168 Benchmark]: Boogie Preprocessor took 110.47 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 93.2 MB in the beginning and 180.7 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:07,083 INFO L168 Benchmark]: RCFGBuilder took 285.20 ms. Allocated memory is still 201.9 MB. Free memory was 180.1 MB in the beginning and 163.7 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:07,084 INFO L168 Benchmark]: TraceAbstraction took 8532.12 ms. Allocated memory was 201.9 MB in the beginning and 271.6 MB in the end (delta: 69.7 MB). Free memory was 163.7 MB in the beginning and 230.4 MB in the end (delta: -66.7 MB). Peak memory consumption was 113.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:07,088 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 255.83 ms. Allocated memory is still 137.9 MB. Free memory was 102.7 MB in the beginning and 93.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.47 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 93.2 MB in the beginning and 180.7 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 285.20 ms. Allocated memory is still 201.9 MB. Free memory was 180.1 MB in the beginning and 163.7 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8532.12 ms. Allocated memory was 201.9 MB in the beginning and 271.6 MB in the end (delta: 69.7 MB). Free memory was 163.7 MB in the beginning and 230.4 MB in the end (delta: -66.7 MB). Peak memory consumption was 113.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...