/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:48:36,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:48:36,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:48:36,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:48:36,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:48:36,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:48:36,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:48:36,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:48:36,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:48:36,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:48:36,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:48:36,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:48:36,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:48:36,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:48:36,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:48:36,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:48:36,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:48:36,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:48:36,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:48:36,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:48:36,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:48:36,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:48:36,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:48:36,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:48:36,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:48:36,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:48:36,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:48:36,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:48:36,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:48:36,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:48:36,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:48:36,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:48:36,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:48:36,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:48:36,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:48:36,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:48:36,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:48:36,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:48:36,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:48:36,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:48:36,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:48:36,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:48:36,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:48:36,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:48:36,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:48:36,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:48:36,634 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:48:36,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:48:36,635 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:48:36,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:48:36,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:48:36,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:48:36,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:48:36,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:48:36,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:48:36,636 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:48:36,636 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:48:36,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:48:36,637 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:48:36,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:48:36,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:48:36,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:48:36,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:48:36,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:48:36,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:48:36,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:48:36,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:48:36,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:48:36,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:48:36,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:48:36,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:48:36,639 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:48:36,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:48:36,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:48:36,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:48:36,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:48:36,950 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:48:36,951 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c [2019-11-23 20:48:37,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b0b0a13/8d3963dcd14a439293d5a599b3f422a4/FLAG29a2ce4d9 [2019-11-23 20:48:37,450 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:48:37,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c [2019-11-23 20:48:37,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b0b0a13/8d3963dcd14a439293d5a599b3f422a4/FLAG29a2ce4d9 [2019-11-23 20:48:37,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b0b0a13/8d3963dcd14a439293d5a599b3f422a4 [2019-11-23 20:48:37,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:48:37,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:48:37,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:48:37,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:48:37,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:48:37,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:37" (1/1) ... [2019-11-23 20:48:37,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7686dbc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:37, skipping insertion in model container [2019-11-23 20:48:37,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:37" (1/1) ... [2019-11-23 20:48:37,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:48:37,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:48:38,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:48:38,127 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:48:38,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:48:38,165 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:48:38,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38 WrapperNode [2019-11-23 20:48:38,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:48:38,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:48:38,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:48:38,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:48:38,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (1/1) ... [2019-11-23 20:48:38,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (1/1) ... [2019-11-23 20:48:38,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:48:38,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:48:38,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:48:38,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:48:38,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (1/1) ... [2019-11-23 20:48:38,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (1/1) ... [2019-11-23 20:48:38,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (1/1) ... [2019-11-23 20:48:38,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (1/1) ... [2019-11-23 20:48:38,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (1/1) ... [2019-11-23 20:48:38,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (1/1) ... [2019-11-23 20:48:38,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (1/1) ... [2019-11-23 20:48:38,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:48:38,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:48:38,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:48:38,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:48:38,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (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-23 20:48:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:48:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 20:48:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:48:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:48:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:48:38,703 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:48:38,703 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-23 20:48:38,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:38 BoogieIcfgContainer [2019-11-23 20:48:38,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:48:38,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:48:38,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:48:38,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:48:38,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:48:37" (1/3) ... [2019-11-23 20:48:38,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb35e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:38, skipping insertion in model container [2019-11-23 20:48:38,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:38" (2/3) ... [2019-11-23 20:48:38,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb35e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:38, skipping insertion in model container [2019-11-23 20:48:38,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:38" (3/3) ... [2019-11-23 20:48:38,722 INFO L109 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2019-11-23 20:48:38,739 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:48:38,750 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:48:38,762 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:48:38,787 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:48:38,787 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:48:38,787 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:48:38,787 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:48:38,787 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:48:38,788 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:48:38,788 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:48:38,788 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:48:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-23 20:48:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 20:48:38,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:38,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:38,810 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:38,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1560213877, now seen corresponding path program 1 times [2019-11-23 20:48:38,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:38,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758261081] [2019-11-23 20:48:38,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:38,946 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-23 20:48:38,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758261081] [2019-11-23 20:48:38,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:38,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:48:38,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083649652] [2019-11-23 20:48:38,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 20:48:38,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:38,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 20:48:38,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:48:38,968 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-23 20:48:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:38,984 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-11-23 20:48:38,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 20:48:38,985 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-23 20:48:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:38,993 INFO L225 Difference]: With dead ends: 45 [2019-11-23 20:48:38,993 INFO L226 Difference]: Without dead ends: 21 [2019-11-23 20:48:38,996 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-23 20:48:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-23 20:48:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-23 20:48:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:48:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-23 20:48:39,025 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2019-11-23 20:48:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:39,026 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-23 20:48:39,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 20:48:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-23 20:48:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 20:48:39,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:39,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:39,028 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash 631559685, now seen corresponding path program 1 times [2019-11-23 20:48:39,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:39,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197322918] [2019-11-23 20:48:39,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:39,115 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-23 20:48:39,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197322918] [2019-11-23 20:48:39,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:39,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:39,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594012441] [2019-11-23 20:48:39,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:39,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:39,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:39,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:39,119 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-11-23 20:48:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:39,193 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-11-23 20:48:39,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:39,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 20:48:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:39,195 INFO L225 Difference]: With dead ends: 39 [2019-11-23 20:48:39,195 INFO L226 Difference]: Without dead ends: 23 [2019-11-23 20:48:39,196 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-23 20:48:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-23 20:48:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-23 20:48:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 20:48:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-23 20:48:39,202 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-11-23 20:48:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:39,202 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-23 20:48:39,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-23 20:48:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 20:48:39,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:39,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:39,204 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:39,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:39,205 INFO L82 PathProgramCache]: Analyzing trace with hash -971977821, now seen corresponding path program 1 times [2019-11-23 20:48:39,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:39,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577626901] [2019-11-23 20:48:39,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:48:39,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577626901] [2019-11-23 20:48:39,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:39,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:39,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813348871] [2019-11-23 20:48:39,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:39,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:39,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:39,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:39,292 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-11-23 20:48:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:39,401 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-11-23 20:48:39,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:39,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-23 20:48:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:39,402 INFO L225 Difference]: With dead ends: 48 [2019-11-23 20:48:39,403 INFO L226 Difference]: Without dead ends: 35 [2019-11-23 20:48:39,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-23 20:48:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-11-23 20:48:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:48:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-23 20:48:39,410 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2019-11-23 20:48:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:39,410 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-23 20:48:39,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-23 20:48:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 20:48:39,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:39,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:39,412 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:39,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1185722883, now seen corresponding path program 1 times [2019-11-23 20:48:39,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:39,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118934228] [2019-11-23 20:48:39,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:48:39,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118934228] [2019-11-23 20:48:39,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830359240] [2019-11-23 20:48:39,480 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-23 20:48:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:39,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:48:39,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:48:39,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:39,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-23 20:48:39,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175303046] [2019-11-23 20:48:39,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:48:39,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:48:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:48:39,622 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 6 states. [2019-11-23 20:48:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:39,731 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-11-23 20:48:39,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:48:39,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-23 20:48:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:39,733 INFO L225 Difference]: With dead ends: 47 [2019-11-23 20:48:39,733 INFO L226 Difference]: Without dead ends: 28 [2019-11-23 20:48:39,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:48:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-23 20:48:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-23 20:48:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 20:48:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-23 20:48:39,740 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 22 [2019-11-23 20:48:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:39,741 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-23 20:48:39,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:48:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-23 20:48:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 20:48:39,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:39,742 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:39,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:39,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1086929509, now seen corresponding path program 2 times [2019-11-23 20:48:39,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:39,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511702912] [2019-11-23 20:48:39,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:48:40,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511702912] [2019-11-23 20:48:40,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622936854] [2019-11-23 20:48:40,111 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-23 20:48:40,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:40,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:40,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:48:40,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:48:40,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:40,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-23 20:48:40,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729844971] [2019-11-23 20:48:40,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 20:48:40,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:40,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 20:48:40,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:48:40,220 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 7 states. [2019-11-23 20:48:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:40,358 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-11-23 20:48:40,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 20:48:40,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-23 20:48:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:40,360 INFO L225 Difference]: With dead ends: 64 [2019-11-23 20:48:40,360 INFO L226 Difference]: Without dead ends: 49 [2019-11-23 20:48:40,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:48:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-23 20:48:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-23 20:48:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 20:48:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-23 20:48:40,374 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2019-11-23 20:48:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:40,375 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-23 20:48:40,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 20:48:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-23 20:48:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:48:40,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:40,377 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:40,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:40,582 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:40,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:40,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1519365621, now seen corresponding path program 3 times [2019-11-23 20:48:40,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:40,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199224620] [2019-11-23 20:48:40,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:41,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199224620] [2019-11-23 20:48:41,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575333221] [2019-11-23 20:48:41,632 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-23 20:48:41,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:48:41,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:41,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-23 20:48:41,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:41,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:41,811 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 40 treesize of output 58 [2019-11-23 20:48:41,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:41,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:41,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:41,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:37 [2019-11-23 20:48:41,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-11-23 20:48:41,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:41,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:41,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:41,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:37 [2019-11-23 20:48:42,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:42,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2019-11-23 20:48:42,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:42,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:108, output treesize:69 [2019-11-23 20:48:42,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:42,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:42,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 187 [2019-11-23 20:48:42,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,335 INFO L567 ElimStorePlain]: treesize reduction 148, result has 43.7 percent of original size [2019-11-23 20:48:42,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 20:48:42,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:168, output treesize:115 [2019-11-23 20:48:42,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:48:42,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:42,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:42,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:48:43,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:43,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 8 disjoint index pairs (out of 45 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 153 [2019-11-23 20:48:43,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:43,104 INFO L567 ElimStorePlain]: treesize reduction 84, result has 60.9 percent of original size [2019-11-23 20:48:43,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 20:48:43,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:186, output treesize:131 [2019-11-23 20:48:43,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:43,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:43,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:43,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:43,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:43,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 255 [2019-11-23 20:48:43,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:43,510 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-11-23 20:48:43,511 INFO L567 ElimStorePlain]: treesize reduction 140, result has 58.1 percent of original size [2019-11-23 20:48:43,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 20:48:43,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:178, output treesize:183 [2019-11-23 20:48:43,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:48,169 WARN L192 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-11-23 20:48:50,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:50,478 INFO L392 ElimStorePlain]: Different costs {54=[|v_#memory_int_19|], 88=[v_prenex_7]} [2019-11-23 20:48:50,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:50,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:50,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 139 [2019-11-23 20:48:50,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:50,738 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-11-23 20:48:50,739 INFO L567 ElimStorePlain]: treesize reduction 43, result has 84.9 percent of original size [2019-11-23 20:48:50,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:50,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:50,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:50,763 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:50,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 165 [2019-11-23 20:48:50,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:50,949 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-11-23 20:48:50,950 INFO L567 ElimStorePlain]: treesize reduction 42, result has 82.5 percent of original size [2019-11-23 20:48:50,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-23 20:48:50,954 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:291, output treesize:184 [2019-11-23 20:48:51,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:51,156 INFO L392 ElimStorePlain]: Different costs {40=[|v_#memory_int_20|], 70=[v_prenex_10]} [2019-11-23 20:48:51,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:51,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:51,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 168 [2019-11-23 20:48:51,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:51,455 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-11-23 20:48:51,455 INFO L567 ElimStorePlain]: treesize reduction 56, result has 81.9 percent of original size [2019-11-23 20:48:51,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:51,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:51,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:51,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 148 treesize of output 235 [2019-11-23 20:48:51,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:51,769 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-11-23 20:48:51,770 INFO L567 ElimStorePlain]: treesize reduction 74, result has 78.7 percent of original size [2019-11-23 20:48:51,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:51,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:51,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:51,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:51,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-23 20:48:51,779 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:274, output treesize:244 [2019-11-23 20:48:51,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:51,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:51,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:51,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,127 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-23 20:48:52,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:52,562 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-11-23 20:48:52,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:54,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:54,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:54,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 38 [2019-11-23 20:48:54,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776778567] [2019-11-23 20:48:54,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-23 20:48:54,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:54,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-23 20:48:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1181, Unknown=1, NotChecked=0, Total=1406 [2019-11-23 20:48:54,145 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 38 states. [2019-11-23 20:49:10,881 WARN L192 SmtUtils]: Spent 16.28 s on a formula simplification. DAG size of input: 123 DAG size of output: 115 [2019-11-23 20:49:13,105 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-23 20:49:13,624 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-11-23 20:49:14,434 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 79 [2019-11-23 20:49:15,347 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-23 20:49:15,675 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-11-23 20:49:16,013 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-11-23 20:49:44,431 WARN L192 SmtUtils]: Spent 26.27 s on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-11-23 20:50:10,808 WARN L192 SmtUtils]: Spent 18.20 s on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2019-11-23 20:50:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:14,775 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2019-11-23 20:50:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-23 20:50:14,775 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 30 [2019-11-23 20:50:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:14,778 INFO L225 Difference]: With dead ends: 129 [2019-11-23 20:50:14,778 INFO L226 Difference]: Without dead ends: 127 [2019-11-23 20:50:14,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2770 ImplicationChecksByTransitivity, 82.3s TimeCoverageRelationStatistics Valid=1242, Invalid=6945, Unknown=3, NotChecked=0, Total=8190 [2019-11-23 20:50:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-23 20:50:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 44. [2019-11-23 20:50:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 20:50:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-11-23 20:50:14,794 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 30 [2019-11-23 20:50:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:14,794 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-11-23 20:50:14,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-23 20:50:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-11-23 20:50:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 20:50:14,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:14,796 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:14,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:14,999 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:15,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:15,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1466865363, now seen corresponding path program 4 times [2019-11-23 20:50:15,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:15,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172312839] [2019-11-23 20:50:15,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:50:15,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172312839] [2019-11-23 20:50:15,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757165063] [2019-11-23 20:50:15,111 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:15,163 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:50:15,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:15,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 20:50:15,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:50:15,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:15,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-23 20:50:15,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761484951] [2019-11-23 20:50:15,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:50:15,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:15,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:50:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:50:15,208 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 13 states. [2019-11-23 20:50:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:15,460 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2019-11-23 20:50:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:50:15,460 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-11-23 20:50:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:15,462 INFO L225 Difference]: With dead ends: 132 [2019-11-23 20:50:15,462 INFO L226 Difference]: Without dead ends: 97 [2019-11-23 20:50:15,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:50:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-23 20:50:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2019-11-23 20:50:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-23 20:50:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2019-11-23 20:50:15,478 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 32 [2019-11-23 20:50:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:15,478 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2019-11-23 20:50:15,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:50:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2019-11-23 20:50:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 20:50:15,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:15,479 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:15,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:15,683 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:15,684 INFO L82 PathProgramCache]: Analyzing trace with hash 392313387, now seen corresponding path program 1 times [2019-11-23 20:50:15,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:15,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020117745] [2019-11-23 20:50:15,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:17,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020117745] [2019-11-23 20:50:17,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154368121] [2019-11-23 20:50:17,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:17,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-23 20:50:17,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:17,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:17,565 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 23 treesize of output 27 [2019-11-23 20:50:17,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:17,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:17,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:17,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2019-11-23 20:50:17,904 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-11-23 20:50:17,904 INFO L343 Elim1Store]: treesize reduction 28, result has 88.6 percent of original size [2019-11-23 20:50:17,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 315 [2019-11-23 20:50:17,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:17,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:17,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:17,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:17,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:17,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:17,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:17,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:17,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:18,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:18,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:18,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:50:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:50:18,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:18,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:18,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:18,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:18,261 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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) 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-23 20:50:18,267 INFO L168 Benchmark]: Toolchain (without parser) took 100393.38 ms. Allocated memory was 138.4 MB in the beginning and 352.3 MB in the end (delta: 213.9 MB). Free memory was 102.8 MB in the beginning and 198.4 MB in the end (delta: -95.6 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:18,268 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 20:50:18,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.44 ms. Allocated memory is still 138.4 MB. Free memory was 102.6 MB in the beginning and 91.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:18,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.37 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 91.7 MB in the beginning and 178.8 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:18,270 INFO L168 Benchmark]: Boogie Preprocessor took 29.95 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 177.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:18,270 INFO L168 Benchmark]: RCFGBuilder took 389.27 ms. Allocated memory is still 201.3 MB. Free memory was 177.4 MB in the beginning and 158.7 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:18,271 INFO L168 Benchmark]: TraceAbstraction took 99559.90 ms. Allocated memory was 201.3 MB in the beginning and 352.3 MB in the end (delta: 151.0 MB). Free memory was 158.7 MB in the beginning and 198.4 MB in the end (delta: -39.7 MB). Peak memory consumption was 111.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:18,278 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.46 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 291.44 ms. Allocated memory is still 138.4 MB. Free memory was 102.6 MB in the beginning and 91.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 118.37 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 91.7 MB in the beginning and 178.8 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.95 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 177.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 389.27 ms. Allocated memory is still 201.3 MB. Free memory was 177.4 MB in the beginning and 158.7 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99559.90 ms. Allocated memory was 201.3 MB in the beginning and 352.3 MB in the end (delta: 151.0 MB). Free memory was 158.7 MB in the beginning and 198.4 MB in the end (delta: -39.7 MB). Peak memory consumption was 111.3 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...