java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 03:10:38,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 03:10:38,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 03:10:38,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 03:10:38,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 03:10:38,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 03:10:38,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 03:10:38,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 03:10:38,839 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 03:10:38,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 03:10:38,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 03:10:38,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 03:10:38,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 03:10:38,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 03:10:38,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 03:10:38,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 03:10:38,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 03:10:38,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 03:10:38,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 03:10:38,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 03:10:38,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 03:10:38,848 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 03:10:38,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 03:10:38,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 03:10:38,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 03:10:38,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 03:10:38,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 03:10:38,851 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 03:10:38,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 03:10:38,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 03:10:38,851 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 03:10:38,851 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 03:10:38,856 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 03:10:38,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 03:10:38,857 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 03:10:38,857 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 03:10:38,857 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 03:10:38,857 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 03:10:38,857 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 03:10:38,858 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 03:10:38,858 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 03:10:38,858 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 03:10:38,858 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 03:10:38,858 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 03:10:38,858 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 03:10:38,858 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 03:10:38,858 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 03:10:38,858 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 03:10:38,859 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 03:10:38,859 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 03:10:38,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 03:10:38,859 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 03:10:38,859 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 03:10:38,859 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 03:10:38,859 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 03:10:38,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 03:10:38,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 03:10:38,859 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 03:10:38,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 03:10:38,860 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 03:10:38,860 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 03:10:38,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 03:10:38,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 03:10:38,860 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 03:10:38,860 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 03:10:38,860 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 03:10:38,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 03:10:38,886 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 03:10:38,889 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 03:10:38,890 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 03:10:38,890 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 03:10:38,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_true-unreach-call_ground.i [2018-01-30 03:10:38,953 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 03:10:38,954 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 03:10:38,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 03:10:38,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 03:10:38,958 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 03:10:38,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 03:10:38" (1/1) ... [2018-01-30 03:10:38,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a8c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:38, skipping insertion in model container [2018-01-30 03:10:38,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 03:10:38" (1/1) ... [2018-01-30 03:10:38,970 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 03:10:38,979 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 03:10:39,050 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 03:10:39,059 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 03:10:39,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39 WrapperNode [2018-01-30 03:10:39,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 03:10:39,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 03:10:39,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 03:10:39,063 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 03:10:39,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39" (1/1) ... [2018-01-30 03:10:39,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39" (1/1) ... [2018-01-30 03:10:39,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39" (1/1) ... [2018-01-30 03:10:39,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39" (1/1) ... [2018-01-30 03:10:39,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39" (1/1) ... [2018-01-30 03:10:39,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39" (1/1) ... [2018-01-30 03:10:39,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39" (1/1) ... [2018-01-30 03:10:39,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 03:10:39,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 03:10:39,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 03:10:39,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 03:10:39,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39" (1/1) ... No working directory specified, using /home/daniel/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 [2018-01-30 03:10:39,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 03:10:39,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 03:10:39,135 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 03:10:39,135 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 03:10:39,135 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 03:10:39,135 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 03:10:39,136 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 03:10:39,136 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 03:10:39,136 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 03:10:39,510 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 03:10:39,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:10:39 BoogieIcfgContainer [2018-01-30 03:10:39,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 03:10:39,511 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 03:10:39,511 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 03:10:39,511 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 03:10:39,513 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:10:39" (1/1) ... [2018-01-30 03:10:39,516 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 03:10:39,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 03:10:39 BasicIcfg [2018-01-30 03:10:39,523 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 03:10:39,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 03:10:39,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 03:10:39,525 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 03:10:39,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 03:10:38" (1/4) ... [2018-01-30 03:10:39,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30293aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 03:10:39, skipping insertion in model container [2018-01-30 03:10:39,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:10:39" (2/4) ... [2018-01-30 03:10:39,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30293aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 03:10:39, skipping insertion in model container [2018-01-30 03:10:39,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:10:39" (3/4) ... [2018-01-30 03:10:39,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30293aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 03:10:39, skipping insertion in model container [2018-01-30 03:10:39,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 03:10:39" (4/4) ... [2018-01-30 03:10:39,527 INFO L107 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_true-unreach-call_ground.ileft_unchanged_by_heapseparator [2018-01-30 03:10:39,532 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 03:10:39,536 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 03:10:39,566 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 03:10:39,566 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 03:10:39,566 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 03:10:39,566 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 03:10:39,566 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 03:10:39,566 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 03:10:39,567 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 03:10:39,567 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 03:10:39,567 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 03:10:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-30 03:10:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 03:10:39,579 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:39,580 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:39,580 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1424759154, now seen corresponding path program 1 times [2018-01-30 03:10:39,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:39,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:39,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:39,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:39,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:39,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:10:39,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:10:39,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 03:10:39,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 03:10:39,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 03:10:39,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 03:10:39,659 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-30 03:10:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:39,674 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2018-01-30 03:10:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 03:10:39,675 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-30 03:10:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:39,680 INFO L225 Difference]: With dead ends: 124 [2018-01-30 03:10:39,681 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 03:10:39,683 INFO L553 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 [2018-01-30 03:10:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 03:10:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-30 03:10:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-30 03:10:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-01-30 03:10:39,767 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 19 [2018-01-30 03:10:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:39,768 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-01-30 03:10:39,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 03:10:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-01-30 03:10:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 03:10:39,768 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:39,769 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:39,769 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1661424725, now seen corresponding path program 1 times [2018-01-30 03:10:39,769 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:39,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:39,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:39,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:39,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:39,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:10:39,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:10:39,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 03:10:39,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 03:10:39,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 03:10:39,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 03:10:39,814 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 3 states. [2018-01-30 03:10:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:39,900 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2018-01-30 03:10:39,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 03:10:39,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-30 03:10:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:39,901 INFO L225 Difference]: With dead ends: 114 [2018-01-30 03:10:39,901 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 03:10:39,902 INFO L553 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 [2018-01-30 03:10:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 03:10:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 63. [2018-01-30 03:10:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-30 03:10:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-01-30 03:10:39,908 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 20 [2018-01-30 03:10:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:39,908 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-01-30 03:10:39,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 03:10:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-01-30 03:10:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 03:10:39,909 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:39,909 INFO L350 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] [2018-01-30 03:10:39,909 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:39,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1090296639, now seen corresponding path program 1 times [2018-01-30 03:10:39,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:39,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:39,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:39,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:39,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:39,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:10:39,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:10:39,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 03:10:39,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 03:10:39,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 03:10:39,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 03:10:39,964 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 4 states. [2018-01-30 03:10:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:40,217 INFO L93 Difference]: Finished difference Result 153 states and 185 transitions. [2018-01-30 03:10:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 03:10:40,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-30 03:10:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:40,218 INFO L225 Difference]: With dead ends: 153 [2018-01-30 03:10:40,218 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 03:10:40,218 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 03:10:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 03:10:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 67. [2018-01-30 03:10:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 03:10:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-01-30 03:10:40,223 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 25 [2018-01-30 03:10:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:40,223 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-01-30 03:10:40,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 03:10:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-01-30 03:10:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 03:10:40,224 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:40,224 INFO L350 BasicCegarLoop]: trace histogram [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, 1] [2018-01-30 03:10:40,224 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:40,224 INFO L82 PathProgramCache]: Analyzing trace with hash -663166957, now seen corresponding path program 1 times [2018-01-30 03:10:40,224 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:40,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:40,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:40,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:40,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:40,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:10:40,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:40,281 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 03:10:40,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:40,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:10:40,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:40,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 03:10:40,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 03:10:40,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 03:10:40,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 03:10:40,336 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 5 states. [2018-01-30 03:10:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:40,469 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2018-01-30 03:10:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 03:10:40,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-30 03:10:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:40,470 INFO L225 Difference]: With dead ends: 158 [2018-01-30 03:10:40,470 INFO L226 Difference]: Without dead ends: 105 [2018-01-30 03:10:40,470 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 03:10:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-30 03:10:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2018-01-30 03:10:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-30 03:10:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-01-30 03:10:40,475 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 29 [2018-01-30 03:10:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:40,475 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-01-30 03:10:40,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 03:10:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-01-30 03:10:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 03:10:40,475 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:40,476 INFO L350 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2018-01-30 03:10:40,476 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash 467573479, now seen corresponding path program 2 times [2018-01-30 03:10:40,476 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:40,476 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:40,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:40,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:40,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:40,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:10:40,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:40,590 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 03:10:40,598 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:10:40,603 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:40,607 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:40,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 03:10:40,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 03:10:40,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-30 03:10:40,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 03:10:40,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 03:10:40,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 03:10:40,660 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 10 states. [2018-01-30 03:10:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:41,022 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2018-01-30 03:10:41,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 03:10:41,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-30 03:10:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:41,023 INFO L225 Difference]: With dead ends: 162 [2018-01-30 03:10:41,023 INFO L226 Difference]: Without dead ends: 109 [2018-01-30 03:10:41,023 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-01-30 03:10:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-30 03:10:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2018-01-30 03:10:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-30 03:10:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-01-30 03:10:41,029 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 33 [2018-01-30 03:10:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:41,029 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-01-30 03:10:41,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 03:10:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-01-30 03:10:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 03:10:41,029 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:41,030 INFO L350 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:41,030 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:41,030 INFO L82 PathProgramCache]: Analyzing trace with hash -395201552, now seen corresponding path program 1 times [2018-01-30 03:10:41,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:41,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:41,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:41,031 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:41,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:41,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:41,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:41,155 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:41,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:41,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:10:41,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:41,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 03:10:41,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 03:10:41,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 03:10:41,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 03:10:41,212 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 7 states. [2018-01-30 03:10:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:41,437 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2018-01-30 03:10:41,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 03:10:41,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-01-30 03:10:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:41,441 INFO L225 Difference]: With dead ends: 180 [2018-01-30 03:10:41,441 INFO L226 Difference]: Without dead ends: 112 [2018-01-30 03:10:41,441 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-01-30 03:10:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-30 03:10:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-01-30 03:10:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-30 03:10:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2018-01-30 03:10:41,448 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 47 [2018-01-30 03:10:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:41,448 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2018-01-30 03:10:41,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 03:10:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2018-01-30 03:10:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 03:10:41,449 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:41,449 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1] [2018-01-30 03:10:41,449 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:41,449 INFO L82 PathProgramCache]: Analyzing trace with hash 414572996, now seen corresponding path program 2 times [2018-01-30 03:10:41,450 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:41,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:41,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:41,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:41,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:41,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:41,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:41,557 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 03:10:41,562 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:10:41,567 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:41,571 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:41,577 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:41,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:10:41,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:41,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-01-30 03:10:41,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 03:10:41,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 03:10:41,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-30 03:10:41,604 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2018-01-30 03:10:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:41,734 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2018-01-30 03:10:41,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 03:10:41,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-01-30 03:10:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:41,735 INFO L225 Difference]: With dead ends: 185 [2018-01-30 03:10:41,735 INFO L226 Difference]: Without dead ends: 117 [2018-01-30 03:10:41,736 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-01-30 03:10:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-30 03:10:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2018-01-30 03:10:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-30 03:10:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2018-01-30 03:10:41,740 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 51 [2018-01-30 03:10:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:41,740 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2018-01-30 03:10:41,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 03:10:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2018-01-30 03:10:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 03:10:41,741 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:41,742 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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, 1, 1, 1, 1] [2018-01-30 03:10:41,742 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash 214369688, now seen corresponding path program 3 times [2018-01-30 03:10:41,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:41,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:41,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:41,743 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:41,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:41,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:41,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:41,805 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 03:10:41,810 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:10:41,814 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:41,816 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:41,817 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:41,818 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:41,818 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:41,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-30 03:10:42,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:42,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-01-30 03:10:42,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 03:10:42,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 03:10:42,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-01-30 03:10:42,089 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 20 states. [2018-01-30 03:10:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:42,719 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2018-01-30 03:10:42,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 03:10:42,719 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-01-30 03:10:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:42,720 INFO L225 Difference]: With dead ends: 257 [2018-01-30 03:10:42,720 INFO L226 Difference]: Without dead ends: 189 [2018-01-30 03:10:42,721 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 03:10:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-30 03:10:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2018-01-30 03:10:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-30 03:10:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2018-01-30 03:10:42,729 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 55 [2018-01-30 03:10:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:42,729 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2018-01-30 03:10:42,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 03:10:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2018-01-30 03:10:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 03:10:42,730 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:42,731 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:42,731 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:42,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1873537496, now seen corresponding path program 1 times [2018-01-30 03:10:42,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:42,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:42,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:42,732 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:42,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:42,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 03:10:42,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:42,780 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:42,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:42,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:10:42,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:42,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2018-01-30 03:10:42,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 03:10:42,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 03:10:42,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-01-30 03:10:42,873 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand 13 states. [2018-01-30 03:10:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:43,269 INFO L93 Difference]: Finished difference Result 386 states and 466 transitions. [2018-01-30 03:10:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 03:10:43,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-01-30 03:10:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:43,271 INFO L225 Difference]: With dead ends: 386 [2018-01-30 03:10:43,271 INFO L226 Difference]: Without dead ends: 303 [2018-01-30 03:10:43,272 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2018-01-30 03:10:43,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-01-30 03:10:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 198. [2018-01-30 03:10:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-30 03:10:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2018-01-30 03:10:43,281 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 60 [2018-01-30 03:10:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:43,282 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2018-01-30 03:10:43,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 03:10:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2018-01-30 03:10:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-30 03:10:43,283 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:43,283 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 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, 1, 1, 1, 1] [2018-01-30 03:10:43,283 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1184125544, now seen corresponding path program 2 times [2018-01-30 03:10:43,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:43,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:43,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:43,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:43,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:43,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 99 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:43,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:43,633 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:43,638 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:10:43,645 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:43,654 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:43,658 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:43,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-30 03:10:43,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:43,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-01-30 03:10:43,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 03:10:43,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 03:10:43,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-01-30 03:10:43,702 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand 15 states. [2018-01-30 03:10:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:44,641 INFO L93 Difference]: Finished difference Result 497 states and 595 transitions. [2018-01-30 03:10:44,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 03:10:44,645 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-01-30 03:10:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:44,647 INFO L225 Difference]: With dead ends: 497 [2018-01-30 03:10:44,647 INFO L226 Difference]: Without dead ends: 410 [2018-01-30 03:10:44,647 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2018-01-30 03:10:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-01-30 03:10:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 164. [2018-01-30 03:10:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-30 03:10:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2018-01-30 03:10:44,656 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 65 [2018-01-30 03:10:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:44,656 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2018-01-30 03:10:44,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 03:10:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2018-01-30 03:10:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-30 03:10:44,657 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:44,658 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:44,658 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:44,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2110399642, now seen corresponding path program 1 times [2018-01-30 03:10:44,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:44,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:44,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:44,658 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:44,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:44,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-01-30 03:10:44,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:10:44,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 03:10:44,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 03:10:44,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 03:10:44,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 03:10:44,717 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand 3 states. [2018-01-30 03:10:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:44,770 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2018-01-30 03:10:44,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 03:10:44,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-01-30 03:10:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:44,771 INFO L225 Difference]: With dead ends: 267 [2018-01-30 03:10:44,771 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 03:10:44,772 INFO L553 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 [2018-01-30 03:10:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 03:10:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 164. [2018-01-30 03:10:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-30 03:10:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2018-01-30 03:10:44,777 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 66 [2018-01-30 03:10:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:44,778 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2018-01-30 03:10:44,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 03:10:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2018-01-30 03:10:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 03:10:44,779 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:44,779 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:44,779 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash 648022190, now seen corresponding path program 1 times [2018-01-30 03:10:44,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:44,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:44,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:44,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:44,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:44,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:44,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:44,849 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:44,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:44,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:10:44,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:44,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-30 03:10:44,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 03:10:44,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 03:10:44,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-30 03:10:44,899 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand 11 states. [2018-01-30 03:10:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:45,023 INFO L93 Difference]: Finished difference Result 273 states and 320 transitions. [2018-01-30 03:10:45,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 03:10:45,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-01-30 03:10:45,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:45,025 INFO L225 Difference]: With dead ends: 273 [2018-01-30 03:10:45,025 INFO L226 Difference]: Without dead ends: 185 [2018-01-30 03:10:45,025 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-01-30 03:10:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-30 03:10:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2018-01-30 03:10:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-30 03:10:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 202 transitions. [2018-01-30 03:10:45,037 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 202 transitions. Word has length 67 [2018-01-30 03:10:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:45,038 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 202 transitions. [2018-01-30 03:10:45,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 03:10:45,038 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 202 transitions. [2018-01-30 03:10:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-30 03:10:45,038 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:45,038 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:45,039 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1209538650, now seen corresponding path program 2 times [2018-01-30 03:10:45,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:45,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:45,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:45,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:45,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:45,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 128 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:45,144 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:45,144 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:45,149 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:10:45,152 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:45,167 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:45,174 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:45,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:10:45,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:45,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-01-30 03:10:45,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 03:10:45,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 03:10:45,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-01-30 03:10:45,198 INFO L87 Difference]: Start difference. First operand 173 states and 202 transitions. Second operand 12 states. [2018-01-30 03:10:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:45,400 INFO L93 Difference]: Finished difference Result 282 states and 331 transitions. [2018-01-30 03:10:45,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 03:10:45,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-01-30 03:10:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:45,401 INFO L225 Difference]: With dead ends: 282 [2018-01-30 03:10:45,401 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 03:10:45,401 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-01-30 03:10:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 03:10:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2018-01-30 03:10:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-30 03:10:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 213 transitions. [2018-01-30 03:10:45,406 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 213 transitions. Word has length 71 [2018-01-30 03:10:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:45,406 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 213 transitions. [2018-01-30 03:10:45,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 03:10:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2018-01-30 03:10:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 03:10:45,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:45,407 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:45,407 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash -899124730, now seen corresponding path program 3 times [2018-01-30 03:10:45,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:45,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:45,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:45,408 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:45,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:45,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 162 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:45,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:45,495 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:45,501 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:10:45,504 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:45,512 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:45,525 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:45,533 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:45,534 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:45,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:45,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:45,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:45,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-01-30 03:10:45,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:10:46,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:10:46,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:20 [2018-01-30 03:10:46,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:46,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:46,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-01-30 03:10:46,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:10:46,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:10:46,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-01-30 03:10:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-01-30 03:10:46,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:46,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2018-01-30 03:10:46,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 03:10:46,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 03:10:46,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-01-30 03:10:46,199 INFO L87 Difference]: Start difference. First operand 182 states and 213 transitions. Second operand 26 states. [2018-01-30 03:10:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:47,258 INFO L93 Difference]: Finished difference Result 372 states and 439 transitions. [2018-01-30 03:10:47,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 03:10:47,258 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-01-30 03:10:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:47,259 INFO L225 Difference]: With dead ends: 372 [2018-01-30 03:10:47,259 INFO L226 Difference]: Without dead ends: 284 [2018-01-30 03:10:47,260 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=545, Invalid=1807, Unknown=0, NotChecked=0, Total=2352 [2018-01-30 03:10:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-01-30 03:10:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 230. [2018-01-30 03:10:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-30 03:10:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 272 transitions. [2018-01-30 03:10:47,268 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 272 transitions. Word has length 75 [2018-01-30 03:10:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:47,268 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 272 transitions. [2018-01-30 03:10:47,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 03:10:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 272 transitions. [2018-01-30 03:10:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-30 03:10:47,268 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:47,269 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:47,269 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash -301966886, now seen corresponding path program 4 times [2018-01-30 03:10:47,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:47,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:47,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:47,270 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:47,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:47,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 2 proven. 200 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:47,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:47,487 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:47,493 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:10:47,506 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:47,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:47,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 67 [2018-01-30 03:10:47,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 03:10:47,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:10:47,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-01-30 03:10:47,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:47,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 80 [2018-01-30 03:10:47,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-01-30 03:10:48,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 03:10:48,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:55 [2018-01-30 03:10:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-01-30 03:10:48,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:48,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2018-01-30 03:10:48,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 03:10:48,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 03:10:48,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2018-01-30 03:10:48,333 INFO L87 Difference]: Start difference. First operand 230 states and 272 transitions. Second operand 30 states. [2018-01-30 03:10:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:49,780 INFO L93 Difference]: Finished difference Result 432 states and 517 transitions. [2018-01-30 03:10:49,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-30 03:10:49,782 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-01-30 03:10:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:49,783 INFO L225 Difference]: With dead ends: 432 [2018-01-30 03:10:49,783 INFO L226 Difference]: Without dead ends: 340 [2018-01-30 03:10:49,784 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=593, Invalid=2269, Unknown=0, NotChecked=0, Total=2862 [2018-01-30 03:10:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-30 03:10:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 239. [2018-01-30 03:10:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-30 03:10:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2018-01-30 03:10:49,808 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 79 [2018-01-30 03:10:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:49,808 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2018-01-30 03:10:49,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 03:10:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2018-01-30 03:10:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 03:10:49,809 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:49,809 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:49,809 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:49,809 INFO L82 PathProgramCache]: Analyzing trace with hash 821573550, now seen corresponding path program 5 times [2018-01-30 03:10:49,809 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:49,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:49,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:49,810 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:49,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:49,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 2 proven. 242 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:50,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:50,188 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:50,194 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:10:50,202 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,203 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,204 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,205 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,205 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,206 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,207 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,207 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,208 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,209 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,210 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,212 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:50,213 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:50,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:10:50,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:50,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-01-30 03:10:50,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 03:10:50,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 03:10:50,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-30 03:10:50,242 INFO L87 Difference]: Start difference. First operand 239 states and 283 transitions. Second operand 15 states. [2018-01-30 03:10:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:50,493 INFO L93 Difference]: Finished difference Result 358 states and 425 transitions. [2018-01-30 03:10:50,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 03:10:50,493 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2018-01-30 03:10:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:50,494 INFO L225 Difference]: With dead ends: 358 [2018-01-30 03:10:50,494 INFO L226 Difference]: Without dead ends: 266 [2018-01-30 03:10:50,494 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2018-01-30 03:10:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-30 03:10:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 252. [2018-01-30 03:10:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-30 03:10:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 299 transitions. [2018-01-30 03:10:50,503 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 299 transitions. Word has length 83 [2018-01-30 03:10:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:50,504 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 299 transitions. [2018-01-30 03:10:50,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 03:10:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 299 transitions. [2018-01-30 03:10:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 03:10:50,504 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:50,504 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:50,504 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash -54474918, now seen corresponding path program 6 times [2018-01-30 03:10:50,504 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:50,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:50,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:50,505 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:50,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:50,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 288 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:50,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:50,609 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:50,614 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:10:50,619 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:10:50,620 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:10:50,622 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:10:50,624 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:10:50,625 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:10:50,626 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:10:50,627 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:10:50,628 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:50,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:50,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:50,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:50,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:50,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:50,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:50,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2018-01-30 03:10:50,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 03:10:50,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:10:50,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:37 [2018-01-30 03:10:50,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:50,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:50,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:50,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-01-30 03:10:50,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:10:50,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:10:50,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2018-01-30 03:10:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 116 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-01-30 03:10:50,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:50,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-01-30 03:10:50,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 03:10:50,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 03:10:50,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-01-30 03:10:50,983 INFO L87 Difference]: Start difference. First operand 252 states and 299 transitions. Second operand 30 states. [2018-01-30 03:10:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:53,123 INFO L93 Difference]: Finished difference Result 576 states and 683 transitions. [2018-01-30 03:10:53,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-01-30 03:10:53,124 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-01-30 03:10:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:53,125 INFO L225 Difference]: With dead ends: 576 [2018-01-30 03:10:53,125 INFO L226 Difference]: Without dead ends: 484 [2018-01-30 03:10:53,128 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2969 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=7160, Unknown=0, NotChecked=0, Total=8930 [2018-01-30 03:10:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-01-30 03:10:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 403. [2018-01-30 03:10:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-01-30 03:10:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 477 transitions. [2018-01-30 03:10:53,142 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 477 transitions. Word has length 87 [2018-01-30 03:10:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:53,143 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 477 transitions. [2018-01-30 03:10:53,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 03:10:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 477 transitions. [2018-01-30 03:10:53,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-30 03:10:53,144 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:53,144 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 11, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:53,144 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:53,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1058096270, now seen corresponding path program 7 times [2018-01-30 03:10:53,144 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:53,144 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:53,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:53,144 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:53,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:53,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 339 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:53,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:53,277 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:53,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:53,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 339 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:10:53,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:53,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-01-30 03:10:53,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 03:10:53,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 03:10:53,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-30 03:10:53,315 INFO L87 Difference]: Start difference. First operand 403 states and 477 transitions. Second operand 17 states. [2018-01-30 03:10:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:53,514 INFO L93 Difference]: Finished difference Result 572 states and 676 transitions. [2018-01-30 03:10:53,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 03:10:53,515 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 92 [2018-01-30 03:10:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:53,516 INFO L225 Difference]: With dead ends: 572 [2018-01-30 03:10:53,516 INFO L226 Difference]: Without dead ends: 444 [2018-01-30 03:10:53,516 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2018-01-30 03:10:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-01-30 03:10:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 425. [2018-01-30 03:10:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-01-30 03:10:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 504 transitions. [2018-01-30 03:10:53,541 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 504 transitions. Word has length 92 [2018-01-30 03:10:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:53,541 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 504 transitions. [2018-01-30 03:10:53,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 03:10:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 504 transitions. [2018-01-30 03:10:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-30 03:10:53,543 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:53,543 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:53,543 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash -494417634, now seen corresponding path program 8 times [2018-01-30 03:10:53,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:53,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:53,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:53,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:10:53,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:53,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 2 proven. 393 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:53,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:53,666 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:53,671 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:10:53,675 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:53,679 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:10:53,680 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:53,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 393 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:10:53,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:53,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-01-30 03:10:53,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 03:10:53,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 03:10:53,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-01-30 03:10:53,706 INFO L87 Difference]: Start difference. First operand 425 states and 504 transitions. Second operand 18 states. [2018-01-30 03:10:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:54,606 INFO L93 Difference]: Finished difference Result 594 states and 703 transitions. [2018-01-30 03:10:54,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 03:10:54,607 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2018-01-30 03:10:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:54,608 INFO L225 Difference]: With dead ends: 594 [2018-01-30 03:10:54,608 INFO L226 Difference]: Without dead ends: 466 [2018-01-30 03:10:54,608 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 03:10:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-01-30 03:10:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 447. [2018-01-30 03:10:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-01-30 03:10:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 531 transitions. [2018-01-30 03:10:54,624 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 531 transitions. Word has length 96 [2018-01-30 03:10:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:54,624 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 531 transitions. [2018-01-30 03:10:54,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 03:10:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 531 transitions. [2018-01-30 03:10:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-30 03:10:54,625 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:54,625 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 13, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:10:54,625 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1347035338, now seen corresponding path program 9 times [2018-01-30 03:10:54,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:54,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:54,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:54,626 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:54,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:54,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 2 proven. 451 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:10:54,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:54,803 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:54,808 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:10:54,812 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:54,814 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:54,815 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:54,816 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:54,818 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:10:54,818 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:54,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:54,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2018-01-30 03:10:54,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 03:10:54,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:10:54,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:33 [2018-01-30 03:10:54,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:54,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2018-01-30 03:10:54,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:10:54,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:10:54,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-01-30 03:10:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 2 proven. 150 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-01-30 03:10:55,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:55,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2018-01-30 03:10:55,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 03:10:55,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 03:10:55,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 03:10:55,178 INFO L87 Difference]: Start difference. First operand 447 states and 531 transitions. Second operand 34 states. [2018-01-30 03:10:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:56,933 INFO L93 Difference]: Finished difference Result 753 states and 890 transitions. [2018-01-30 03:10:56,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-01-30 03:10:56,933 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 100 [2018-01-30 03:10:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:56,935 INFO L225 Difference]: With dead ends: 753 [2018-01-30 03:10:56,935 INFO L226 Difference]: Without dead ends: 625 [2018-01-30 03:10:56,937 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4674 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2645, Invalid=10465, Unknown=0, NotChecked=0, Total=13110 [2018-01-30 03:10:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-01-30 03:10:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2018-01-30 03:10:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-01-30 03:10:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 466 transitions. [2018-01-30 03:10:56,974 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 466 transitions. Word has length 100 [2018-01-30 03:10:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:56,974 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 466 transitions. [2018-01-30 03:10:56,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 03:10:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 466 transitions. [2018-01-30 03:10:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-30 03:10:56,975 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:56,975 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 3, 3, 3, 3, 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] [2018-01-30 03:10:56,975 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:56,975 INFO L82 PathProgramCache]: Analyzing trace with hash -670891863, now seen corresponding path program 4 times [2018-01-30 03:10:56,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:56,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:56,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:56,976 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:56,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:56,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 4 proven. 512 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:10:57,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:57,303 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:57,324 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:10:57,339 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:57,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 3 proven. 122 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-01-30 03:10:57,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:57,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-01-30 03:10:57,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 03:10:57,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 03:10:57,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 03:10:57,551 INFO L87 Difference]: Start difference. First operand 391 states and 466 transitions. Second operand 34 states. [2018-01-30 03:10:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:10:58,448 INFO L93 Difference]: Finished difference Result 664 states and 793 transitions. [2018-01-30 03:10:58,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-30 03:10:58,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 109 [2018-01-30 03:10:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:10:58,450 INFO L225 Difference]: With dead ends: 664 [2018-01-30 03:10:58,450 INFO L226 Difference]: Without dead ends: 544 [2018-01-30 03:10:58,452 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1157, Invalid=3955, Unknown=0, NotChecked=0, Total=5112 [2018-01-30 03:10:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-01-30 03:10:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 435. [2018-01-30 03:10:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-01-30 03:10:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 515 transitions. [2018-01-30 03:10:58,481 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 515 transitions. Word has length 109 [2018-01-30 03:10:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:10:58,481 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 515 transitions. [2018-01-30 03:10:58,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 03:10:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 515 transitions. [2018-01-30 03:10:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-30 03:10:58,486 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:10:58,486 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 03:10:58,486 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:10:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash -610650661, now seen corresponding path program 10 times [2018-01-30 03:10:58,486 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:10:58,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:10:58,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:58,487 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:10:58,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:10:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:10:58,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:10:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 4 proven. 578 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:10:59,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:10:59,016 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:10:59,021 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:10:59,030 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:10:59,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:10:59,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:59,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:59,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:59,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 40 [2018-01-30 03:10:59,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:10:59,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:10:59,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:20 [2018-01-30 03:10:59,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:59,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:59,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:10:59,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 40 [2018-01-30 03:10:59,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:10:59,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:10:59,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-01-30 03:10:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 4 proven. 125 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-01-30 03:10:59,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:10:59,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2018-01-30 03:10:59,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 03:10:59,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 03:10:59,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 03:10:59,291 INFO L87 Difference]: Start difference. First operand 435 states and 515 transitions. Second operand 36 states. [2018-01-30 03:11:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:00,050 INFO L93 Difference]: Finished difference Result 658 states and 772 transitions. [2018-01-30 03:11:00,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-01-30 03:11:00,051 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 117 [2018-01-30 03:11:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:00,053 INFO L225 Difference]: With dead ends: 658 [2018-01-30 03:11:00,053 INFO L226 Difference]: Without dead ends: 511 [2018-01-30 03:11:00,054 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=4275, Unknown=0, NotChecked=0, Total=5550 [2018-01-30 03:11:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-01-30 03:11:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 441. [2018-01-30 03:11:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-01-30 03:11:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 525 transitions. [2018-01-30 03:11:00,077 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 525 transitions. Word has length 117 [2018-01-30 03:11:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:00,078 INFO L432 AbstractCegarLoop]: Abstraction has 441 states and 525 transitions. [2018-01-30 03:11:00,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 03:11:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 525 transitions. [2018-01-30 03:11:00,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-30 03:11:00,078 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:00,078 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 03:11:00,079 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:00,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2005996719, now seen corresponding path program 11 times [2018-01-30 03:11:00,079 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:00,079 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:00,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:00,079 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:00,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:00,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 4 proven. 648 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:00,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:00,409 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:00,414 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:11:00,416 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,417 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,418 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,418 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,419 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,419 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,420 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,421 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,421 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,422 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,423 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,423 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,424 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,425 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,426 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,426 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,428 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,429 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,432 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:00,432 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:00,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:11:00,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:00,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-01-30 03:11:00,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 03:11:00,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 03:11:00,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-01-30 03:11:00,461 INFO L87 Difference]: Start difference. First operand 441 states and 525 transitions. Second operand 22 states. [2018-01-30 03:11:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:00,706 INFO L93 Difference]: Finished difference Result 610 states and 722 transitions. [2018-01-30 03:11:00,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 03:11:00,707 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2018-01-30 03:11:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:00,708 INFO L225 Difference]: With dead ends: 610 [2018-01-30 03:11:00,708 INFO L226 Difference]: Without dead ends: 474 [2018-01-30 03:11:00,709 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 03:11:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-01-30 03:11:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 458. [2018-01-30 03:11:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-01-30 03:11:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 546 transitions. [2018-01-30 03:11:00,728 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 546 transitions. Word has length 121 [2018-01-30 03:11:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:00,728 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 546 transitions. [2018-01-30 03:11:00,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 03:11:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 546 transitions. [2018-01-30 03:11:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-01-30 03:11:00,729 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:00,729 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 03:11:00,729 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash 743167835, now seen corresponding path program 12 times [2018-01-30 03:11:00,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:00,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:00,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:00,730 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:00,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:00,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 4 proven. 722 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:00,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:00,899 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:00,904 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:11:00,908 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,909 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,911 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,912 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,914 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,916 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,922 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,924 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,928 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,931 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,935 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,938 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,941 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,943 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,946 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:00,946 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:00,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:01,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:01,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:01,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-01-30 03:11:01,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:01,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:11:01,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:20 [2018-01-30 03:11:01,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:01,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:01,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-01-30 03:11:01,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:01,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:11:01,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-01-30 03:11:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 4 proven. 139 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2018-01-30 03:11:01,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:01,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 39 [2018-01-30 03:11:01,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 03:11:01,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 03:11:01,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=1105, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 03:11:01,260 INFO L87 Difference]: Start difference. First operand 458 states and 546 transitions. Second operand 39 states. [2018-01-30 03:11:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:02,113 INFO L93 Difference]: Finished difference Result 764 states and 907 transitions. [2018-01-30 03:11:02,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-01-30 03:11:02,113 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 125 [2018-01-30 03:11:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:02,115 INFO L225 Difference]: With dead ends: 764 [2018-01-30 03:11:02,115 INFO L226 Difference]: Without dead ends: 628 [2018-01-30 03:11:02,116 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1613, Invalid=5193, Unknown=0, NotChecked=0, Total=6806 [2018-01-30 03:11:02,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-01-30 03:11:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 572. [2018-01-30 03:11:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-01-30 03:11:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 684 transitions. [2018-01-30 03:11:02,143 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 684 transitions. Word has length 125 [2018-01-30 03:11:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:02,143 INFO L432 AbstractCegarLoop]: Abstraction has 572 states and 684 transitions. [2018-01-30 03:11:02,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 03:11:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 684 transitions. [2018-01-30 03:11:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-01-30 03:11:02,144 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:02,144 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 03:11:02,144 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1825529297, now seen corresponding path program 13 times [2018-01-30 03:11:02,144 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:02,144 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:02,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:02,145 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:02,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:02,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 4 proven. 800 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:02,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:02,353 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:02,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:11:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:02,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:11:02,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:02,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-01-30 03:11:02,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 03:11:02,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 03:11:02,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-01-30 03:11:02,412 INFO L87 Difference]: Start difference. First operand 572 states and 684 transitions. Second operand 24 states. [2018-01-30 03:11:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:02,788 INFO L93 Difference]: Finished difference Result 768 states and 912 transitions. [2018-01-30 03:11:02,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 03:11:02,788 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 129 [2018-01-30 03:11:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:02,790 INFO L225 Difference]: With dead ends: 768 [2018-01-30 03:11:02,790 INFO L226 Difference]: Without dead ends: 611 [2018-01-30 03:11:02,790 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 03:11:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-01-30 03:11:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 593. [2018-01-30 03:11:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 03:11:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 710 transitions. [2018-01-30 03:11:02,817 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 710 transitions. Word has length 129 [2018-01-30 03:11:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:02,817 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 710 transitions. [2018-01-30 03:11:02,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 03:11:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 710 transitions. [2018-01-30 03:11:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-30 03:11:02,818 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:02,818 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 03:11:02,818 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:02,818 INFO L82 PathProgramCache]: Analyzing trace with hash 711501019, now seen corresponding path program 14 times [2018-01-30 03:11:02,818 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:02,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:02,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:02,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:11:02,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:02,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 4 proven. 882 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:03,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:03,338 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:03,343 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:11:03,347 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:03,353 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:03,355 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:03,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:11:03,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:03,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-01-30 03:11:03,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 03:11:03,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 03:11:03,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-01-30 03:11:03,395 INFO L87 Difference]: Start difference. First operand 593 states and 710 transitions. Second operand 25 states. [2018-01-30 03:11:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:03,715 INFO L93 Difference]: Finished difference Result 789 states and 938 transitions. [2018-01-30 03:11:03,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 03:11:03,715 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2018-01-30 03:11:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:03,716 INFO L225 Difference]: With dead ends: 789 [2018-01-30 03:11:03,716 INFO L226 Difference]: Without dead ends: 632 [2018-01-30 03:11:03,717 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 03:11:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-01-30 03:11:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 614. [2018-01-30 03:11:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-01-30 03:11:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 736 transitions. [2018-01-30 03:11:03,744 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 736 transitions. Word has length 133 [2018-01-30 03:11:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:03,744 INFO L432 AbstractCegarLoop]: Abstraction has 614 states and 736 transitions. [2018-01-30 03:11:03,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 03:11:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 736 transitions. [2018-01-30 03:11:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-01-30 03:11:03,745 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:03,745 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 03:11:03,745 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1958252153, now seen corresponding path program 15 times [2018-01-30 03:11:03,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:03,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:03,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:03,746 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:03,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:03,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 4 proven. 968 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:03,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:03,949 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:03,954 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:11:03,958 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,960 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,962 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,963 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,964 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,966 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,968 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,969 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,971 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,972 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,973 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,975 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:03,976 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:03,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:04,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-01-30 03:11:04,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 03:11:04,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:11:04,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:29 [2018-01-30 03:11:04,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:04,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2018-01-30 03:11:04,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:04,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:11:04,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:26 [2018-01-30 03:11:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 4 proven. 239 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2018-01-30 03:11:04,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:04,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 44 [2018-01-30 03:11:04,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-30 03:11:04,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-30 03:11:04,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=1383, Unknown=0, NotChecked=0, Total=1892 [2018-01-30 03:11:04,401 INFO L87 Difference]: Start difference. First operand 614 states and 736 transitions. Second operand 44 states. [2018-01-30 03:11:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:05,730 INFO L93 Difference]: Finished difference Result 957 states and 1140 transitions. [2018-01-30 03:11:05,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-01-30 03:11:05,730 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 137 [2018-01-30 03:11:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:05,732 INFO L225 Difference]: With dead ends: 957 [2018-01-30 03:11:05,732 INFO L226 Difference]: Without dead ends: 800 [2018-01-30 03:11:05,733 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2617 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2069, Invalid=6487, Unknown=0, NotChecked=0, Total=8556 [2018-01-30 03:11:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-01-30 03:11:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 636. [2018-01-30 03:11:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-01-30 03:11:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 763 transitions. [2018-01-30 03:11:05,762 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 763 transitions. Word has length 137 [2018-01-30 03:11:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:05,762 INFO L432 AbstractCegarLoop]: Abstraction has 636 states and 763 transitions. [2018-01-30 03:11:05,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-30 03:11:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 763 transitions. [2018-01-30 03:11:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-30 03:11:05,763 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:05,763 INFO L350 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 03:11:05,763 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:05,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1546740133, now seen corresponding path program 16 times [2018-01-30 03:11:05,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:05,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:05,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:05,763 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:05,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:05,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 4 proven. 1058 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:06,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:06,113 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:06,118 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:11:06,132 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:06,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:06,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 67 [2018-01-30 03:11:06,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 03:11:06,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:11:06,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-01-30 03:11:06,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:06,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 80 [2018-01-30 03:11:06,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-01-30 03:11:06,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 03:11:06,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:55 [2018-01-30 03:11:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 3 proven. 333 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2018-01-30 03:11:07,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:07,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2018-01-30 03:11:07,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 03:11:07,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 03:11:07,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=1622, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 03:11:07,542 INFO L87 Difference]: Start difference. First operand 636 states and 763 transitions. Second operand 47 states. [2018-01-30 03:11:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:09,189 INFO L93 Difference]: Finished difference Result 986 states and 1179 transitions. [2018-01-30 03:11:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-30 03:11:09,189 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 141 [2018-01-30 03:11:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:09,190 INFO L225 Difference]: With dead ends: 986 [2018-01-30 03:11:09,190 INFO L226 Difference]: Without dead ends: 829 [2018-01-30 03:11:09,191 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2109, Invalid=7203, Unknown=0, NotChecked=0, Total=9312 [2018-01-30 03:11:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-01-30 03:11:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 662. [2018-01-30 03:11:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-01-30 03:11:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 795 transitions. [2018-01-30 03:11:09,223 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 795 transitions. Word has length 141 [2018-01-30 03:11:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:09,223 INFO L432 AbstractCegarLoop]: Abstraction has 662 states and 795 transitions. [2018-01-30 03:11:09,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 03:11:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 795 transitions. [2018-01-30 03:11:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-01-30 03:11:09,224 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:09,224 INFO L350 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 03:11:09,224 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:09,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1735704273, now seen corresponding path program 17 times [2018-01-30 03:11:09,224 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:09,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:09,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:09,226 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:09,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:09,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 4 proven. 1152 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:09,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:09,800 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:09,809 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:11:09,811 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,812 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,813 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,813 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,814 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,815 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,815 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,816 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,817 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,817 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,818 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,819 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,820 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,820 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,821 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,822 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,823 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,823 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,824 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,825 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,826 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,827 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,828 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,833 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,835 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:09,836 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:09,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:11:09,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:09,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-01-30 03:11:09,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 03:11:09,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 03:11:09,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-01-30 03:11:09,867 INFO L87 Difference]: Start difference. First operand 662 states and 795 transitions. Second operand 28 states. [2018-01-30 03:11:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:10,247 INFO L93 Difference]: Finished difference Result 858 states and 1023 transitions. [2018-01-30 03:11:10,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 03:11:10,248 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 145 [2018-01-30 03:11:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:10,249 INFO L225 Difference]: With dead ends: 858 [2018-01-30 03:11:10,250 INFO L226 Difference]: Without dead ends: 701 [2018-01-30 03:11:10,250 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 03:11:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-01-30 03:11:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 683. [2018-01-30 03:11:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-01-30 03:11:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 821 transitions. [2018-01-30 03:11:10,283 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 821 transitions. Word has length 145 [2018-01-30 03:11:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:10,283 INFO L432 AbstractCegarLoop]: Abstraction has 683 states and 821 transitions. [2018-01-30 03:11:10,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 03:11:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 821 transitions. [2018-01-30 03:11:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-30 03:11:10,284 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:10,284 INFO L350 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 03:11:10,284 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1285831717, now seen corresponding path program 18 times [2018-01-30 03:11:10,284 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:10,284 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:10,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:10,285 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:10,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:10,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 4 proven. 1250 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:10,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:10,796 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:10,803 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:11:10,807 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,808 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,810 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,811 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,813 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,815 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,816 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,818 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,820 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,821 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,823 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,826 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,828 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,829 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,831 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:10,832 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:10,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:11,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:11,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:11,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:11,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:11,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:11,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2018-01-30 03:11:11,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 03:11:11,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:11:11,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:37 [2018-01-30 03:11:11,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:11,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:11,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:11,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-01-30 03:11:11,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:11,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:11:11,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2018-01-30 03:11:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 4 proven. 858 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-01-30 03:11:11,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:11,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 53 [2018-01-30 03:11:11,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-30 03:11:11,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-30 03:11:11,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=2193, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 03:11:11,475 INFO L87 Difference]: Start difference. First operand 683 states and 821 transitions. Second operand 53 states. [2018-01-30 03:11:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:22,836 INFO L93 Difference]: Finished difference Result 1867 states and 2234 transitions. [2018-01-30 03:11:22,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 419 states. [2018-01-30 03:11:22,836 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 149 [2018-01-30 03:11:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:22,839 INFO L225 Difference]: With dead ends: 1867 [2018-01-30 03:11:22,839 INFO L226 Difference]: Without dead ends: 1710 [2018-01-30 03:11:22,846 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90156 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=21512, Invalid=180538, Unknown=0, NotChecked=0, Total=202050 [2018-01-30 03:11:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2018-01-30 03:11:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 818. [2018-01-30 03:11:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-01-30 03:11:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 984 transitions. [2018-01-30 03:11:22,890 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 984 transitions. Word has length 149 [2018-01-30 03:11:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:22,890 INFO L432 AbstractCegarLoop]: Abstraction has 818 states and 984 transitions. [2018-01-30 03:11:22,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-30 03:11:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 984 transitions. [2018-01-30 03:11:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-30 03:11:22,891 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:22,891 INFO L350 BasicCegarLoop]: trace histogram [27, 26, 26, 24, 3, 3, 3, 3, 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, 1] [2018-01-30 03:11:22,891 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:22,892 INFO L82 PathProgramCache]: Analyzing trace with hash 563390331, now seen corresponding path program 19 times [2018-01-30 03:11:22,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:22,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:22,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:22,892 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:22,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:22,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 4 proven. 1353 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:23,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:23,169 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:23,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:11:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:23,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1353 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:11:23,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:23,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-01-30 03:11:23,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 03:11:23,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 03:11:23,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2018-01-30 03:11:23,234 INFO L87 Difference]: Start difference. First operand 818 states and 984 transitions. Second operand 30 states. [2018-01-30 03:11:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:23,692 INFO L93 Difference]: Finished difference Result 1022 states and 1223 transitions. [2018-01-30 03:11:23,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-30 03:11:23,692 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 154 [2018-01-30 03:11:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:23,693 INFO L225 Difference]: With dead ends: 1022 [2018-01-30 03:11:23,694 INFO L226 Difference]: Without dead ends: 865 [2018-01-30 03:11:23,694 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2018-01-30 03:11:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-01-30 03:11:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 844. [2018-01-30 03:11:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-01-30 03:11:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1016 transitions. [2018-01-30 03:11:23,736 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1016 transitions. Word has length 154 [2018-01-30 03:11:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:23,736 INFO L432 AbstractCegarLoop]: Abstraction has 844 states and 1016 transitions. [2018-01-30 03:11:23,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 03:11:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1016 transitions. [2018-01-30 03:11:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-01-30 03:11:23,737 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:23,737 INFO L350 BasicCegarLoop]: trace histogram [28, 27, 27, 25, 3, 3, 3, 3, 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, 1] [2018-01-30 03:11:23,737 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:23,737 INFO L82 PathProgramCache]: Analyzing trace with hash 829498407, now seen corresponding path program 20 times [2018-01-30 03:11:23,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:23,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:23,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:23,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:11:23,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:23,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 4 proven. 1459 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:23,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:23,998 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:24,003 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:11:24,008 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:24,015 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:24,017 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:24,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 0 proven. 1459 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:11:24,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:24,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-01-30 03:11:24,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 03:11:24,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 03:11:24,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-01-30 03:11:24,051 INFO L87 Difference]: Start difference. First operand 844 states and 1016 transitions. Second operand 31 states. [2018-01-30 03:11:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:24,565 INFO L93 Difference]: Finished difference Result 1048 states and 1255 transitions. [2018-01-30 03:11:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 03:11:24,565 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 158 [2018-01-30 03:11:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:24,567 INFO L225 Difference]: With dead ends: 1048 [2018-01-30 03:11:24,567 INFO L226 Difference]: Without dead ends: 891 [2018-01-30 03:11:24,568 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2018-01-30 03:11:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-01-30 03:11:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 870. [2018-01-30 03:11:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-01-30 03:11:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1048 transitions. [2018-01-30 03:11:24,631 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1048 transitions. Word has length 158 [2018-01-30 03:11:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:24,631 INFO L432 AbstractCegarLoop]: Abstraction has 870 states and 1048 transitions. [2018-01-30 03:11:24,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 03:11:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1048 transitions. [2018-01-30 03:11:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-01-30 03:11:24,632 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:24,632 INFO L350 BasicCegarLoop]: trace histogram [29, 28, 28, 26, 3, 3, 3, 3, 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, 1] [2018-01-30 03:11:24,632 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -802723117, now seen corresponding path program 21 times [2018-01-30 03:11:24,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:24,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:24,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:24,633 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:24,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:24,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 4 proven. 1569 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:25,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:25,006 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:25,011 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:11:25,015 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:25,017 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:25,019 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:25,020 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:25,022 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:11:25,027 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:25,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:25,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:25,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:25,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:25,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:25,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 49 [2018-01-30 03:11:25,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:25,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:11:25,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-01-30 03:11:25,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:25,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:25,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:25,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:25,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 48 [2018-01-30 03:11:25,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:25,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:11:25,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-01-30 03:11:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 6 proven. 204 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2018-01-30 03:11:25,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:25,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 20] total 50 [2018-01-30 03:11:25,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-30 03:11:25,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-30 03:11:25,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=1794, Unknown=0, NotChecked=0, Total=2450 [2018-01-30 03:11:25,378 INFO L87 Difference]: Start difference. First operand 870 states and 1048 transitions. Second operand 50 states. [2018-01-30 03:11:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:27,096 INFO L93 Difference]: Finished difference Result 1123 states and 1345 transitions. [2018-01-30 03:11:27,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-30 03:11:27,096 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 162 [2018-01-30 03:11:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:27,098 INFO L225 Difference]: With dead ends: 1123 [2018-01-30 03:11:27,098 INFO L226 Difference]: Without dead ends: 966 [2018-01-30 03:11:27,099 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3869 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3106, Invalid=9776, Unknown=0, NotChecked=0, Total=12882 [2018-01-30 03:11:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-01-30 03:11:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 763. [2018-01-30 03:11:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-01-30 03:11:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 918 transitions. [2018-01-30 03:11:27,138 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 918 transitions. Word has length 162 [2018-01-30 03:11:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:27,139 INFO L432 AbstractCegarLoop]: Abstraction has 763 states and 918 transitions. [2018-01-30 03:11:27,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-01-30 03:11:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 918 transitions. [2018-01-30 03:11:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-01-30 03:11:27,140 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:27,140 INFO L350 BasicCegarLoop]: trace histogram [30, 29, 29, 27, 3, 3, 3, 3, 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, 1] [2018-01-30 03:11:27,140 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:27,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1315453529, now seen corresponding path program 22 times [2018-01-30 03:11:27,140 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:27,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:27,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:27,140 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:27,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:27,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 4 proven. 1683 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:27,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:27,549 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:27,553 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:11:27,575 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:27,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:27,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 55 [2018-01-30 03:11:27,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:27,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:11:27,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-30 03:11:27,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:27,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-01-30 03:11:27,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:27,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:11:27,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:15 [2018-01-30 03:11:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 6 proven. 318 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2018-01-30 03:11:28,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:28,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21] total 52 [2018-01-30 03:11:28,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-30 03:11:28,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-30 03:11:28,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=696, Invalid=1956, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 03:11:28,015 INFO L87 Difference]: Start difference. First operand 763 states and 918 transitions. Second operand 52 states. [2018-01-30 03:11:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:30,833 INFO L93 Difference]: Finished difference Result 1405 states and 1690 transitions. [2018-01-30 03:11:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-01-30 03:11:30,833 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 166 [2018-01-30 03:11:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:30,836 INFO L225 Difference]: With dead ends: 1405 [2018-01-30 03:11:30,836 INFO L226 Difference]: Without dead ends: 1269 [2018-01-30 03:11:30,837 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7391 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5123, Invalid=17227, Unknown=0, NotChecked=0, Total=22350 [2018-01-30 03:11:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2018-01-30 03:11:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 781. [2018-01-30 03:11:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-01-30 03:11:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 940 transitions. [2018-01-30 03:11:30,902 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 940 transitions. Word has length 166 [2018-01-30 03:11:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:30,902 INFO L432 AbstractCegarLoop]: Abstraction has 781 states and 940 transitions. [2018-01-30 03:11:30,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-30 03:11:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 940 transitions. [2018-01-30 03:11:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-01-30 03:11:30,903 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:30,903 INFO L350 BasicCegarLoop]: trace histogram [31, 30, 30, 28, 3, 3, 3, 3, 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, 1] [2018-01-30 03:11:30,903 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1390874837, now seen corresponding path program 23 times [2018-01-30 03:11:30,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:30,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:30,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:30,904 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:30,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:30,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 4 proven. 1801 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:31,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:31,272 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:31,276 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:11:31,281 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,281 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,282 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,284 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,284 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,285 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,286 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,286 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,287 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,288 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,288 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,289 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,290 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,290 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,291 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,292 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,293 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,294 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,294 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,295 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,296 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,297 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,298 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,299 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,300 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,301 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,302 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,304 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,305 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,308 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:31,309 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:31,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 0 proven. 1801 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:11:31,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:31,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-01-30 03:11:31,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 03:11:31,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 03:11:31,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 03:11:31,349 INFO L87 Difference]: Start difference. First operand 781 states and 940 transitions. Second operand 34 states. [2018-01-30 03:11:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:31,893 INFO L93 Difference]: Finished difference Result 958 states and 1148 transitions. [2018-01-30 03:11:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 03:11:31,893 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 170 [2018-01-30 03:11:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:31,895 INFO L225 Difference]: With dead ends: 958 [2018-01-30 03:11:31,895 INFO L226 Difference]: Without dead ends: 822 [2018-01-30 03:11:31,896 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2018-01-30 03:11:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2018-01-30 03:11:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 803. [2018-01-30 03:11:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-01-30 03:11:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 967 transitions. [2018-01-30 03:11:31,938 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 967 transitions. Word has length 170 [2018-01-30 03:11:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:31,938 INFO L432 AbstractCegarLoop]: Abstraction has 803 states and 967 transitions. [2018-01-30 03:11:31,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 03:11:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 967 transitions. [2018-01-30 03:11:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-01-30 03:11:31,939 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:31,939 INFO L350 BasicCegarLoop]: trace histogram [32, 31, 31, 29, 3, 3, 3, 3, 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, 1] [2018-01-30 03:11:31,939 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:31,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1294603223, now seen corresponding path program 24 times [2018-01-30 03:11:31,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:31,940 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:31,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:31,940 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:31,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:31,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 4 proven. 1923 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:32,596 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:32,596 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:32,600 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:11:32,604 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,606 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,607 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,608 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,611 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,614 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,615 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,618 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,620 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,622 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,625 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,628 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,632 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,634 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,637 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,639 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,641 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:11:32,642 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:32,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:33,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:33,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:33,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:33,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:33,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 48 [2018-01-30 03:11:33,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:33,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:11:33,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2018-01-30 03:11:33,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:33,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:33,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:33,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:11:33,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 50 [2018-01-30 03:11:33,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:11:33,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:11:33,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-01-30 03:11:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 4 proven. 339 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2018-01-30 03:11:34,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:34,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19] total 52 [2018-01-30 03:11:34,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-30 03:11:34,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-30 03:11:34,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1865, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 03:11:34,072 INFO L87 Difference]: Start difference. First operand 803 states and 967 transitions. Second operand 52 states. [2018-01-30 03:11:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:35,731 INFO L93 Difference]: Finished difference Result 1166 states and 1398 transitions. [2018-01-30 03:11:35,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-01-30 03:11:35,732 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 174 [2018-01-30 03:11:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:35,734 INFO L225 Difference]: With dead ends: 1166 [2018-01-30 03:11:35,734 INFO L226 Difference]: Without dead ends: 1030 [2018-01-30 03:11:35,735 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4075 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3571, Invalid=10235, Unknown=0, NotChecked=0, Total=13806 [2018-01-30 03:11:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-01-30 03:11:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 825. [2018-01-30 03:11:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-01-30 03:11:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 994 transitions. [2018-01-30 03:11:35,780 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 994 transitions. Word has length 174 [2018-01-30 03:11:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:35,780 INFO L432 AbstractCegarLoop]: Abstraction has 825 states and 994 transitions. [2018-01-30 03:11:35,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-30 03:11:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 994 transitions. [2018-01-30 03:11:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-30 03:11:35,781 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:35,781 INFO L350 BasicCegarLoop]: trace histogram [33, 32, 32, 30, 3, 3, 3, 3, 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, 1] [2018-01-30 03:11:35,781 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1165073107, now seen corresponding path program 25 times [2018-01-30 03:11:35,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:35,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:35,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:35,782 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:35,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:35,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2069 backedges. 4 proven. 2049 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:40,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:40,281 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:40,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:11:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:40,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2069 backedges. 0 proven. 2049 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:11:40,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:40,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-01-30 03:11:40,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 03:11:40,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 03:11:40,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 03:11:40,339 INFO L87 Difference]: Start difference. First operand 825 states and 994 transitions. Second operand 36 states. [2018-01-30 03:11:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:40,869 INFO L93 Difference]: Finished difference Result 1002 states and 1202 transitions. [2018-01-30 03:11:40,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 03:11:40,869 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 178 [2018-01-30 03:11:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:40,871 INFO L225 Difference]: With dead ends: 1002 [2018-01-30 03:11:40,871 INFO L226 Difference]: Without dead ends: 866 [2018-01-30 03:11:40,871 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2018-01-30 03:11:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-01-30 03:11:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 847. [2018-01-30 03:11:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-01-30 03:11:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1021 transitions. [2018-01-30 03:11:40,915 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1021 transitions. Word has length 178 [2018-01-30 03:11:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:40,915 INFO L432 AbstractCegarLoop]: Abstraction has 847 states and 1021 transitions. [2018-01-30 03:11:40,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 03:11:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1021 transitions. [2018-01-30 03:11:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-01-30 03:11:40,916 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:40,916 INFO L350 BasicCegarLoop]: trace histogram [34, 33, 33, 31, 3, 3, 3, 3, 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, 1] [2018-01-30 03:11:40,916 INFO L371 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1819585407, now seen corresponding path program 26 times [2018-01-30 03:11:40,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:40,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:40,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:40,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:11:40,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:40,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:11:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2199 backedges. 4 proven. 2179 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:11:41,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:11:41,893 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:11:41,897 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:11:41,903 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:41,912 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:11:41,914 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:11:41,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:11:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2199 backedges. 0 proven. 2179 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:11:41,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:11:41,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-01-30 03:11:41,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 03:11:41,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 03:11:41,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 03:11:41,982 INFO L87 Difference]: Start difference. First operand 847 states and 1021 transitions. Second operand 37 states. [2018-01-30 03:11:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:11:42,563 INFO L93 Difference]: Finished difference Result 1024 states and 1229 transitions. [2018-01-30 03:11:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-30 03:11:42,563 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 182 [2018-01-30 03:11:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:11:42,565 INFO L225 Difference]: With dead ends: 1024 [2018-01-30 03:11:42,565 INFO L226 Difference]: Without dead ends: 888 [2018-01-30 03:11:42,566 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 03:11:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-01-30 03:11:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 869. [2018-01-30 03:11:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-01-30 03:11:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1048 transitions. [2018-01-30 03:11:42,618 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1048 transitions. Word has length 182 [2018-01-30 03:11:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:11:42,618 INFO L432 AbstractCegarLoop]: Abstraction has 869 states and 1048 transitions. [2018-01-30 03:11:42,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 03:11:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1048 transitions. [2018-01-30 03:11:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-01-30 03:11:42,619 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:11:42,619 INFO L350 BasicCegarLoop]: trace histogram [35, 34, 34, 32, 3, 3, 3, 3, 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, 1] [2018-01-30 03:11:42,619 INFO L371 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:11:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1156023851, now seen corresponding path program 27 times [2018-01-30 03:11:42,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:11:42,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:11:42,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:42,619 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:11:42,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:11:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:11:42,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-30 03:11:43,874 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 03:11:43,877 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 03:11:43,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 03:11:43 BasicIcfg [2018-01-30 03:11:43,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 03:11:43,878 INFO L168 Benchmark]: Toolchain (without parser) took 64923.78 ms. Allocated memory was 151.0 MB in the beginning and 861.9 MB in the end (delta: 710.9 MB). Free memory was 116.0 MB in the beginning and 280.2 MB in the end (delta: -164.2 MB). Peak memory consumption was 546.7 MB. Max. memory is 5.3 GB. [2018-01-30 03:11:43,878 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 03:11:43,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 107.73 ms. Allocated memory is still 151.0 MB. Free memory was 115.8 MB in the beginning and 107.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 5.3 GB. [2018-01-30 03:11:43,879 INFO L168 Benchmark]: Boogie Preprocessor took 19.12 ms. Allocated memory is still 151.0 MB. Free memory was 107.4 MB in the beginning and 105.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 03:11:43,879 INFO L168 Benchmark]: RCFGBuilder took 428.35 ms. Allocated memory is still 151.0 MB. Free memory was 105.6 MB in the beginning and 89.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 5.3 GB. [2018-01-30 03:11:43,879 INFO L168 Benchmark]: IcfgTransformer took 12.16 ms. Allocated memory is still 151.0 MB. Free memory was 89.9 MB in the beginning and 88.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-01-30 03:11:43,879 INFO L168 Benchmark]: TraceAbstraction took 64353.75 ms. Allocated memory was 151.0 MB in the beginning and 861.9 MB in the end (delta: 710.9 MB). Free memory was 88.3 MB in the beginning and 280.2 MB in the end (delta: -192.0 MB). Peak memory consumption was 519.0 MB. Max. memory is 5.3 GB. [2018-01-30 03:11:43,880 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 107.73 ms. Allocated memory is still 151.0 MB. Free memory was 115.8 MB in the beginning and 107.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.12 ms. Allocated memory is still 151.0 MB. Free memory was 107.4 MB in the beginning and 105.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 428.35 ms. Allocated memory is still 151.0 MB. Free memory was 105.6 MB in the beginning and 89.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 5.3 GB. * IcfgTransformer took 12.16 ms. Allocated memory is still 151.0 MB. Free memory was 89.9 MB in the beginning and 88.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64353.75 ms. Allocated memory was 151.0 MB in the beginning and 861.9 MB in the end (delta: 710.9 MB). Free memory was 88.3 MB in the beginning and 280.2 MB in the end (delta: -192.0 MB). Peak memory consumption was 519.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 187 with TraceHistMax 35, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 1 error locations. TIMEOUT Result, 64.3s OverallTime, 39 OverallIterations, 35 TraceHistogramMax, 38.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2487 SDtfs, 9403 SDslu, 38808 SDs, 0 SdLazy, 25865 SolverSat, 1548 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5816 GetRequests, 3532 SyntacticMatches, 6 SemanticMatches, 2278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129143 ImplicationChecksByTransitivity, 40.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=870occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 38 MinimizatonAttempts, 3615 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 7610 NumberOfCodeBlocks, 7131 NumberOfCodeBlocksAsserted, 236 NumberOfCheckSat, 7538 ConstructedInterpolants, 205 QuantifiedInterpolants, 5524503 SizeOfPredicates, 176 NumberOfNonLiveVariables, 4657 ConjunctsInSsa, 814 ConjunctsInUnsatCore, 72 InterpolantComputations, 5 PerfectInterpolantSequences, 9436/51299 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sorting_selectionsort_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_03-11-43-884.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sorting_selectionsort_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_03-11-43-884.csv Completed graceful shutdown