/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-8fc6572 [2020-07-10 20:22:00,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:22:00,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:22:00,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:22:00,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:22:00,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:22:00,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:22:00,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:22:00,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:22:00,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:22:00,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:22:00,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:22:00,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:22:00,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:22:00,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:22:00,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:22:00,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:22:00,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:22:00,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:22:00,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:22:00,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:22:00,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:22:00,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:22:00,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:22:00,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:22:00,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:22:00,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:22:00,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:22:00,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:22:00,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:22:00,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:22:00,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:22:00,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:22:00,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:22:00,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:22:00,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:22:00,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:22:00,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:22:00,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:22:00,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:22:00,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:22:00,824 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:22:00,835 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:22:00,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:22:00,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:22:00,837 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:22:00,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:22:00,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:22:00,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:22:00,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:22:00,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:22:00,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:22:00,838 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:22:00,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:22:00,838 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:22:00,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:22:00,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:22:00,839 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:22:00,839 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:22:00,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:22:00,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:00,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:22:00,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:22:00,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:22:00,841 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:22:01,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:22:01,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:22:01,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:22:01,164 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:22:01,164 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:22:01,165 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-10 20:22:01,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c64a1fc/bb61819bb78440488afa6a75c3c43670/FLAG102aa9a3e [2020-07-10 20:22:01,722 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:22:01,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-10 20:22:01,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c64a1fc/bb61819bb78440488afa6a75c3c43670/FLAG102aa9a3e [2020-07-10 20:22:02,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c64a1fc/bb61819bb78440488afa6a75c3c43670 [2020-07-10 20:22:02,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:22:02,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:22:02,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:02,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:22:02,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:22:02,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ec8e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02, skipping insertion in model container [2020-07-10 20:22:02,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:02,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:02,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:02,481 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:02,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:02,515 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:02,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02 WrapperNode [2020-07-10 20:22:02,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:02,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:02,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:02,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:02,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:02,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:02,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:02,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:02,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (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:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-10 20:22:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:02,959 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:02,959 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:22:02,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:02 BoogieIcfgContainer [2020-07-10 20:22:02,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:02,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:02,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:02,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:02,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:22:02" (1/3) ... [2020-07-10 20:22:02,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a2bad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:02, skipping insertion in model container [2020-07-10 20:22:02,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (2/3) ... [2020-07-10 20:22:02,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a2bad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:02, skipping insertion in model container [2020-07-10 20:22:02,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:02" (3/3) ... [2020-07-10 20:22:02,972 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2020-07-10 20:22:02,989 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:03,010 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:03,051 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:03,076 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:03,077 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:03,077 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:03,077 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:03,077 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:03,078 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:03,078 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:03,078 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-10 20:22:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 20:22:03,109 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:03,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:03,110 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash 79158399, now seen corresponding path program 1 times [2020-07-10 20:22:03,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:03,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801905230] [2020-07-10 20:22:03,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,268 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-10 20:22:03,269 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #49#return; {33#true} is VALID [2020-07-10 20:22:03,271 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-10 20:22:03,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-10 20:22:03,272 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #49#return; {33#true} is VALID [2020-07-10 20:22:03,272 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-10 20:22:03,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} havoc ~i~0; {33#true} is VALID [2020-07-10 20:22:03,273 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~j~0 := 10; {33#true} is VALID [2020-07-10 20:22:03,274 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-10 20:22:03,274 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#true} havoc #t~nondet0; {33#true} is VALID [2020-07-10 20:22:03,274 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~sn~0 := 0; {33#true} is VALID [2020-07-10 20:22:03,275 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} ~i~0 := 1; {33#true} is VALID [2020-07-10 20:22:03,284 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-10 20:22:03,285 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-10 20:22:03,285 INFO L280 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2020-07-10 20:22:03,286 INFO L280 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2020-07-10 20:22:03,286 INFO L280 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-10 20:22:03,290 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:03,291 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:03,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801905230] [2020-07-10 20:22:03,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:03,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:22:03,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916748648] [2020-07-10 20:22:03,306 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-10 20:22:03,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:03,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:22:03,361 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-10 20:22:03,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:22:03,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:03,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:22:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:22:03,372 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-07-10 20:22:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:03,500 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-07-10 20:22:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:22:03,501 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-10 20:22:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 20:22:03,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 20:22:03,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-10 20:22:03,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:03,627 INFO L225 Difference]: With dead ends: 41 [2020-07-10 20:22:03,627 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 20:22:03,632 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:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 20:22:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 20:22:03,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:03,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 20:22:03,690 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 20:22:03,690 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 20:22:03,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:03,695 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 20:22:03,695 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 20:22:03,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:03,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:03,696 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 20:22:03,697 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 20:22:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:03,701 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 20:22:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 20:22:03,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:03,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:03,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:03,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 20:22:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-10 20:22:03,708 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2020-07-10 20:22:03,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:03,708 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-10 20:22:03,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:22:03,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2020-07-10 20:22:03,746 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-10 20:22:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 20:22:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 20:22:03,747 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:03,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:03,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:03,748 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:03,749 INFO L82 PathProgramCache]: Analyzing trace with hash 62535021, now seen corresponding path program 1 times [2020-07-10 20:22:03,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:03,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355819104] [2020-07-10 20:22:03,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {217#true} assume true; {217#true} is VALID [2020-07-10 20:22:03,855 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {217#true} {217#true} #49#return; {217#true} is VALID [2020-07-10 20:22:03,855 INFO L263 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2020-07-10 20:22:03,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#true} assume true; {217#true} is VALID [2020-07-10 20:22:03,856 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {217#true} {217#true} #49#return; {217#true} is VALID [2020-07-10 20:22:03,856 INFO L263 TraceCheckUtils]: 3: Hoare triple {217#true} call #t~ret3 := main(); {217#true} is VALID [2020-07-10 20:22:03,857 INFO L280 TraceCheckUtils]: 4: Hoare triple {217#true} havoc ~i~0; {217#true} is VALID [2020-07-10 20:22:03,857 INFO L280 TraceCheckUtils]: 5: Hoare triple {217#true} ~j~0 := 10; {217#true} is VALID [2020-07-10 20:22:03,857 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-10 20:22:03,858 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#true} havoc #t~nondet0; {217#true} is VALID [2020-07-10 20:22:03,859 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#true} ~sn~0 := 0; {221#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:03,860 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#(= 0 main_~sn~0)} ~i~0 := 1; {221#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:03,861 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-10 20:22:03,863 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-10 20:22:03,865 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-10 20:22:03,866 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {218#false} is VALID [2020-07-10 20:22:03,866 INFO L280 TraceCheckUtils]: 14: Hoare triple {218#false} assume !false; {218#false} is VALID [2020-07-10 20:22:03,868 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:03,868 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:03,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355819104] [2020-07-10 20:22:03,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:03,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:22:03,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144857852] [2020-07-10 20:22:03,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 20:22:03,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:03,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:22:03,895 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-10 20:22:03,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:22:03,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:03,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:22:03,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:22:03,897 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2020-07-10 20:22:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:04,075 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-10 20:22:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:22:04,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 20:22:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-10 20:22:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-10 20:22:04,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-10 20:22:04,136 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-10 20:22:04,138 INFO L225 Difference]: With dead ends: 38 [2020-07-10 20:22:04,138 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 20:22:04,140 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:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 20:22:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-10 20:22:04,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:04,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-10 20:22:04,170 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-10 20:22:04,170 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-10 20:22:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:04,173 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-10 20:22:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-10 20:22:04,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:04,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:04,175 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-10 20:22:04,175 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-10 20:22:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:04,178 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-10 20:22:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-10 20:22:04,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:04,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:04,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:04,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 20:22:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-10 20:22:04,183 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2020-07-10 20:22:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:04,183 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-10 20:22:04,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:22:04,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-10 20:22:04,234 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-10 20:22:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-10 20:22:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 20:22:04,235 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:04,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:04,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:04,236 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:04,236 INFO L82 PathProgramCache]: Analyzing trace with hash 268436001, now seen corresponding path program 1 times [2020-07-10 20:22:04,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:04,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [681448788] [2020-07-10 20:22:04,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 Garbage collection #2: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #3: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 [2020-07-10 20:22:06,634 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2020-07-10 20:22:06,797 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2020-07-10 20:22:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-10 20:22:07,136 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #49#return; {434#true} is VALID [2020-07-10 20:22:07,137 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-10 20:22:07,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-10 20:22:07,139 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #49#return; {434#true} is VALID [2020-07-10 20:22:07,139 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret3 := main(); {434#true} is VALID [2020-07-10 20:22:07,140 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~i~0; {434#true} is VALID [2020-07-10 20:22:07,140 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} ~j~0 := 10; {434#true} is VALID [2020-07-10 20:22:07,140 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-10 20:22:07,141 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-10 20:22:07,142 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-10 20:22:07,143 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-10 20:22:07,147 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 ((.cse6 (div (+ v_oct_main_~sn~0_in_1 (* v_oct_main_~sn~0_out_1 (- 1)) 4) (- 2)))) (let ((.cse4 (+ v_oct_main_~i~0_out_1 v_oct_main_~j~0_out_1)) (.cse5 (+ v_oct_main_~i~0_in_1 v_oct_main_~j~0_in_1)) (.cse1 (<= v_oct_main_~n~0_out_1 v_oct_main_~n~0_in_1)) (.cse3 (div (+ (* v_oct_main_~i~0_in_1 (- 1)) v_oct_main_~j~0_in_1 (- 3)) 2)) (.cse2 (+ .cse6 v_oct_main_~i~0_in_1 1)) (.cse0 (<= v_oct_main_~n~0_in_1 v_oct_main_~n~0_out_1)) (.cse7 (div (+ (* v_oct_main_~sn~0_in_1 (- 1)) v_oct_main_~sn~0_out_1 (- 4)) 2))) (or (and .cse0 .cse1 (<= (+ v_oct_main_~j~0_out_1 2) v_oct_main_~j~0_in_1) (<= .cse2 v_oct_main_~n~0_in_1) (<= v_oct_main_~j~0_in_1 (+ .cse3 v_oct_main_~j~0_out_1 2)) (<= .cse4 .cse5) (<= (+ .cse6 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 .cse7 2))) (let ((.cse8 (+ v_oct_main_~i~0_in_1 1)) (.cse10 (+ v_oct_main_~sn~0_in_1 2)) (.cse9 (+ v_oct_main_~j~0_out_1 1))) (and .cse0 (<= .cse8 v_oct_main_~j~0_in_1) (<= .cse8 v_oct_main_~i~0_out_1) (<= v_oct_main_~j~0_in_1 .cse9) .cse1 (<= v_oct_main_~i~0_in_1 v_oct_main_~n~0_in_1) (or (< v_oct_main_~j~0_in_1 (+ .cse6 v_oct_main_~j~0_out_1 2)) (< .cse4 .cse5) (not .cse1) (< .cse3 .cse6) (< .cse7 0) (< v_oct_main_~n~0_in_1 .cse2) (not .cse0) (< (+ v_oct_main_~i~0_in_1 .cse7 2) v_oct_main_~i~0_out_1)) (<= v_oct_main_~i~0_out_1 .cse8) (<= v_oct_main_~sn~0_out_1 .cse10) (<= .cse10 v_oct_main_~sn~0_out_1) (<= .cse9 v_oct_main_~j~0_in_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, 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-10 20:22:07,149 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-10 20:22:07,151 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-10 20:22:07,152 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-10 20:22:07,157 INFO L280 TraceCheckUtils]: 14: Hoare triple {443#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-10 20:22:07,157 INFO L280 TraceCheckUtils]: 15: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-10 20:22:07,159 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:07,558 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:07,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [681448788] [2020-07-10 20:22:07,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:07,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-10 20:22:07,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578736593] [2020-07-10 20:22:07,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2020-07-10 20:22:07,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:07,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 20:22:07,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:07,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 20:22:07,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 20:22:07,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:22:07,595 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 16 states. [2020-07-10 20:22:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,612 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-10 20:22:08,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 20:22:08,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2020-07-10 20:22:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 20:22:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2020-07-10 20:22:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 20:22:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2020-07-10 20:22:08,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 64 transitions. [2020-07-10 20:22:08,719 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-10 20:22:08,722 INFO L225 Difference]: With dead ends: 60 [2020-07-10 20:22:08,723 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 20:22:08,724 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-10 20:22:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 20:22:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2020-07-10 20:22:08,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:08,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 43 states. [2020-07-10 20:22:08,806 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 43 states. [2020-07-10 20:22:08,806 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 43 states. [2020-07-10 20:22:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,812 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-10 20:22:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 20:22:08,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:08,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:08,813 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 55 states. [2020-07-10 20:22:08,813 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 55 states. [2020-07-10 20:22:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,823 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-10 20:22:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 20:22:08,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:08,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:08,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:08,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 20:22:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-07-10 20:22:08,828 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2020-07-10 20:22:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:08,828 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-10 20:22:08,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 20:22:08,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2020-07-10 20:22:08,885 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-10 20:22:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-10 20:22:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 20:22:08,887 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:08,887 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-10 20:22:08,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:08,888 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash -635017609, now seen corresponding path program 1 times [2020-07-10 20:22:08,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:08,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1704787771] [2020-07-10 20:22:08,889 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: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 Garbage collection #2: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #3: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 [2020-07-10 20:22:13,533 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2020-07-10 20:22:13,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:22:13,541 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:13,547 INFO L168 Benchmark]: Toolchain (without parser) took 11317.49 ms. Allocated memory was 138.4 MB in the beginning and 274.2 MB in the end (delta: 135.8 MB). Free memory was 104.1 MB in the beginning and 176.2 MB in the end (delta: -72.1 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:13,548 INFO L168 Benchmark]: CDTParser took 0.19 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:13,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.63 ms. Allocated memory is still 138.4 MB. Free memory was 103.7 MB in the beginning and 94.1 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:13,550 INFO L168 Benchmark]: Boogie Preprocessor took 130.13 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 181.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:13,550 INFO L168 Benchmark]: RCFGBuilder took 316.50 ms. Allocated memory is still 201.9 MB. Free memory was 181.9 MB in the beginning and 164.5 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:13,551 INFO L168 Benchmark]: TraceAbstraction took 10579.32 ms. Allocated memory was 201.9 MB in the beginning and 274.2 MB in the end (delta: 72.4 MB). Free memory was 164.5 MB in the beginning and 176.2 MB in the end (delta: -11.7 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:13,556 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.19 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 284.63 ms. Allocated memory is still 138.4 MB. Free memory was 103.7 MB in the beginning and 94.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.13 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 181.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 316.50 ms. Allocated memory is still 201.9 MB. Free memory was 181.9 MB in the beginning and 164.5 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10579.32 ms. Allocated memory was 201.9 MB in the beginning and 274.2 MB in the end (delta: 72.4 MB). Free memory was 164.5 MB in the beginning and 176.2 MB in the end (delta: -11.7 MB). Peak memory consumption was 114.9 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...