/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/list-properties/list_flag-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:05:17,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:05:17,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:05:17,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:05:17,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:05:17,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:05:17,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:05:18,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:05:18,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:05:18,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:05:18,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:05:18,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:05:18,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:05:18,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:05:18,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:05:18,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:05:18,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:05:18,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:05:18,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:05:18,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:05:18,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:05:18,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:05:18,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:05:18,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:05:18,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:05:18,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:05:18,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:05:18,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:05:18,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:05:18,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:05:18,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:05:18,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:05:18,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:05:18,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:05:18,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:05:18,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:05:18,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:05:18,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:05:18,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:05:18,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:05:18,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:05:18,056 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 04:05:18,073 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:05:18,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:05:18,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:05:18,074 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:05:18,074 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:05:18,075 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:05:18,075 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:05:18,075 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:05:18,075 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:05:18,075 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:05:18,075 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:05:18,076 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:05:18,076 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:05:18,076 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:05:18,076 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:05:18,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:05:18,077 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:05:18,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:05:18,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:05:18,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:05:18,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:05:18,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:05:18,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:05:18,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:05:18,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:05:18,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:05:18,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:05:18,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:05:18,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:05:18,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:05:18,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:05:18,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:05:18,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:05:18,080 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:05:18,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:05:18,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:05:18,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:05:18,082 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:05:18,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:05:18,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:05:18,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:05:18,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:05:18,392 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:05:18,393 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_flag-2.i [2019-11-24 04:05:18,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1f592cd/6e7a4b69c92646afafcd894966e40a97/FLAG96b4e8231 [2019-11-24 04:05:18,958 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:05:18,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_flag-2.i [2019-11-24 04:05:18,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1f592cd/6e7a4b69c92646afafcd894966e40a97/FLAG96b4e8231 [2019-11-24 04:05:19,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1f592cd/6e7a4b69c92646afafcd894966e40a97 [2019-11-24 04:05:19,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:05:19,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:05:19,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:05:19,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:05:19,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:05:19,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:19,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270f8430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19, skipping insertion in model container [2019-11-24 04:05:19,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:19,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:05:19,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:05:19,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:05:19,840 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:05:19,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:05:19,950 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:05:19,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19 WrapperNode [2019-11-24 04:05:19,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:05:19,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:05:19,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:05:19,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:05:19,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:19,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:19,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:05:19,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:05:19,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:05:19,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:05:20,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:20,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:20,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:20,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:20,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:20,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:20,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (1/1) ... [2019-11-24 04:05:20,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:05:20,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:05:20,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:05:20,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:05:20,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (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 04:05:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 04:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 04:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 04:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 04:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 04:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:05:20,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:05:20,484 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:05:20,484 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-24 04:05:20,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:05:20 BoogieIcfgContainer [2019-11-24 04:05:20,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:05:20,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:05:20,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:05:20,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:05:20,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:05:19" (1/3) ... [2019-11-24 04:05:20,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4922e969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:05:20, skipping insertion in model container [2019-11-24 04:05:20,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:05:19" (2/3) ... [2019-11-24 04:05:20,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4922e969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:05:20, skipping insertion in model container [2019-11-24 04:05:20,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:05:20" (3/3) ... [2019-11-24 04:05:20,494 INFO L109 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2019-11-24 04:05:20,504 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:05:20,511 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 04:05:20,523 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 04:05:20,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:05:20,547 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:05:20,547 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:05:20,547 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:05:20,548 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:05:20,548 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:05:20,548 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:05:20,548 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:05:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-24 04:05:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:05:20,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:05:20,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:05:20,567 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:05:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:05:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1738525176, now seen corresponding path program 1 times [2019-11-24 04:05:20,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:05:20,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399142430] [2019-11-24 04:05:20,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:05:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:05:20,702 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 04:05:20,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399142430] [2019-11-24 04:05:20,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:05:20,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:05:20,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259639125] [2019-11-24 04:05:20,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:05:20,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:05:20,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:05:20,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:05:20,728 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-24 04:05:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:05:20,746 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2019-11-24 04:05:20,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:05:20,748 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-24 04:05:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:05:20,758 INFO L225 Difference]: With dead ends: 31 [2019-11-24 04:05:20,758 INFO L226 Difference]: Without dead ends: 15 [2019-11-24 04:05:20,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:05:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-24 04:05:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-24 04:05:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-24 04:05:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-24 04:05:20,796 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 9 [2019-11-24 04:05:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:05:20,797 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-24 04:05:20,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:05:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-11-24 04:05:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:05:20,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:05:20,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:05:20,798 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:05:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:05:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash -296899282, now seen corresponding path program 1 times [2019-11-24 04:05:20,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:05:20,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785386542] [2019-11-24 04:05:20,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:05:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:05:20,893 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 04:05:20,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785386542] [2019-11-24 04:05:20,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:05:20,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:05:20,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871780901] [2019-11-24 04:05:20,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:05:20,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:05:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:05:20,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:05:20,898 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 5 states. [2019-11-24 04:05:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:05:21,019 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-11-24 04:05:21,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:05:21,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-24 04:05:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:05:21,022 INFO L225 Difference]: With dead ends: 36 [2019-11-24 04:05:21,022 INFO L226 Difference]: Without dead ends: 32 [2019-11-24 04:05:21,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:05:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-24 04:05:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2019-11-24 04:05:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-24 04:05:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-11-24 04:05:21,033 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 11 [2019-11-24 04:05:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:05:21,034 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-24 04:05:21,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:05:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-11-24 04:05:21,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:05:21,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:05:21,037 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:05:21,037 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:05:21,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:05:21,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1803692407, now seen corresponding path program 1 times [2019-11-24 04:05:21,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:05:21,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686539289] [2019-11-24 04:05:21,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:05:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:05:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:05:21,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686539289] [2019-11-24 04:05:21,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:05:21,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:05:21,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385809630] [2019-11-24 04:05:21,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:05:21,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:05:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:05:21,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:05:21,173 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 5 states. [2019-11-24 04:05:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:05:21,292 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-11-24 04:05:21,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:05:21,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:05:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:05:21,293 INFO L225 Difference]: With dead ends: 38 [2019-11-24 04:05:21,294 INFO L226 Difference]: Without dead ends: 30 [2019-11-24 04:05:21,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:05:21,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-24 04:05:21,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-11-24 04:05:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-24 04:05:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-24 04:05:21,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-11-24 04:05:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:05:21,300 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-24 04:05:21,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:05:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-24 04:05:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:05:21,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:05:21,301 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:05:21,301 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:05:21,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:05:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1247533368, now seen corresponding path program 1 times [2019-11-24 04:05:21,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:05:21,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980271677] [2019-11-24 04:05:21,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:05:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:05:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:05:21,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980271677] [2019-11-24 04:05:21,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:05:21,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:05:21,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500507300] [2019-11-24 04:05:21,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:05:21,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:05:21,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:05:21,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:05:21,375 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-11-24 04:05:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:05:21,461 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-11-24 04:05:21,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:05:21,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:05:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:05:21,462 INFO L225 Difference]: With dead ends: 36 [2019-11-24 04:05:21,462 INFO L226 Difference]: Without dead ends: 26 [2019-11-24 04:05:21,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:05:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-24 04:05:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2019-11-24 04:05:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-24 04:05:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-24 04:05:21,467 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2019-11-24 04:05:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:05:21,467 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-24 04:05:21,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:05:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-24 04:05:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:05:21,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:05:21,468 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:05:21,468 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:05:21,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:05:21,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1243482538, now seen corresponding path program 1 times [2019-11-24 04:05:21,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:05:21,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317726309] [2019-11-24 04:05:21,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:05:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:05:21,705 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 04:05:21,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317726309] [2019-11-24 04:05:21,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315385445] [2019-11-24 04:05:21,706 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 04:05:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:05:21,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-24 04:05:21,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:05:21,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:21,847 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-24 04:05:21,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:21,871 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-24 04:05:21,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-24 04:05:21,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:15 [2019-11-24 04:05:21,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:21,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:21,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2019-11-24 04:05:21,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:21,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:21,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 85 [2019-11-24 04:05:21,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,044 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 84 [2019-11-24 04:05:22,046 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2019-11-24 04:05:22,068 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,256 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-24 04:05:22,257 INFO L567 ElimStorePlain]: treesize reduction 125, result has 47.3 percent of original size [2019-11-24 04:05:22,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2019-11-24 04:05:22,269 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,338 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2019-11-24 04:05:22,401 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,443 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-11-24 04:05:22,483 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-11-24 04:05:22,520 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,566 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_23| vanished before elimination [2019-11-24 04:05:22,566 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-11-24 04:05:22,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 04:05:22,567 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:263, output treesize:44 [2019-11-24 04:05:22,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:22,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:05:22,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-11-24 04:05:22,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:05:22,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-24 04:05:22,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 04:05:22,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2019-11-24 04:05:22,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:22,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-24 04:05:22,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-24 04:05:22,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-24 04:05:22,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:46 [2019-11-24 04:05:22,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-24 04:05:22,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-24 04:05:22,868 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 04:05:22,869 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:05:22,908 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:05:22,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-24 04:05:22,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:40 [2019-11-24 04:05:22,960 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_26|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_27|, |#memory_$Pointer$.offset|], 3=[|#memory_int|]} [2019-11-24 04:05:22,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-11-24 04:05:22,984 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:05:22,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:05:22,993 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_27| vanished before elimination [2019-11-24 04:05:22,994 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-24 04:05:23,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 430 treesize of output 414 [2019-11-24 04:05:23,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:05:23,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-24 04:05:23,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-24 04:05:23,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-24 04:05:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-24 04:05:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-24 04:05:23,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,049 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-24 04:05:23,306 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 31 [2019-11-24 04:05:23,307 INFO L567 ElimStorePlain]: treesize reduction 7896, result has 0.6 percent of original size [2019-11-24 04:05:23,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:05:23,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:05:23,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 5 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-24 04:05:23,311 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:80, output treesize:54 [2019-11-24 04:05:23,437 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 04:05:23,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1367474411] [2019-11-24 04:05:23,459 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-24 04:05:23,459 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:05:23,464 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:05:23,471 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:05:23,471 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:05:23,559 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:23,588 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:23,893 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:23,978 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:24,874 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:25,003 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2019-11-24 04:05:25,133 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2019-11-24 04:05:25,155 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:25,436 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:25,744 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:28,062 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 152 [2019-11-24 04:05:28,344 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:28,470 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 395 [2019-11-24 04:05:28,736 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 391 [2019-11-24 04:05:28,767 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:28,950 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 385 [2019-11-24 04:05:29,124 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 380 [2019-11-24 04:05:29,183 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:29,295 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 373 [2019-11-24 04:05:29,364 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:29,469 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 365 [2019-11-24 04:05:29,624 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 365 [2019-11-24 04:05:29,732 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:30,181 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 320 [2019-11-24 04:05:30,578 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:30,703 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:05:31,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:05:31,492 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) 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 04:05:31,496 INFO L168 Benchmark]: Toolchain (without parser) took 12207.86 ms. Allocated memory was 146.3 MB in the beginning and 431.5 MB in the end (delta: 285.2 MB). Free memory was 103.5 MB in the beginning and 269.7 MB in the end (delta: -166.2 MB). Peak memory consumption was 297.5 MB. Max. memory is 7.1 GB. [2019-11-24 04:05:31,497 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 04:05:31,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.80 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 103.1 MB in the beginning and 169.5 MB in the end (delta: -66.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:05:31,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.02 ms. Allocated memory is still 202.9 MB. Free memory was 169.5 MB in the beginning and 167.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-24 04:05:31,498 INFO L168 Benchmark]: Boogie Preprocessor took 27.50 ms. Allocated memory is still 202.9 MB. Free memory was 167.6 MB in the beginning and 165.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-24 04:05:31,498 INFO L168 Benchmark]: RCFGBuilder took 460.94 ms. Allocated memory is still 202.9 MB. Free memory was 165.7 MB in the beginning and 141.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-11-24 04:05:31,498 INFO L168 Benchmark]: TraceAbstraction took 11008.06 ms. Allocated memory was 202.9 MB in the beginning and 431.5 MB in the end (delta: 228.6 MB). Free memory was 141.5 MB in the beginning and 269.7 MB in the end (delta: -128.2 MB). Peak memory consumption was 278.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:05:31,500 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.25 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 661.80 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 103.1 MB in the beginning and 169.5 MB in the end (delta: -66.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.02 ms. Allocated memory is still 202.9 MB. Free memory was 169.5 MB in the beginning and 167.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.50 ms. Allocated memory is still 202.9 MB. Free memory was 167.6 MB in the beginning and 165.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 460.94 ms. Allocated memory is still 202.9 MB. Free memory was 165.7 MB in the beginning and 141.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11008.06 ms. Allocated memory was 202.9 MB in the beginning and 431.5 MB in the end (delta: 228.6 MB). Free memory was 141.5 MB in the beginning and 269.7 MB in the end (delta: -128.2 MB). Peak memory consumption was 278.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...