/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:34:52,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:34:52,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:34:52,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:34:52,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:34:52,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:34:52,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:34:52,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:34:52,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:34:52,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:34:52,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:34:52,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:34:52,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:34:52,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:34:52,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:34:52,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:34:52,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:34:52,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:34:52,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:34:52,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:34:52,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:34:52,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:34:52,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:34:52,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:34:52,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:34:52,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:34:52,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:34:52,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:34:52,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:34:52,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:34:52,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:34:52,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:34:52,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:34:52,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:34:52,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:34:52,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:34:52,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:34:52,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:34:52,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:34:52,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:34:52,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:34:52,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 00:34:52,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:34:52,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:34:52,626 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:34:52,628 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:34:52,628 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:34:52,628 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:34:52,629 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:34:52,629 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:34:52,629 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:34:52,629 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:34:52,629 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:34:52,630 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:34:52,631 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:34:52,631 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:34:52,631 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:34:52,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:34:52,632 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:34:52,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:34:52,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:34:52,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:34:52,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:34:52,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:34:52,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:34:52,634 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:34:52,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:34:52,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:34:52,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:34:52,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:34:52,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:34:52,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:34:52,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:34:52,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:34:52,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:34:52,637 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:34:52,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:34:52,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:34:52,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:34:52,639 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:34:52,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:34:52,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:34:52,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:34:52,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:34:52,932 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:34:52,933 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2019-11-24 00:34:53,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30b18de3/acf7c688870e4da6878d036d61b0e4ea/FLAG214ab4582 [2019-11-24 00:34:53,551 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:34:53,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2019-11-24 00:34:53,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30b18de3/acf7c688870e4da6878d036d61b0e4ea/FLAG214ab4582 [2019-11-24 00:34:53,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30b18de3/acf7c688870e4da6878d036d61b0e4ea [2019-11-24 00:34:53,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:34:53,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:34:53,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:34:53,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:34:53,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:34:53,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:53" (1/1) ... [2019-11-24 00:34:53,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb382ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:53, skipping insertion in model container [2019-11-24 00:34:53,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:53" (1/1) ... [2019-11-24 00:34:53,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:34:53,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:34:54,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:34:54,350 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:34:54,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:34:54,456 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:34:54,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54 WrapperNode [2019-11-24 00:34:54,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:34:54,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:34:54,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:34:54,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:34:54,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:34:54,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:34:54,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:34:54,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:34:54,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:34:54,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:34:54,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:34:54,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:34:54,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (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 [2019-11-24 00:34:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:34:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:34:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:34:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:34:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:34:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:34:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:34:54,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:34:55,478 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:34:55,478 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-11-24 00:34:55,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:55 BoogieIcfgContainer [2019-11-24 00:34:55,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:34:55,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:34:55,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:34:55,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:34:55,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:34:53" (1/3) ... [2019-11-24 00:34:55,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8adb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:55, skipping insertion in model container [2019-11-24 00:34:55,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (2/3) ... [2019-11-24 00:34:55,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8adb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:55, skipping insertion in model container [2019-11-24 00:34:55,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:55" (3/3) ... [2019-11-24 00:34:55,488 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2019-11-24 00:34:55,498 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:34:55,506 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 00:34:55,517 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 00:34:55,543 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:34:55,543 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:34:55,543 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:34:55,544 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:34:55,544 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:34:55,544 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:34:55,544 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:34:55,544 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:34:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-11-24 00:34:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:34:55,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:55,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:34:55,572 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 195253097, now seen corresponding path program 1 times [2019-11-24 00:34:55,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:55,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588575209] [2019-11-24 00:34:55,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:55,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588575209] [2019-11-24 00:34:55,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:55,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:55,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898745754] [2019-11-24 00:34:55,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:34:55,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:55,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:34:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:34:55,835 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 4 states. [2019-11-24 00:34:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:55,973 INFO L93 Difference]: Finished difference Result 96 states and 160 transitions. [2019-11-24 00:34:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:34:55,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-24 00:34:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:55,986 INFO L225 Difference]: With dead ends: 96 [2019-11-24 00:34:55,986 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 00:34:55,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:34:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 00:34:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-11-24 00:34:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-24 00:34:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-11-24 00:34:56,058 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 5 [2019-11-24 00:34:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:56,058 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-11-24 00:34:56,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:34:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-11-24 00:34:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 00:34:56,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:56,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:56,061 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:56,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1340207411, now seen corresponding path program 1 times [2019-11-24 00:34:56,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:56,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438524727] [2019-11-24 00:34:56,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:56,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438524727] [2019-11-24 00:34:56,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:56,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:56,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601002013] [2019-11-24 00:34:56,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:56,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:56,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:56,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:56,217 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 3 states. [2019-11-24 00:34:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:56,281 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-11-24 00:34:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:56,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-24 00:34:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:56,283 INFO L225 Difference]: With dead ends: 41 [2019-11-24 00:34:56,283 INFO L226 Difference]: Without dead ends: 39 [2019-11-24 00:34:56,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-24 00:34:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2019-11-24 00:34:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-24 00:34:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-11-24 00:34:56,294 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2019-11-24 00:34:56,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:56,294 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-11-24 00:34:56,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-11-24 00:34:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 00:34:56,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:56,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:56,298 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:56,298 INFO L82 PathProgramCache]: Analyzing trace with hash 677816537, now seen corresponding path program 1 times [2019-11-24 00:34:56,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:56,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592951937] [2019-11-24 00:34:56,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:56,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592951937] [2019-11-24 00:34:56,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:56,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:56,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255149964] [2019-11-24 00:34:56,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:56,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:56,359 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2019-11-24 00:34:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:56,403 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-11-24 00:34:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:56,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-24 00:34:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:56,405 INFO L225 Difference]: With dead ends: 39 [2019-11-24 00:34:56,406 INFO L226 Difference]: Without dead ends: 37 [2019-11-24 00:34:56,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-24 00:34:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-11-24 00:34:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 00:34:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-11-24 00:34:56,413 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 8 [2019-11-24 00:34:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:56,413 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-24 00:34:56,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-11-24 00:34:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 00:34:56,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:56,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:56,414 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:56,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash -464096572, now seen corresponding path program 1 times [2019-11-24 00:34:56,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:56,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307498622] [2019-11-24 00:34:56,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:56,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307498622] [2019-11-24 00:34:56,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:56,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:34:56,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567112365] [2019-11-24 00:34:56,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:34:56,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:56,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:34:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:34:56,602 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 5 states. [2019-11-24 00:34:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:56,734 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-11-24 00:34:56,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:34:56,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-24 00:34:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:56,736 INFO L225 Difference]: With dead ends: 53 [2019-11-24 00:34:56,736 INFO L226 Difference]: Without dead ends: 42 [2019-11-24 00:34:56,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:34:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-24 00:34:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-11-24 00:34:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-24 00:34:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-24 00:34:56,743 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 9 [2019-11-24 00:34:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:56,744 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-24 00:34:56,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:34:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-11-24 00:34:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 00:34:56,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:56,745 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:56,745 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash 375817561, now seen corresponding path program 1 times [2019-11-24 00:34:56,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:56,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782267235] [2019-11-24 00:34:56,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:56,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782267235] [2019-11-24 00:34:56,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887116631] [2019-11-24 00:34:56,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:34:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:56,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-24 00:34:56,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:34:56,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:57,210 INFO L343 Elim1Store]: treesize reduction 57, result has 41.8 percent of original size [2019-11-24 00:34:57,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 82 [2019-11-24 00:34:57,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:57,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,999 WARN L192 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-24 00:34:58,000 INFO L567 ElimStorePlain]: treesize reduction 63, result has 69.9 percent of original size [2019-11-24 00:34:58,007 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_59|], 4=[|v_#memory_$Pointer$.base_61|], 6=[|v_#memory_$Pointer$.base_60|]} [2019-11-24 00:34:58,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:58,055 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-24 00:34:58,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2019-11-24 00:34:58,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:58,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:58,152 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:58,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:58,258 INFO L343 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2019-11-24 00:34:58,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 64 [2019-11-24 00:34:58,261 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:58,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:58,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:58,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:58,318 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:151, output treesize:138 [2019-11-24 00:34:58,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:58,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:58,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:58,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:58,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:58,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:58,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:58,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:58,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:58,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:58,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 172 treesize of output 230 [2019-11-24 00:34:58,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:58,584 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:58,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 194 [2019-11-24 00:34:58,586 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:58,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:58,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 186 [2019-11-24 00:34:58,618 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:58,944 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-11-24 00:34:58,945 INFO L567 ElimStorePlain]: treesize reduction 349, result has 32.4 percent of original size [2019-11-24 00:34:58,947 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_59|, |#memory_$Pointer$.offset|], 54=[|v_#memory_$Pointer$.base_62|]} [2019-11-24 00:34:58,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:58,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-24 00:34:58,958 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:59,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:59,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-24 00:34:59,022 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:59,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:59,558 WARN L192 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 111 [2019-11-24 00:34:59,560 INFO L343 Elim1Store]: treesize reduction 272, result has 51.1 percent of original size [2019-11-24 00:34:59,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 141 treesize of output 342 [2019-11-24 00:34:59,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:59,584 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:59,700 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2019-11-24 00:34:59,701 INFO L567 ElimStorePlain]: treesize reduction 220, result has 31.5 percent of original size [2019-11-24 00:34:59,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:59,703 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:521, output treesize:130 [2019-11-24 00:35:00,051 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-11-24 00:35:00,052 INFO L343 Elim1Store]: treesize reduction 30, result has 88.0 percent of original size [2019-11-24 00:35:00,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 133 treesize of output 269 [2019-11-24 00:35:00,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:00,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:00,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:00,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:00,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:00,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:00,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:00,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:00,174 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 13 [2019-11-24 00:35:00,175 INFO L567 ElimStorePlain]: treesize reduction 5629, result has 0.3 percent of original size [2019-11-24 00:35:00,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:35:00,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:4 [2019-11-24 00:35:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:00,182 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:35:00,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:00,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:00,195 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_60|, |#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.base_63|]} [2019-11-24 00:35:00,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:00,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:00,208 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-24 00:35:00,210 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:35:00,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:00,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-24 00:35:00,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:28 [2019-11-24 00:35:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:00,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [254508389] [2019-11-24 00:35:00,271 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-11-24 00:35:00,272 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:35:00,277 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:35:00,284 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:35:00,284 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:35:06,180 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-11-24 00:35:06,343 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2019-11-24 00:35:06,554 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 211 [2019-11-24 00:35:06,820 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 211 [2019-11-24 00:35:06,883 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:35:07,239 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-11-24 00:35:07,627 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2019-11-24 00:35:09,343 WARN L192 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 142 DAG size of output: 128 [2019-11-24 00:35:12,911 WARN L192 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 211 DAG size of output: 148 [2019-11-24 00:35:16,229 WARN L192 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 218 DAG size of output: 155 [2019-11-24 00:35:18,332 WARN L192 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 215 DAG size of output: 145 [2019-11-24 00:35:18,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:35:18,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 13 [2019-11-24 00:35:18,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441835527] [2019-11-24 00:35:18,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 00:35:18,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:18,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 00:35:18,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-11-24 00:35:18,337 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 8 states. [2019-11-24 00:35:20,116 WARN L192 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 161 DAG size of output: 139 [2019-11-24 00:35:20,839 WARN L192 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 128 [2019-11-24 00:35:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:21,224 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2019-11-24 00:35:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 00:35:21,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-24 00:35:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:21,227 INFO L225 Difference]: With dead ends: 70 [2019-11-24 00:35:21,228 INFO L226 Difference]: Without dead ends: 68 [2019-11-24 00:35:21,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-24 00:35:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-24 00:35:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2019-11-24 00:35:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-24 00:35:21,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-11-24 00:35:21,237 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 13 [2019-11-24 00:35:21,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:21,238 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-24 00:35:21,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 00:35:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-11-24 00:35:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 00:35:21,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:21,239 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:21,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:21,443 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:21,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash -264795313, now seen corresponding path program 1 times [2019-11-24 00:35:21,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:21,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375413383] [2019-11-24 00:35:21,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:21,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375413383] [2019-11-24 00:35:21,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431527582] [2019-11-24 00:35:21,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:21,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-24 00:35:21,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:35:22,829 WARN L192 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-24 00:35:23,274 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-24 00:35:23,429 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-24 00:35:23,614 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-24 00:35:24,259 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-11-24 00:35:24,388 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-11-24 00:35:24,581 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-24 00:35:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:24,617 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:35:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:24,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [340019954] [2019-11-24 00:35:24,734 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-24 00:35:24,735 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:35:24,735 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:35:24,735 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:35:24,735 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:35:28,193 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:28,308 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:28,793 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:28,893 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:29,676 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 206 [2019-11-24 00:35:29,838 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:30,005 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:30,317 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:30,414 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:30,435 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:30,558 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:31,795 WARN L192 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 138 [2019-11-24 00:35:32,204 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-11-24 00:35:32,362 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:32,918 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:33,430 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 493 [2019-11-24 00:35:34,251 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:34,363 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:34,553 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:34,574 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:34,704 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:34,871 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:36,679 WARN L192 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 126 [2019-11-24 00:35:36,772 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:35:37,141 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-11-24 00:35:37,520 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2019-11-24 00:35:39,591 WARN L192 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 193 DAG size of output: 151 [2019-11-24 00:35:41,823 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 209 DAG size of output: 139 [2019-11-24 00:35:42,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:35:42,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 6] total 18 [2019-11-24 00:35:42,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311230753] [2019-11-24 00:35:42,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 00:35:42,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:42,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 00:35:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-11-24 00:35:42,221 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 6 states. [2019-11-24 00:35:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:42,482 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2019-11-24 00:35:42,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:35:42,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-24 00:35:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:42,484 INFO L225 Difference]: With dead ends: 69 [2019-11-24 00:35:42,484 INFO L226 Difference]: Without dead ends: 50 [2019-11-24 00:35:42,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-11-24 00:35:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-24 00:35:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-24 00:35:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-24 00:35:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-11-24 00:35:42,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 14 [2019-11-24 00:35:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:42,493 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-11-24 00:35:42,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 00:35:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-11-24 00:35:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 00:35:42,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:42,494 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:42,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:42,698 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1331876043, now seen corresponding path program 1 times [2019-11-24 00:35:42,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:42,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084117778] [2019-11-24 00:35:42,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:43,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084117778] [2019-11-24 00:35:43,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199307150] [2019-11-24 00:35:43,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:43,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-24 00:35:43,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:35:43,783 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-11-24 00:35:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:43,958 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:35:44,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:44,241 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) 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:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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:316) 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) [2019-11-24 00:35:44,246 INFO L168 Benchmark]: Toolchain (without parser) took 50400.35 ms. Allocated memory was 145.8 MB in the beginning and 511.7 MB in the end (delta: 366.0 MB). Free memory was 101.2 MB in the beginning and 212.5 MB in the end (delta: -111.4 MB). Peak memory consumption was 254.6 MB. Max. memory is 7.1 GB. [2019-11-24 00:35:44,247 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 00:35:44,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.21 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 170.2 MB in the end (delta: -69.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-11-24 00:35:44,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.28 ms. Allocated memory is still 203.4 MB. Free memory was 169.2 MB in the beginning and 167.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-11-24 00:35:44,248 INFO L168 Benchmark]: Boogie Preprocessor took 33.21 ms. Allocated memory is still 203.4 MB. Free memory was 167.0 MB in the beginning and 165.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-24 00:35:44,248 INFO L168 Benchmark]: RCFGBuilder took 930.67 ms. Allocated memory is still 203.4 MB. Free memory was 165.1 MB in the beginning and 120.2 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-11-24 00:35:44,248 INFO L168 Benchmark]: TraceAbstraction took 48764.27 ms. Allocated memory was 203.4 MB in the beginning and 511.7 MB in the end (delta: 308.3 MB). Free memory was 120.2 MB in the beginning and 212.5 MB in the end (delta: -92.3 MB). Peak memory consumption was 216.0 MB. Max. memory is 7.1 GB. [2019-11-24 00:35:44,250 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 609.21 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 170.2 MB in the end (delta: -69.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.28 ms. Allocated memory is still 203.4 MB. Free memory was 169.2 MB in the beginning and 167.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.21 ms. Allocated memory is still 203.4 MB. Free memory was 167.0 MB in the beginning and 165.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 930.67 ms. Allocated memory is still 203.4 MB. Free memory was 165.1 MB in the beginning and 120.2 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48764.27 ms. Allocated memory was 203.4 MB in the beginning and 511.7 MB in the end (delta: 308.3 MB). Free memory was 120.2 MB in the beginning and 212.5 MB in the end (delta: -92.3 MB). Peak memory consumption was 216.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...