java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:14:22,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:14:22,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:14:22,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:14:22,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:14:22,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:14:22,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:14:22,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:14:22,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:14:22,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:14:22,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:14:22,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:14:22,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:14:22,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:14:22,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:14:22,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:14:22,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:14:22,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:14:22,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:14:22,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:14:22,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:14:22,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:14:22,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:14:22,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:14:22,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:14:22,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:14:22,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:14:22,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:14:22,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:14:22,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:14:22,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:14:22,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:14:22,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:14:22,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:14:22,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:14:22,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:14:22,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:14:22,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:14:22,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:14:22,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:14:22,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:14:22,725 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-09-16 16:14:22,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:14:22,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:14:22,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:14:22,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:14:22,743 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:14:22,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:14:22,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:14:22,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:14:22,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:14:22,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:14:22,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:14:22,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:14:22,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:14:22,746 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:14:22,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:14:22,746 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:14:22,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:14:22,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:14:22,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:14:22,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:14:22,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:14:22,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:14:22,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:14:22,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:14:22,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:14:22,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:14:22,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:14:22,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:14:22,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:14:22,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:14:22,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:14:22,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:14:22,800 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:14:22,800 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:14:22,801 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c [2019-09-16 16:14:22,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0117935/d32969af97184a1a903c16a2e016f17f/FLAG5ec7d38d6 [2019-09-16 16:14:23,307 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:14:23,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c [2019-09-16 16:14:23,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0117935/d32969af97184a1a903c16a2e016f17f/FLAG5ec7d38d6 [2019-09-16 16:14:23,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0117935/d32969af97184a1a903c16a2e016f17f [2019-09-16 16:14:23,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:14:23,716 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:14:23,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:14:23,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:14:23,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:14:23,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:14:23" (1/1) ... [2019-09-16 16:14:23,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1113ca8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:23, skipping insertion in model container [2019-09-16 16:14:23,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:14:23" (1/1) ... [2019-09-16 16:14:23,735 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:14:23,750 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:14:23,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:14:23,930 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:14:23,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:14:24,068 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:14:24,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24 WrapperNode [2019-09-16 16:14:24,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:14:24,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:14:24,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:14:24,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:14:24,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24" (1/1) ... [2019-09-16 16:14:24,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24" (1/1) ... [2019-09-16 16:14:24,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24" (1/1) ... [2019-09-16 16:14:24,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24" (1/1) ... [2019-09-16 16:14:24,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24" (1/1) ... [2019-09-16 16:14:24,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24" (1/1) ... [2019-09-16 16:14:24,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24" (1/1) ... [2019-09-16 16:14:24,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:14:24,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:14:24,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:14:24,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:14:24,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24" (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-09-16 16:14:24,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:14:24,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:14:24,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-16 16:14:24,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:14:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:14:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 16:14:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 16:14:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:14:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:14:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:14:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:14:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:14:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:14:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:14:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:14:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:14:24,519 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:14:24,519 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-16 16:14:24,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:14:24 BoogieIcfgContainer [2019-09-16 16:14:24,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:14:24,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:14:24,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:14:24,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:14:24,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:14:23" (1/3) ... [2019-09-16 16:14:24,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109a4e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:14:24, skipping insertion in model container [2019-09-16 16:14:24,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:24" (2/3) ... [2019-09-16 16:14:24,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109a4e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:14:24, skipping insertion in model container [2019-09-16 16:14:24,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:14:24" (3/3) ... [2019-09-16 16:14:24,529 INFO L109 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2019-09-16 16:14:24,538 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:14:24,546 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:14:24,563 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:14:24,593 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:14:24,594 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:14:24,594 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:14:24,594 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:14:24,594 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:14:24,594 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:14:24,595 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:14:24,595 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:14:24,595 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:14:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-09-16 16:14:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:14:24,618 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:24,619 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:24,621 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:24,627 INFO L82 PathProgramCache]: Analyzing trace with hash -285010775, now seen corresponding path program 1 times [2019-09-16 16:14:24,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:24,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:24,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:24,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:24,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:14:24,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:14:24,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:14:24,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:14:24,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:14:24,818 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-09-16 16:14:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:24,842 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2019-09-16 16:14:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:14:24,844 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-09-16 16:14:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:24,852 INFO L225 Difference]: With dead ends: 59 [2019-09-16 16:14:24,853 INFO L226 Difference]: Without dead ends: 29 [2019-09-16 16:14:24,856 INFO L636 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-09-16 16:14:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-16 16:14:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-16 16:14:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-16 16:14:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-16 16:14:24,898 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-09-16 16:14:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:24,899 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-16 16:14:24,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:14:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-16 16:14:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:14:24,901 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:24,901 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:24,901 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1627005719, now seen corresponding path program 1 times [2019-09-16 16:14:24,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:24,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:24,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:25,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:14:25,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:14:25,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:14:25,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:14:25,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:14:25,086 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-09-16 16:14:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:25,199 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-16 16:14:25,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:14:25,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 16:14:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:25,202 INFO L225 Difference]: With dead ends: 51 [2019-09-16 16:14:25,202 INFO L226 Difference]: Without dead ends: 31 [2019-09-16 16:14:25,204 INFO L636 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-09-16 16:14:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-16 16:14:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-16 16:14:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-16 16:14:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-16 16:14:25,220 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-09-16 16:14:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:25,221 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-16 16:14:25,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:14:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-16 16:14:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:14:25,223 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:25,224 INFO L407 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-09-16 16:14:25,224 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:25,224 INFO L82 PathProgramCache]: Analyzing trace with hash -381446827, now seen corresponding path program 1 times [2019-09-16 16:14:25,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:25,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:25,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:25,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:25,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:14:25,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:14:25,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:14:25,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:14:25,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:14:25,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:14:25,363 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-09-16 16:14:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:25,498 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-09-16 16:14:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:14:25,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-16 16:14:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:25,503 INFO L225 Difference]: With dead ends: 58 [2019-09-16 16:14:25,503 INFO L226 Difference]: Without dead ends: 41 [2019-09-16 16:14:25,504 INFO L636 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-09-16 16:14:25,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-16 16:14:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-09-16 16:14:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-16 16:14:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-16 16:14:25,517 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-09-16 16:14:25,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:25,518 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-16 16:14:25,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:14:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-16 16:14:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:14:25,519 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:25,519 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:25,519 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:25,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:25,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1677394545, now seen corresponding path program 1 times [2019-09-16 16:14:25,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:25,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:25,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 16:14:25,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:25,634 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:25,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:25,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:14:25,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 16:14:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:25,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-16 16:14:25,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:14:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:14:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:14:25,776 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-09-16 16:14:25,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:25,896 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-16 16:14:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:14:25,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-16 16:14:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:25,898 INFO L225 Difference]: With dead ends: 59 [2019-09-16 16:14:25,898 INFO L226 Difference]: Without dead ends: 36 [2019-09-16 16:14:25,899 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-09-16 16:14:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-16 16:14:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-16 16:14:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-16 16:14:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-16 16:14:25,913 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2019-09-16 16:14:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:25,914 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-16 16:14:25,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:14:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-16 16:14:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:14:25,917 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:25,917 INFO L407 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, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:25,917 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:25,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:25,918 INFO L82 PathProgramCache]: Analyzing trace with hash 760173005, now seen corresponding path program 2 times [2019-09-16 16:14:25,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:25,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:25,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:25,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-16 16:14:26,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:26,047 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:26,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:14:26,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:14:26,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:14:26,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:14:26,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-16 16:14:26,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:26,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-16 16:14:26,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:14:26,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:14:26,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:14:26,181 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2019-09-16 16:14:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:26,360 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-09-16 16:14:26,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:14:26,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-16 16:14:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:26,362 INFO L225 Difference]: With dead ends: 72 [2019-09-16 16:14:26,362 INFO L226 Difference]: Without dead ends: 53 [2019-09-16 16:14:26,364 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 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-09-16 16:14:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-16 16:14:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2019-09-16 16:14:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-16 16:14:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-16 16:14:26,385 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 30 [2019-09-16 16:14:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:26,385 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-16 16:14:26,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:14:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-16 16:14:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:14:26,387 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:26,387 INFO L407 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, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:26,389 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1484472327, now seen corresponding path program 3 times [2019-09-16 16:14:26,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:26,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:26,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:26,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:14:26,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:27,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:27,632 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 16:14:27,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:27,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-16 16:14:27,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:14:27,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-16 16:14:27,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:27,796 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:27,797 INFO L375 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-09-16 16:14:27,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:27,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:27,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:27,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2019-09-16 16:14:27,930 INFO L375 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-09-16 16:14:27,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:27,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:27,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:27,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:40 [2019-09-16 16:14:28,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,114 INFO L375 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 75 treesize of output 53 [2019-09-16 16:14:28,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:28,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:28,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:28,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:89 [2019-09-16 16:14:28,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:28,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 118 [2019-09-16 16:14:28,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:28,422 INFO L567 ElimStorePlain]: treesize reduction 38, result has 76.1 percent of original size [2019-09-16 16:14:28,423 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-09-16 16:14:28,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:174, output treesize:121 [2019-09-16 16:14:28,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:14:28,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:14:28,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,666 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:28,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 132 [2019-09-16 16:14:28,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:28,748 INFO L567 ElimStorePlain]: treesize reduction 42, result has 75.9 percent of original size [2019-09-16 16:14:28,749 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-09-16 16:14:28,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:187, output treesize:132 [2019-09-16 16:14:28,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:28,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:28,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 220 [2019-09-16 16:14:28,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:29,136 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-16 16:14:29,137 INFO L567 ElimStorePlain]: treesize reduction 92, result has 66.4 percent of original size [2019-09-16 16:14:29,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-16 16:14:29,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:166, output treesize:173 [2019-09-16 16:14:29,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:29,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:32,002 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-16 16:14:32,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:32,240 INFO L392 ElimStorePlain]: Different costs {54=[|v_#memory_int_21|], 88=[v_prenex_5]} [2019-09-16 16:14:32,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:32,251 INFO L341 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2019-09-16 16:14:32,252 INFO L375 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 125 treesize of output 108 [2019-09-16 16:14:32,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:32,360 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-09-16 16:14:32,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:32,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:32,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:32,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:32,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:32,379 INFO L375 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 162 treesize of output 172 [2019-09-16 16:14:32,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:32,546 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-16 16:14:32,546 INFO L567 ElimStorePlain]: treesize reduction 42, result has 82.6 percent of original size [2019-09-16 16:14:32,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-09-16 16:14:32,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:288, output treesize:186 [2019-09-16 16:14:32,747 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-09-16 16:14:32,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:32,770 INFO L392 ElimStorePlain]: Different costs {40=[|v_#memory_int_22|], 70=[v_prenex_8]} [2019-09-16 16:14:32,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:32,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:32,816 INFO L375 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 120 treesize of output 157 [2019-09-16 16:14:32,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:33,070 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-16 16:14:33,071 INFO L567 ElimStorePlain]: treesize reduction 52, result has 83.0 percent of original size [2019-09-16 16:14:33,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:33,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:33,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:33,158 INFO L375 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 155 treesize of output 242 [2019-09-16 16:14:33,161 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:33,428 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-16 16:14:33,428 INFO L567 ElimStorePlain]: treesize reduction 74, result has 78.7 percent of original size [2019-09-16 16:14:33,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-09-16 16:14:33,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:276, output treesize:244 [2019-09-16 16:14:33,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:33,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:37,362 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-09-16 16:14:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-16 16:14:37,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-09-16 16:14:37,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:37,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:37,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:37,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:3 [2019-09-16 16:14:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:37,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:37,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 40 [2019-09-16 16:14:37,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-16 16:14:37,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-16 16:14:37,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1339, Unknown=1, NotChecked=0, Total=1560 [2019-09-16 16:14:37,760 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 40 states. [2019-09-16 16:14:48,442 WARN L191 SmtUtils]: Spent 10.20 s on a formula simplification. DAG size of input: 105 DAG size of output: 49 [2019-09-16 16:14:50,756 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 64 [2019-09-16 16:14:51,102 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 64 [2019-09-16 16:14:56,175 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 82 [2019-09-16 16:14:56,420 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-09-16 16:14:57,012 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-09-16 16:14:57,451 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2019-09-16 16:14:58,150 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 83 [2019-09-16 16:15:08,606 WARN L191 SmtUtils]: Spent 10.19 s on a formula simplification. DAG size of input: 110 DAG size of output: 42 [2019-09-16 16:15:09,672 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 53 [2019-09-16 16:15:10,050 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 54 [2019-09-16 16:15:14,358 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 [2019-09-16 16:15:18,543 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 43 [2019-09-16 16:15:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:18,622 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2019-09-16 16:15:18,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-16 16:15:18,623 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 36 [2019-09-16 16:15:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:18,625 INFO L225 Difference]: With dead ends: 142 [2019-09-16 16:15:18,625 INFO L226 Difference]: Without dead ends: 140 [2019-09-16 16:15:18,628 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2205 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=936, Invalid=5383, Unknown=1, NotChecked=0, Total=6320 [2019-09-16 16:15:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-16 16:15:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 78. [2019-09-16 16:15:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-16 16:15:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-09-16 16:15:18,657 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 36 [2019-09-16 16:15:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:18,657 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-09-16 16:15:18,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-16 16:15:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-09-16 16:15:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:15:18,662 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:18,662 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:18,662 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:18,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:18,663 INFO L82 PathProgramCache]: Analyzing trace with hash 973091907, now seen corresponding path program 4 times [2019-09-16 16:15:18,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:18,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:18,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:18,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:18,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-16 16:15:18,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:15:18,789 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:15:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 16:15:18,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:15:18,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:18,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-16 16:15:18,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-16 16:15:18,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:15:18,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-16 16:15:18,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-16 16:15:18,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-16 16:15:18,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-09-16 16:15:18,965 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 16 states. [2019-09-16 16:15:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:19,621 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2019-09-16 16:15:19,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-16 16:15:19,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-09-16 16:15:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:19,623 INFO L225 Difference]: With dead ends: 157 [2019-09-16 16:15:19,623 INFO L226 Difference]: Without dead ends: 98 [2019-09-16 16:15:19,625 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-09-16 16:15:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-16 16:15:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2019-09-16 16:15:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-16 16:15:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2019-09-16 16:15:19,639 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 40 [2019-09-16 16:15:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:19,639 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2019-09-16 16:15:19,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-16 16:15:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2019-09-16 16:15:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-16 16:15:19,641 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:19,641 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:19,641 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:19,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:19,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1310271771, now seen corresponding path program 1 times [2019-09-16 16:15:19,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:19,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:19,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:19,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:19,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:15:21,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:15:21,137 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:15:21,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:15:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:21,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-16 16:15:21,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:21,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:21,238 INFO L375 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-09-16 16:15:21,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:21,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:21,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:21,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:25 [2019-09-16 16:15:21,634 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-16 16:15:21,635 INFO L341 Elim1Store]: treesize reduction 38, result has 88.1 percent of original size [2019-09-16 16:15:21,636 INFO L375 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 192 treesize of output 403 [2019-09-16 16:15:21,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:15:21,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:21,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:21,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:22,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:15:22,121 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.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.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-09-16 16:15:22,127 INFO L168 Benchmark]: Toolchain (without parser) took 58411.14 ms. Allocated memory was 132.6 MB in the beginning and 395.8 MB in the end (delta: 263.2 MB). Free memory was 88.5 MB in the beginning and 325.0 MB in the end (delta: -236.5 MB). Peak memory consumption was 274.7 MB. Max. memory is 7.1 GB. [2019-09-16 16:15:22,128 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:15:22,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.87 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.3 MB in the beginning and 175.5 MB in the end (delta: -87.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:15:22,130 INFO L168 Benchmark]: Boogie Preprocessor took 61.09 ms. Allocated memory is still 199.2 MB. Free memory was 175.5 MB in the beginning and 173.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:15:22,130 INFO L168 Benchmark]: RCFGBuilder took 389.84 ms. Allocated memory is still 199.2 MB. Free memory was 173.5 MB in the beginning and 154.4 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:15:22,131 INFO L168 Benchmark]: TraceAbstraction took 57603.22 ms. Allocated memory was 199.2 MB in the beginning and 395.8 MB in the end (delta: 196.6 MB). Free memory was 154.4 MB in the beginning and 325.0 MB in the end (delta: -170.6 MB). Peak memory consumption was 274.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:15:22,135 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.21 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 349.87 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.3 MB in the beginning and 175.5 MB in the end (delta: -87.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.09 ms. Allocated memory is still 199.2 MB. Free memory was 175.5 MB in the beginning and 173.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 389.84 ms. Allocated memory is still 199.2 MB. Free memory was 173.5 MB in the beginning and 154.4 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57603.22 ms. Allocated memory was 199.2 MB in the beginning and 395.8 MB in the end (delta: 196.6 MB). Free memory was 154.4 MB in the beginning and 325.0 MB in the end (delta: -170.6 MB). Peak memory consumption was 274.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...