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-tiling/revcpyswp2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 05:02:46,239 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 05:02:46,240 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 05:02:46,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 05:02:46,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 05:02:46,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 05:02:46,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 05:02:46,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 05:02:46,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 05:02:46,253 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 05:02:46,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 05:02:46,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 05:02:46,254 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 05:02:46,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 05:02:46,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 05:02:46,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 05:02:46,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 05:02:46,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 05:02:46,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 05:02:46,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 05:02:46,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 05:02:46,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 05:02:46,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 05:02:46,261 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 05:02:46,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 05:02:46,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 05:02:46,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 05:02:46,263 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 05:02:46,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 05:02:46,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 05:02:46,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 05:02:46,263 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 05:02:46,279 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 05:02:46,280 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 05:02:46,280 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 05:02:46,280 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 05:02:46,280 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 05:02:46,280 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 05:02:46,280 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 05:02:46,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 05:02:46,281 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 05:02:46,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 05:02:46,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 05:02:46,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 05:02:46,281 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 05:02:46,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 05:02:46,281 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 05:02:46,281 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 05:02:46,281 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 05:02:46,282 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:02:46,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 05:02:46,282 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 05:02:46,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 05:02:46,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 05:02:46,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 05:02:46,283 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 05:02:46,283 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 05:02:46,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 05:02:46,323 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 05:02:46,327 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 05:02:46,328 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 05:02:46,328 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 05:02:46,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2_true-unreach-call.i [2018-01-30 05:02:46,394 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 05:02:46,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 05:02:46,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 05:02:46,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 05:02:46,399 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 05:02:46,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d35538b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46, skipping insertion in model container [2018-01-30 05:02:46,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,410 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:02:46,419 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:02:46,506 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:02:46,518 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:02:46,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46 WrapperNode [2018-01-30 05:02:46,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 05:02:46,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 05:02:46,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 05:02:46,522 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 05:02:46,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 05:02:46,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 05:02:46,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 05:02:46,543 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 05:02:46,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46" (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 05:02:46,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 05:02:46,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 05:02:46,584 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 05:02:46,584 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 05:02:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 05:02:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 05:02:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 05:02:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 05:02:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 05:02:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 05:02:46,868 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 05:02:46,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:02:46 BoogieIcfgContainer [2018-01-30 05:02:46,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 05:02:46,869 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 05:02:46,869 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 05:02:46,870 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 05:02:46,871 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:02:46" (1/1) ... [2018-01-30 05:02:46,875 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 05:02:46,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:02:46 BasicIcfg [2018-01-30 05:02:46,882 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 05:02:46,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 05:02:46,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 05:02:46,885 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 05:02:46,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 05:02:46" (1/4) ... [2018-01-30 05:02:46,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c95626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:02:46, skipping insertion in model container [2018-01-30 05:02:46,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:02:46" (2/4) ... [2018-01-30 05:02:46,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c95626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:02:46, skipping insertion in model container [2018-01-30 05:02:46,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:02:46" (3/4) ... [2018-01-30 05:02:46,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c95626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:02:46, skipping insertion in model container [2018-01-30 05:02:46,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:02:46" (4/4) ... [2018-01-30 05:02:46,887 INFO L107 eAbstractionObserver]: Analyzing ICFG revcpyswp2_true-unreach-call.ileft_unchanged_by_heapseparator [2018-01-30 05:02:46,892 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 05:02:46,897 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 05:02:46,920 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 05:02:46,920 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 05:02:46,920 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 05:02:46,920 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 05:02:46,920 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 05:02:46,920 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 05:02:46,921 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 05:02:46,921 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 05:02:46,921 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 05:02:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-30 05:02:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 05:02:46,934 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:46,934 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, 1, 1, 1] [2018-01-30 05:02:46,934 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:46,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1432927774, now seen corresponding path program 1 times [2018-01-30 05:02:46,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:46,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:46,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:46,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:02:46,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:46,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:47,011 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 05:02:47,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:02:47,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 05:02:47,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 05:02:47,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 05:02:47,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 05:02:47,023 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-30 05:02:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:47,037 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-01-30 05:02:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 05:02:47,037 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-01-30 05:02:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:47,043 INFO L225 Difference]: With dead ends: 95 [2018-01-30 05:02:47,043 INFO L226 Difference]: Without dead ends: 54 [2018-01-30 05:02:47,045 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 05:02:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-30 05:02:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-30 05:02:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-30 05:02:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-30 05:02:47,076 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2018-01-30 05:02:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:47,076 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-30 05:02:47,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 05:02:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-30 05:02:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 05:02:47,077 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:47,077 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, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:47,079 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash -482140959, now seen corresponding path program 1 times [2018-01-30 05:02:47,079 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:47,079 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:47,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:47,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:02:47,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:47,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:47,222 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 05:02:47,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:02:47,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:02:47,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:02:47,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:02:47,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:02:47,224 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-01-30 05:02:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:47,527 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-01-30 05:02:47,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 05:02:47,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-30 05:02:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:47,529 INFO L225 Difference]: With dead ends: 110 [2018-01-30 05:02:47,529 INFO L226 Difference]: Without dead ends: 79 [2018-01-30 05:02:47,530 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 05:02:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-30 05:02:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-01-30 05:02:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-30 05:02:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-30 05:02:47,537 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2018-01-30 05:02:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:47,537 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-30 05:02:47,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:02:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-30 05:02:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 05:02:47,538 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:47,539 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:47,539 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1240797324, now seen corresponding path program 1 times [2018-01-30 05:02:47,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:47,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:47,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:47,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:02:47,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:47,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:02:47,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:47,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 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 05:02:47,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:02:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:47,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:02:47,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:47,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 05:02:47,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:02:47,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:02:47,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:02:47,804 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2018-01-30 05:02:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:48,180 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-01-30 05:02:48,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 05:02:48,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-01-30 05:02:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:48,181 INFO L225 Difference]: With dead ends: 121 [2018-01-30 05:02:48,181 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 05:02:48,181 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-01-30 05:02:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 05:02:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2018-01-30 05:02:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 05:02:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-01-30 05:02:48,187 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 54 [2018-01-30 05:02:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:48,187 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-01-30 05:02:48,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:02:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-01-30 05:02:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 05:02:48,188 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:48,189 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:48,189 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:48,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1336463840, now seen corresponding path program 2 times [2018-01-30 05:02:48,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:48,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:48,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:48,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:02:48,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:48,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 05:02:48,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:48,326 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 05:02:48,337 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:02:48,353 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:48,367 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:48,368 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:02:48,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 05:02:48,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:48,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 05:02:48,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:02:48,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:02:48,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:02:48,416 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 9 states. [2018-01-30 05:02:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:48,592 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-01-30 05:02:48,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 05:02:48,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-01-30 05:02:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:48,593 INFO L225 Difference]: With dead ends: 114 [2018-01-30 05:02:48,593 INFO L226 Difference]: Without dead ends: 90 [2018-01-30 05:02:48,594 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-01-30 05:02:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-30 05:02:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2018-01-30 05:02:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-30 05:02:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-30 05:02:48,598 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 61 [2018-01-30 05:02:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:48,598 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-30 05:02:48,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:02:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-30 05:02:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 05:02:48,599 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:48,599 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:48,599 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:48,599 INFO L82 PathProgramCache]: Analyzing trace with hash 988987919, now seen corresponding path program 3 times [2018-01-30 05:02:48,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:48,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:48,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:48,600 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:02:48,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:48,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-30 05:02:48,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:48,686 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 05:02:48,690 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:02:48,697 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:02:48,706 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:02:48,714 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:02:48,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-30 05:02:48,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:48,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 05:02:48,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:02:48,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:02:48,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:02:48,806 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 9 states. [2018-01-30 05:02:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:49,026 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-30 05:02:49,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 05:02:49,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-01-30 05:02:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:49,027 INFO L225 Difference]: With dead ends: 106 [2018-01-30 05:02:49,027 INFO L226 Difference]: Without dead ends: 93 [2018-01-30 05:02:49,028 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-01-30 05:02:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-30 05:02:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2018-01-30 05:02:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 05:02:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-30 05:02:49,032 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 69 [2018-01-30 05:02:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:49,032 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-30 05:02:49,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:02:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-30 05:02:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 05:02:49,033 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:49,033 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:49,033 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:49,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1185704159, now seen corresponding path program 4 times [2018-01-30 05:02:49,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:49,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:49,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:49,034 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:02:49,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:49,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:02:49,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:49,743 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 05:02:49,749 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:02:49,765 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:02:49,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:49,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:02:49,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:49,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:49,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 05:02:49,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 05:02:49,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:49,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:49,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:02:49,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-01-30 05:02:49,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:49,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:49,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-01-30 05:02:49,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 05:02:49,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:49,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:49,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-30 05:02:49,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 05:02:49,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:49,977 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 05:02:49,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-01-30 05:02:50,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 05:02:50,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:50,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 05:02:50,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:50,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:50,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-01-30 05:02:50,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:02:50,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:02:50,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:02:50,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:02:50,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:50,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:50,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-01-30 05:02:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:02:50,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:50,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 36 [2018-01-30 05:02:50,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 05:02:50,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 05:02:50,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 05:02:50,208 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 36 states. [2018-01-30 05:02:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:51,422 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2018-01-30 05:02:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 05:02:51,423 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2018-01-30 05:02:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:51,423 INFO L225 Difference]: With dead ends: 158 [2018-01-30 05:02:51,423 INFO L226 Difference]: Without dead ends: 146 [2018-01-30 05:02:51,424 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=614, Invalid=3418, Unknown=0, NotChecked=0, Total=4032 [2018-01-30 05:02:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-30 05:02:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2018-01-30 05:02:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-30 05:02:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-01-30 05:02:51,434 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 77 [2018-01-30 05:02:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:51,434 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-01-30 05:02:51,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 05:02:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-01-30 05:02:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 05:02:51,435 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:51,435 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:51,435 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash -356443644, now seen corresponding path program 1 times [2018-01-30 05:02:51,435 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:51,435 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:51,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:51,436 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:02:51,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:51,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:02:52,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:52,331 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 05:02:52,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:02:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:52,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:52,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:02:52,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 05:02:52,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:02:52,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:02:52,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:02:52,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-01-30 05:02:52,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-01-30 05:02:52,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 05:02:52,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-01-30 05:02:52,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 05:02:52,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 05:02:52,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:02:52,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-01-30 05:02:52,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,646 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 05:02:52,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:22 [2018-01-30 05:02:52,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 05:02:52,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 05:02:52,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:9 [2018-01-30 05:02:52,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-30 05:02:52,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:52,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:1 [2018-01-30 05:02:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:02:52,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:52,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18] total 40 [2018-01-30 05:02:52,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 05:02:52,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 05:02:52,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 05:02:52,860 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 40 states. [2018-01-30 05:02:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:54,701 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2018-01-30 05:02:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-30 05:02:54,701 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 87 [2018-01-30 05:02:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:54,704 INFO L225 Difference]: With dead ends: 214 [2018-01-30 05:02:54,704 INFO L226 Difference]: Without dead ends: 202 [2018-01-30 05:02:54,710 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 73 SyntacticMatches, 11 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=822, Invalid=5820, Unknown=0, NotChecked=0, Total=6642 [2018-01-30 05:02:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-30 05:02:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 159. [2018-01-30 05:02:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-30 05:02:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2018-01-30 05:02:54,727 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 87 [2018-01-30 05:02:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:54,727 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2018-01-30 05:02:54,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 05:02:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2018-01-30 05:02:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-30 05:02:54,739 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:54,739 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:54,739 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1665316285, now seen corresponding path program 5 times [2018-01-30 05:02:54,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:54,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:54,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:54,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:02:54,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:54,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 05:02:54,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:54,909 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 05:02:54,913 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:02:54,918 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:54,921 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:54,923 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:54,948 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:54,953 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:54,967 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:02:54,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-30 05:02:55,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:55,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-30 05:02:55,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 05:02:55,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 05:02:55,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-01-30 05:02:55,098 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand 24 states. [2018-01-30 05:02:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:55,696 INFO L93 Difference]: Finished difference Result 388 states and 413 transitions. [2018-01-30 05:02:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-30 05:02:55,696 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2018-01-30 05:02:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:55,697 INFO L225 Difference]: With dead ends: 388 [2018-01-30 05:02:55,697 INFO L226 Difference]: Without dead ends: 313 [2018-01-30 05:02:55,698 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=2404, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 05:02:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-30 05:02:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 210. [2018-01-30 05:02:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-30 05:02:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-01-30 05:02:55,707 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 93 [2018-01-30 05:02:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:55,707 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-01-30 05:02:55,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 05:02:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-01-30 05:02:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-30 05:02:55,708 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:55,708 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:55,708 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1879878868, now seen corresponding path program 2 times [2018-01-30 05:02:55,708 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:55,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:55,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:55,709 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:02:55,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:55,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 05:02:55,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:55,820 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 05:02:55,825 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:02:55,831 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:55,836 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:55,837 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:02:55,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 05:02:55,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:55,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-01-30 05:02:55,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 05:02:55,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 05:02:55,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-01-30 05:02:55,937 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 18 states. [2018-01-30 05:02:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:56,230 INFO L93 Difference]: Finished difference Result 299 states and 316 transitions. [2018-01-30 05:02:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 05:02:56,230 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-01-30 05:02:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:56,231 INFO L225 Difference]: With dead ends: 299 [2018-01-30 05:02:56,231 INFO L226 Difference]: Without dead ends: 271 [2018-01-30 05:02:56,231 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2018-01-30 05:02:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-30 05:02:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 237. [2018-01-30 05:02:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-30 05:02:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 248 transitions. [2018-01-30 05:02:56,240 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 248 transitions. Word has length 95 [2018-01-30 05:02:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:56,241 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 248 transitions. [2018-01-30 05:02:56,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 05:02:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 248 transitions. [2018-01-30 05:02:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-30 05:02:56,241 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:56,241 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:56,242 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:56,242 INFO L82 PathProgramCache]: Analyzing trace with hash 712663273, now seen corresponding path program 3 times [2018-01-30 05:02:56,242 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:56,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:56,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:56,242 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:02:56,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:56,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-30 05:02:56,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:56,349 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 05:02:56,354 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:02:56,359 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:02:56,364 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:02:56,368 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:02:56,368 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:02:56,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-30 05:02:56,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:56,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-01-30 05:02:56,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 05:02:56,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 05:02:56,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-01-30 05:02:56,456 INFO L87 Difference]: Start difference. First operand 237 states and 248 transitions. Second operand 20 states. [2018-01-30 05:02:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:56,767 INFO L93 Difference]: Finished difference Result 289 states and 301 transitions. [2018-01-30 05:02:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 05:02:56,767 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-01-30 05:02:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:56,768 INFO L225 Difference]: With dead ends: 289 [2018-01-30 05:02:56,768 INFO L226 Difference]: Without dead ends: 208 [2018-01-30 05:02:56,768 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2018-01-30 05:02:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-30 05:02:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 149. [2018-01-30 05:02:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-30 05:02:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-01-30 05:02:56,777 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 97 [2018-01-30 05:02:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:56,777 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-01-30 05:02:56,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 05:02:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-01-30 05:02:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-30 05:02:56,788 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:56,788 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:56,788 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash -165814360, now seen corresponding path program 4 times [2018-01-30 05:02:56,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:56,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:56,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:56,789 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:02:56,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:56,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-30 05:02:56,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:56,979 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 05:02:56,983 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:02:56,995 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:02:56,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-30 05:02:57,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:57,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-01-30 05:02:57,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 05:02:57,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 05:02:57,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-01-30 05:02:57,056 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand 18 states. [2018-01-30 05:02:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:57,275 INFO L93 Difference]: Finished difference Result 201 states and 211 transitions. [2018-01-30 05:02:57,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 05:02:57,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 102 [2018-01-30 05:02:57,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:57,276 INFO L225 Difference]: With dead ends: 201 [2018-01-30 05:02:57,276 INFO L226 Difference]: Without dead ends: 154 [2018-01-30 05:02:57,276 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 05:02:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-30 05:02:57,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2018-01-30 05:02:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-30 05:02:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-01-30 05:02:57,281 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 102 [2018-01-30 05:02:57,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:57,281 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-01-30 05:02:57,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 05:02:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-01-30 05:02:57,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-30 05:02:57,282 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:57,282 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 05:02:57,282 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:57,282 INFO L82 PathProgramCache]: Analyzing trace with hash 661230177, now seen corresponding path program 6 times [2018-01-30 05:02:57,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:57,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:57,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:57,283 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:02:57,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:57,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-30 05:02:57,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:57,443 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 05:02:57,449 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 05:02:57,455 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:02:57,457 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:02:57,459 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:02:57,461 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:02:57,464 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:02:57,465 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:02:57,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-30 05:02:57,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:02:57,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-01-30 05:02:57,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 05:02:57,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 05:02:57,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-01-30 05:02:57,563 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 24 states. [2018-01-30 05:02:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:02:58,210 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2018-01-30 05:02:58,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 05:02:58,210 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 108 [2018-01-30 05:02:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:02:58,210 INFO L225 Difference]: With dead ends: 194 [2018-01-30 05:02:58,210 INFO L226 Difference]: Without dead ends: 181 [2018-01-30 05:02:58,211 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 05:02:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-30 05:02:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 157. [2018-01-30 05:02:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-30 05:02:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 163 transitions. [2018-01-30 05:02:58,217 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 163 transitions. Word has length 108 [2018-01-30 05:02:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:02:58,217 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 163 transitions. [2018-01-30 05:02:58,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 05:02:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 163 transitions. [2018-01-30 05:02:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-30 05:02:58,218 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:02:58,218 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:02:58,218 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:02:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash 432645079, now seen corresponding path program 5 times [2018-01-30 05:02:58,218 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:02:58,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:02:58,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:58,219 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:02:58,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:02:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:02:58,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:02:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:02:59,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:02:59,386 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 05:02:59,391 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:02:59,396 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:59,398 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:59,409 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:59,414 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:02:59,416 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:02:59,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:02:59,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:02:59,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:59,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:02:59,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:02:59,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:02:59,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-30 05:02:59,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:02:59,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 05:02:59,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:36 [2018-01-30 05:02:59,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:02:59,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:00,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:00,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-01-30 05:03:00,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 05:03:00,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:00,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:39 [2018-01-30 05:03:00,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:00,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:00,096 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 05:03:00,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-01-30 05:03:00,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,104 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 05:03:00,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:17 [2018-01-30 05:03:00,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:00,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:03:00,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:00,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-30 05:03:00,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,209 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 05:03:00,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2018-01-30 05:03:00,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:00,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-01-30 05:03:00,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,316 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 05:03:00,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:24 [2018-01-30 05:03:00,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:03:00,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-30 05:03:00,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-30 05:03:00,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:00,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:00,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:00,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-30 05:03:00,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:00,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2018-01-30 05:03:00,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 05:03:00,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:00,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:11, output treesize:1 [2018-01-30 05:03:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:03:00,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:00,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27] total 56 [2018-01-30 05:03:00,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-30 05:03:00,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-30 05:03:00,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2769, Unknown=0, NotChecked=0, Total=3080 [2018-01-30 05:03:00,968 INFO L87 Difference]: Start difference. First operand 157 states and 163 transitions. Second operand 56 states. [2018-01-30 05:03:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:05,116 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2018-01-30 05:03:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-30 05:03:05,117 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-01-30 05:03:05,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:05,117 INFO L225 Difference]: With dead ends: 275 [2018-01-30 05:03:05,117 INFO L226 Difference]: Without dead ends: 263 [2018-01-30 05:03:05,119 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1309, Invalid=9821, Unknown=0, NotChecked=0, Total=11130 [2018-01-30 05:03:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-30 05:03:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 234. [2018-01-30 05:03:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-30 05:03:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 246 transitions. [2018-01-30 05:03:05,127 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 246 transitions. Word has length 110 [2018-01-30 05:03:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:05,128 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 246 transitions. [2018-01-30 05:03:05,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-30 05:03:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 246 transitions. [2018-01-30 05:03:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-30 05:03:05,128 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:05,128 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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 05:03:05,129 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1967048497, now seen corresponding path program 7 times [2018-01-30 05:03:05,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:05,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:05,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:05,129 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:05,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:05,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 56 proven. 27 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-30 05:03:05,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:05,270 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 05:03:05,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:03:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:05,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 56 proven. 27 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-30 05:03:05,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:05,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-01-30 05:03:05,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 05:03:05,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 05:03:05,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-01-30 05:03:05,399 INFO L87 Difference]: Start difference. First operand 234 states and 246 transitions. Second operand 24 states. [2018-01-30 05:03:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:05,880 INFO L93 Difference]: Finished difference Result 475 states and 501 transitions. [2018-01-30 05:03:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 05:03:05,880 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 116 [2018-01-30 05:03:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:05,881 INFO L225 Difference]: With dead ends: 475 [2018-01-30 05:03:05,881 INFO L226 Difference]: Without dead ends: 334 [2018-01-30 05:03:05,881 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=417, Invalid=2235, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 05:03:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-30 05:03:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 324. [2018-01-30 05:03:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-01-30 05:03:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 339 transitions. [2018-01-30 05:03:05,894 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 339 transitions. Word has length 116 [2018-01-30 05:03:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:05,894 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 339 transitions. [2018-01-30 05:03:05,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 05:03:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 339 transitions. [2018-01-30 05:03:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-30 05:03:05,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:05,895 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 05:03:05,895 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:05,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1269497596, now seen corresponding path program 6 times [2018-01-30 05:03:05,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:05,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:05,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:05,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:03:05,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:05,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 3 proven. 103 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 05:03:07,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:07,034 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 05:03:07,039 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 05:03:07,044 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:03:07,046 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:03:07,049 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:03:07,053 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:03:07,055 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:07,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:07,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:07,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:07,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:07,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:03:07,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:07,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:07,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:07,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:07,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:07,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:07,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-30 05:03:07,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:07,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:07,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 05:03:07,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:07,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:07,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2018-01-30 05:03:07,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 05:03:07,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 05:03:07,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 05:03:07,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:32 [2018-01-30 05:03:07,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 05:03:07,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:07,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 05:03:07,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:07,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 05:03:07,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-01-30 05:03:07,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:07,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:07,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:07,909 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 05:03:07,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:27 [2018-01-30 05:03:08,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:08,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:08,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:08,032 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 05:03:08,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:27 [2018-01-30 05:03:08,183 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 05:03:08,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-30 05:03:08,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:08,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 05:03:08,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:08,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:08,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:19 [2018-01-30 05:03:08,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-30 05:03:08,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:08,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:08,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-30 05:03:08,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-30 05:03:08,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:08,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:08,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-30 05:03:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 5 proven. 98 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:03:08,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:08,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 74 [2018-01-30 05:03:08,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-01-30 05:03:08,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-01-30 05:03:08,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=4929, Unknown=0, NotChecked=0, Total=5402 [2018-01-30 05:03:08,638 INFO L87 Difference]: Start difference. First operand 324 states and 339 transitions. Second operand 74 states. [2018-01-30 05:03:10,192 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 58 DAG size of output 32 [2018-01-30 05:03:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:13,941 INFO L93 Difference]: Finished difference Result 396 states and 423 transitions. [2018-01-30 05:03:13,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-01-30 05:03:13,941 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 120 [2018-01-30 05:03:13,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:13,942 INFO L225 Difference]: With dead ends: 396 [2018-01-30 05:03:13,942 INFO L226 Difference]: Without dead ends: 286 [2018-01-30 05:03:13,946 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6678 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2006, Invalid=19750, Unknown=0, NotChecked=0, Total=21756 [2018-01-30 05:03:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-30 05:03:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 261. [2018-01-30 05:03:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-01-30 05:03:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 275 transitions. [2018-01-30 05:03:13,957 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 275 transitions. Word has length 120 [2018-01-30 05:03:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:13,958 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 275 transitions. [2018-01-30 05:03:13,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-01-30 05:03:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 275 transitions. [2018-01-30 05:03:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-30 05:03:13,958 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:13,958 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 05:03:13,958 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:13,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1728093987, now seen corresponding path program 8 times [2018-01-30 05:03:13,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:13,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:13,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:13,959 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:13,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:13,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 11 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:03:14,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:14,809 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 05:03:14,813 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:03:14,819 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:14,825 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:14,827 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:14,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:14,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:14,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:14,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:14,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:03:14,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:14,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-01-30 05:03:14,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:14,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:14,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 05:03:14,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:14,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:14,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:14,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-01-30 05:03:14,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:14,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:14,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 05:03:15,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,062 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 55 treesize of output 96 [2018-01-30 05:03:15,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,085 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 05:03:15,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:60 [2018-01-30 05:03:15,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,341 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 05:03:15,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 74 [2018-01-30 05:03:15,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,357 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 05:03:15,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:14 [2018-01-30 05:03:15,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:15,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 05:03:15,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:15,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,477 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 05:03:15,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 05:03:15,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:15,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,526 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 05:03:15,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 05:03:15,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:15,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,576 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 05:03:15,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-01-30 05:03:15,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:03:15,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-30 05:03:15,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2018-01-30 05:03:15,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-01-30 05:03:15,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 05:03:15,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-01-30 05:03:15,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:15,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:15,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:15,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-30 05:03:15,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:15,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:15,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2018-01-30 05:03:15,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:15,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:16,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:16,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-30 05:03:16,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:16,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:16,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:20 [2018-01-30 05:03:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 13 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:03:16,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:16,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 31] total 62 [2018-01-30 05:03:16,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-01-30 05:03:16,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-01-30 05:03:16,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=3300, Unknown=0, NotChecked=0, Total=3782 [2018-01-30 05:03:16,718 INFO L87 Difference]: Start difference. First operand 261 states and 275 transitions. Second operand 62 states. [2018-01-30 05:03:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:18,419 INFO L93 Difference]: Finished difference Result 296 states and 314 transitions. [2018-01-30 05:03:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-30 05:03:18,420 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 123 [2018-01-30 05:03:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:18,420 INFO L225 Difference]: With dead ends: 296 [2018-01-30 05:03:18,421 INFO L226 Difference]: Without dead ends: 274 [2018-01-30 05:03:18,421 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 95 SyntacticMatches, 16 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3300 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1061, Invalid=7495, Unknown=0, NotChecked=0, Total=8556 [2018-01-30 05:03:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-30 05:03:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 268. [2018-01-30 05:03:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-01-30 05:03:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 282 transitions. [2018-01-30 05:03:18,434 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 282 transitions. Word has length 123 [2018-01-30 05:03:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:18,434 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 282 transitions. [2018-01-30 05:03:18,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-01-30 05:03:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 282 transitions. [2018-01-30 05:03:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-30 05:03:18,435 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:18,435 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:03:18,435 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1470732765, now seen corresponding path program 7 times [2018-01-30 05:03:18,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:18,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:18,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:18,436 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:18,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:18,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 29 proven. 53 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-01-30 05:03:18,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:18,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 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 05:03:18,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:03:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:18,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 27 proven. 53 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-01-30 05:03:18,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:18,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-01-30 05:03:18,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 05:03:18,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 05:03:18,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-01-30 05:03:18,667 INFO L87 Difference]: Start difference. First operand 268 states and 282 transitions. Second operand 24 states. [2018-01-30 05:03:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:18,975 INFO L93 Difference]: Finished difference Result 292 states and 307 transitions. [2018-01-30 05:03:18,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 05:03:18,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 133 [2018-01-30 05:03:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:18,976 INFO L225 Difference]: With dead ends: 292 [2018-01-30 05:03:18,976 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 05:03:18,977 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 05:03:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 05:03:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-01-30 05:03:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-30 05:03:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 200 transitions. [2018-01-30 05:03:18,995 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 200 transitions. Word has length 133 [2018-01-30 05:03:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:18,995 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 200 transitions. [2018-01-30 05:03:18,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 05:03:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 200 transitions. [2018-01-30 05:03:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-30 05:03:18,996 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:18,996 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-01-30 05:03:18,996 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:18,996 INFO L82 PathProgramCache]: Analyzing trace with hash 87875922, now seen corresponding path program 8 times [2018-01-30 05:03:18,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:18,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:18,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:18,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:03:18,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:19,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 92 proven. 56 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 05:03:19,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:19,278 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 05:03:19,290 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:03:19,295 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:19,303 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:19,304 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:19,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 90 proven. 50 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-01-30 05:03:19,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:19,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2018-01-30 05:03:19,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 05:03:19,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 05:03:19,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 05:03:19,467 INFO L87 Difference]: Start difference. First operand 193 states and 200 transitions. Second operand 34 states. [2018-01-30 05:03:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:20,073 INFO L93 Difference]: Finished difference Result 339 states and 353 transitions. [2018-01-30 05:03:20,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 05:03:20,073 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 141 [2018-01-30 05:03:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:20,074 INFO L225 Difference]: With dead ends: 339 [2018-01-30 05:03:20,074 INFO L226 Difference]: Without dead ends: 311 [2018-01-30 05:03:20,075 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=736, Invalid=4814, Unknown=0, NotChecked=0, Total=5550 [2018-01-30 05:03:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-30 05:03:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 279. [2018-01-30 05:03:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-30 05:03:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 288 transitions. [2018-01-30 05:03:20,084 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 288 transitions. Word has length 141 [2018-01-30 05:03:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:20,085 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 288 transitions. [2018-01-30 05:03:20,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 05:03:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 288 transitions. [2018-01-30 05:03:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-30 05:03:20,085 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:20,085 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-01-30 05:03:20,085 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1092933711, now seen corresponding path program 9 times [2018-01-30 05:03:20,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:20,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:20,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:20,086 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:20,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:20,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 92 proven. 50 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-01-30 05:03:20,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:20,238 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 05:03:20,243 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:03:20,249 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:20,253 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:20,256 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:20,259 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:20,262 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:20,267 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:20,267 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:20,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 90 proven. 50 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-01-30 05:03:20,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:20,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-01-30 05:03:20,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 05:03:20,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 05:03:20,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2018-01-30 05:03:20,387 INFO L87 Difference]: Start difference. First operand 279 states and 288 transitions. Second operand 30 states. [2018-01-30 05:03:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:20,756 INFO L93 Difference]: Finished difference Result 369 states and 380 transitions. [2018-01-30 05:03:20,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 05:03:20,756 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 141 [2018-01-30 05:03:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:20,757 INFO L225 Difference]: With dead ends: 369 [2018-01-30 05:03:20,757 INFO L226 Difference]: Without dead ends: 306 [2018-01-30 05:03:20,758 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=2305, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 05:03:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-30 05:03:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2018-01-30 05:03:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-01-30 05:03:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 238 transitions. [2018-01-30 05:03:20,766 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 238 transitions. Word has length 141 [2018-01-30 05:03:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:20,766 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 238 transitions. [2018-01-30 05:03:20,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 05:03:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 238 transitions. [2018-01-30 05:03:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-30 05:03:20,767 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:20,767 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-01-30 05:03:20,767 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:20,767 INFO L82 PathProgramCache]: Analyzing trace with hash 879717863, now seen corresponding path program 10 times [2018-01-30 05:03:20,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:20,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:20,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:20,768 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:20,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:20,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 05:03:22,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:22,489 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 05:03:22,494 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:03:22,508 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:22,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:22,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:22,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 05:03:22,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 05:03:22,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:03:22,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:22,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:22,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:22,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:22,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-01-30 05:03:22,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-30 05:03:22,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:22,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:22,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:22,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:22,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-01-30 05:03:22,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-30 05:03:22,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-01-30 05:03:22,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-01-30 05:03:22,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 05:03:22,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:22,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-30 05:03:23,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 05:03:23,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,008 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 05:03:23,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-01-30 05:03:23,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:23,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:23,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,076 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 05:03:23,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 05:03:23,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:23,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:23,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,150 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 05:03:23,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 05:03:23,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 05:03:23,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 05:03:23,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-01-30 05:03:23,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:23,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-30 05:03:23,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 05:03:23,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-01-30 05:03:23,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2018-01-30 05:03:23,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:1 [2018-01-30 05:03:23,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2018-01-30 05:03:23,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:23,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:1 [2018-01-30 05:03:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 4 proven. 174 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:03:23,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:23,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 34] total 71 [2018-01-30 05:03:23,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-01-30 05:03:23,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-01-30 05:03:23,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=4574, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 05:03:23,633 INFO L87 Difference]: Start difference. First operand 232 states and 238 transitions. Second operand 71 states. [2018-01-30 05:03:27,405 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 108 DAG size of output 46 [2018-01-30 05:03:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:28,528 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions. [2018-01-30 05:03:28,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-01-30 05:03:28,528 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 143 [2018-01-30 05:03:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:28,529 INFO L225 Difference]: With dead ends: 278 [2018-01-30 05:03:28,529 INFO L226 Difference]: Without dead ends: 266 [2018-01-30 05:03:28,531 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 115 SyntacticMatches, 15 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6670 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2021, Invalid=20629, Unknown=0, NotChecked=0, Total=22650 [2018-01-30 05:03:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-30 05:03:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 245. [2018-01-30 05:03:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-30 05:03:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 252 transitions. [2018-01-30 05:03:28,542 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 252 transitions. Word has length 143 [2018-01-30 05:03:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:28,542 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 252 transitions. [2018-01-30 05:03:28,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-01-30 05:03:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 252 transitions. [2018-01-30 05:03:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-30 05:03:28,543 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:28,543 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-01-30 05:03:28,543 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1942783877, now seen corresponding path program 11 times [2018-01-30 05:03:28,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:28,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:28,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:28,543 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:28,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:28,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 52 proven. 86 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-01-30 05:03:28,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:28,912 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 05:03:28,923 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:03:28,928 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:28,930 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:28,932 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:28,935 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:28,938 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:28,946 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:28,947 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:28,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 56 proven. 90 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-01-30 05:03:29,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:29,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2018-01-30 05:03:29,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 05:03:29,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 05:03:29,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 05:03:29,130 INFO L87 Difference]: Start difference. First operand 245 states and 252 transitions. Second operand 34 states. [2018-01-30 05:03:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:29,960 INFO L93 Difference]: Finished difference Result 355 states and 365 transitions. [2018-01-30 05:03:29,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-30 05:03:29,960 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 148 [2018-01-30 05:03:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:29,961 INFO L225 Difference]: With dead ends: 355 [2018-01-30 05:03:29,961 INFO L226 Difference]: Without dead ends: 276 [2018-01-30 05:03:29,962 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=891, Invalid=5915, Unknown=0, NotChecked=0, Total=6806 [2018-01-30 05:03:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-01-30 05:03:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 250. [2018-01-30 05:03:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-30 05:03:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 255 transitions. [2018-01-30 05:03:29,973 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 255 transitions. Word has length 148 [2018-01-30 05:03:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:29,973 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 255 transitions. [2018-01-30 05:03:29,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 05:03:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 255 transitions. [2018-01-30 05:03:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-30 05:03:29,973 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:29,974 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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 05:03:29,974 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -546867956, now seen corresponding path program 12 times [2018-01-30 05:03:29,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:29,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:29,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:29,974 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:29,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:29,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 5 proven. 188 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-30 05:03:31,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:31,563 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 05:03:31,568 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 05:03:31,574 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:03:31,576 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:03:31,579 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:03:31,583 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:03:31,586 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:03:31,589 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:31,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:31,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:31,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:31,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:31,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:03:31,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:32,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-30 05:03:32,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 05:03:32,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-30 05:03:32,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:32,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-30 05:03:32,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 05:03:32,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-30 05:03:32,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:32,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:32,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:32,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-01-30 05:03:32,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-30 05:03:32,419 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 05:03:32,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-30 05:03:32,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:14 [2018-01-30 05:03:32,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 05:03:32,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 05:03:32,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:32,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 05:03:32,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,603 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 05:03:32,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2018-01-30 05:03:32,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:32,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 05:03:32,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,678 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 05:03:32,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2018-01-30 05:03:32,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:32,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 05:03:32,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,791 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 05:03:32,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:17 [2018-01-30 05:03:32,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2018-01-30 05:03:32,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 05:03:32,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 05:03:32,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-01-30 05:03:32,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:32,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 05:03:32,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:32 [2018-01-30 05:03:33,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 05:03:33,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:33,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:33,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-30 05:03:33,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 05:03:33,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:33,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:33,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-30 05:03:33,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 05:03:33,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:33,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:33,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-30 05:03:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 05:03:33,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:33,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 43] total 87 [2018-01-30 05:03:33,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-01-30 05:03:33,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-01-30 05:03:33,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=6780, Unknown=0, NotChecked=0, Total=7482 [2018-01-30 05:03:33,324 INFO L87 Difference]: Start difference. First operand 250 states and 255 transitions. Second operand 87 states. [2018-01-30 05:03:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:36,590 INFO L93 Difference]: Finished difference Result 307 states and 316 transitions. [2018-01-30 05:03:36,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-01-30 05:03:36,592 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 153 [2018-01-30 05:03:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:36,593 INFO L225 Difference]: With dead ends: 307 [2018-01-30 05:03:36,593 INFO L226 Difference]: Without dead ends: 295 [2018-01-30 05:03:36,594 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 116 SyntacticMatches, 13 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7851 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2374, Invalid=20882, Unknown=0, NotChecked=0, Total=23256 [2018-01-30 05:03:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-01-30 05:03:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-01-30 05:03:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-01-30 05:03:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 265 transitions. [2018-01-30 05:03:36,607 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 265 transitions. Word has length 153 [2018-01-30 05:03:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:36,607 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 265 transitions. [2018-01-30 05:03:36,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-01-30 05:03:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 265 transitions. [2018-01-30 05:03:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-01-30 05:03:36,608 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:36,608 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2018-01-30 05:03:36,608 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1747515051, now seen corresponding path program 13 times [2018-01-30 05:03:36,608 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:36,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:36,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:36,609 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:36,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:36,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:37,127 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 6 DAG size of output 5 [2018-01-30 05:03:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 12 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:03:38,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:38,346 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 05:03:38,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:03:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:38,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:38,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:38,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:38,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:38,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:03:38,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-01-30 05:03:38,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:38,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:38,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 05:03:38,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-01-30 05:03:38,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:38,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:38,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 05:03:38,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,659 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 55 treesize of output 96 [2018-01-30 05:03:38,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:38,670 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 05:03:38,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:60 [2018-01-30 05:03:38,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:38,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:38,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 123 [2018-01-30 05:03:38,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:38,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:38,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:63 [2018-01-30 05:03:38,989 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 05:03:38,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:38,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-01-30 05:03:38,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,005 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 05:03:39,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:17 [2018-01-30 05:03:39,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:39,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:03:39,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:39,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-30 05:03:39,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,143 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 05:03:39,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-01-30 05:03:39,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:39,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-30 05:03:39,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,213 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 05:03:39,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-01-30 05:03:39,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-30 05:03:39,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,282 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 05:03:39,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-01-30 05:03:39,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:39,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-01-30 05:03:39,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,302 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 05:03:39,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:18 [2018-01-30 05:03:39,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:03:39,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-30 05:03:39,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2018-01-30 05:03:39,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:39,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-01-30 05:03:39,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 05:03:39,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-01-30 05:03:39,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:39,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-01-30 05:03:39,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 05:03:39,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-30 05:03:39,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:39,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-01-30 05:03:39,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 05:03:39,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:39,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:21 [2018-01-30 05:03:39,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-30 05:03:39,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:39,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:1 [2018-01-30 05:03:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 2 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:03:39,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:39,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 39] total 79 [2018-01-30 05:03:39,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-01-30 05:03:39,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-01-30 05:03:39,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=5761, Unknown=0, NotChecked=0, Total=6162 [2018-01-30 05:03:39,807 INFO L87 Difference]: Start difference. First operand 260 states and 265 transitions. Second operand 79 states. [2018-01-30 05:03:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:44,318 INFO L93 Difference]: Finished difference Result 368 states and 382 transitions. [2018-01-30 05:03:44,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-01-30 05:03:44,318 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-01-30 05:03:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:44,319 INFO L225 Difference]: With dead ends: 368 [2018-01-30 05:03:44,319 INFO L226 Difference]: Without dead ends: 356 [2018-01-30 05:03:44,320 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 124 SyntacticMatches, 20 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9072 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1952, Invalid=23170, Unknown=0, NotChecked=0, Total=25122 [2018-01-30 05:03:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-01-30 05:03:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 325. [2018-01-30 05:03:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-30 05:03:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 333 transitions. [2018-01-30 05:03:44,339 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 333 transitions. Word has length 156 [2018-01-30 05:03:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:44,339 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 333 transitions. [2018-01-30 05:03:44,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-01-30 05:03:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 333 transitions. [2018-01-30 05:03:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-01-30 05:03:44,340 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:44,340 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 05:03:44,340 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash -95383055, now seen corresponding path program 14 times [2018-01-30 05:03:44,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:44,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:44,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:44,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:03:44,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:44,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-01-30 05:03:44,846 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:44,847 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 05:03:44,862 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:03:44,868 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:44,876 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:03:44,878 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:44,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 56 proven. 50 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-01-30 05:03:45,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:45,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2018-01-30 05:03:45,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 05:03:45,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 05:03:45,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 05:03:45,099 INFO L87 Difference]: Start difference. First operand 325 states and 333 transitions. Second operand 34 states. [2018-01-30 05:03:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:45,594 INFO L93 Difference]: Finished difference Result 365 states and 374 transitions. [2018-01-30 05:03:45,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-01-30 05:03:45,595 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 163 [2018-01-30 05:03:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:45,595 INFO L225 Difference]: With dead ends: 365 [2018-01-30 05:03:45,595 INFO L226 Difference]: Without dead ends: 240 [2018-01-30 05:03:45,596 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=747, Invalid=4953, Unknown=0, NotChecked=0, Total=5700 [2018-01-30 05:03:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-30 05:03:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 224. [2018-01-30 05:03:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-30 05:03:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 231 transitions. [2018-01-30 05:03:45,610 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 231 transitions. Word has length 163 [2018-01-30 05:03:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:45,610 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 231 transitions. [2018-01-30 05:03:45,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 05:03:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 231 transitions. [2018-01-30 05:03:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-01-30 05:03:45,611 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:45,611 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2018-01-30 05:03:45,611 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash -53988732, now seen corresponding path program 15 times [2018-01-30 05:03:45,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:45,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:45,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:45,612 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:45,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:45,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 134 proven. 80 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-01-30 05:03:45,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:45,914 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 05:03:45,920 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:03:45,926 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:45,940 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:45,947 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:45,959 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:45,967 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:45,979 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:45,992 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:03:46,001 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:46,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 90 proven. 132 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-01-30 05:03:46,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:46,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-01-30 05:03:46,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-30 05:03:46,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-30 05:03:46,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2031, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 05:03:46,676 INFO L87 Difference]: Start difference. First operand 224 states and 231 transitions. Second operand 48 states. [2018-01-30 05:03:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:47,660 INFO L93 Difference]: Finished difference Result 453 states and 468 transitions. [2018-01-30 05:03:47,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-30 05:03:47,660 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 164 [2018-01-30 05:03:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:47,662 INFO L225 Difference]: With dead ends: 453 [2018-01-30 05:03:47,662 INFO L226 Difference]: Without dead ends: 382 [2018-01-30 05:03:47,663 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3658 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1216, Invalid=10126, Unknown=0, NotChecked=0, Total=11342 [2018-01-30 05:03:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-01-30 05:03:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 279. [2018-01-30 05:03:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-30 05:03:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 286 transitions. [2018-01-30 05:03:47,694 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 286 transitions. Word has length 164 [2018-01-30 05:03:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:47,694 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 286 transitions. [2018-01-30 05:03:47,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-30 05:03:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 286 transitions. [2018-01-30 05:03:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-01-30 05:03:47,695 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:47,695 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-01-30 05:03:47,695 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash -527556870, now seen corresponding path program 16 times [2018-01-30 05:03:47,695 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:47,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:47,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:47,696 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:47,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:47,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:03:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 16 proven. 263 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 05:03:49,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:03:49,711 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 05:03:49,717 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:03:49,735 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:03:49,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:03:49,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:49,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:49,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:49,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 05:03:49,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:49,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-01-30 05:03:49,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:49,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:49,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 05:03:49,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:49,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:49,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:49,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-01-30 05:03:49,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,034 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 05:03:50,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2018-01-30 05:03:50,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:50,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:50,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,212 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 46 treesize of output 81 [2018-01-30 05:03:50,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:50,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2018-01-30 05:03:50,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:50,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:50,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,381 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 46 treesize of output 81 [2018-01-30 05:03:50,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:50,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2018-01-30 05:03:50,543 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 05:03:50,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-01-30 05:03:50,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,553 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 05:03:50,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:14 [2018-01-30 05:03:50,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:50,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 05:03:50,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:50,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,698 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 05:03:50,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 05:03:50,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 05:03:50,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,772 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 05:03:50,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-01-30 05:03:50,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:50,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,843 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 05:03:50,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 05:03:50,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:50,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:03:50,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,919 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 05:03:50,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 05:03:50,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-30 05:03:50,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 05:03:50,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:50,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2018-01-30 05:03:51,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:03:51,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:51,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:51,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-30 05:03:51,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:51,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:51,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-01-30 05:03:51,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:03:51,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-01-30 05:03:51,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:51,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 05:03:51,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:51,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:03:51,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:21 [2018-01-30 05:03:51,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 05:03:51,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:51,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:51,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:11, output treesize:1 [2018-01-30 05:03:51,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 05:03:51,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:03:51,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:03:51,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:11, output treesize:1 [2018-01-30 05:03:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 4 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:03:51,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:03:51,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 40] total 86 [2018-01-30 05:03:51,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-01-30 05:03:51,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-01-30 05:03:51,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=6805, Unknown=0, NotChecked=0, Total=7310 [2018-01-30 05:03:51,530 INFO L87 Difference]: Start difference. First operand 279 states and 286 transitions. Second operand 86 states. [2018-01-30 05:03:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:03:57,177 INFO L93 Difference]: Finished difference Result 469 states and 500 transitions. [2018-01-30 05:03:57,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-01-30 05:03:57,177 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 166 [2018-01-30 05:03:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:03:57,179 INFO L225 Difference]: With dead ends: 469 [2018-01-30 05:03:57,179 INFO L226 Difference]: Without dead ends: 457 [2018-01-30 05:03:57,180 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 133 SyntacticMatches, 17 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11089 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3132, Invalid=29810, Unknown=0, NotChecked=0, Total=32942 [2018-01-30 05:03:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-01-30 05:03:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 408. [2018-01-30 05:03:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-01-30 05:03:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 426 transitions. [2018-01-30 05:03:57,224 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 426 transitions. Word has length 166 [2018-01-30 05:03:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:03:57,224 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 426 transitions. [2018-01-30 05:03:57,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-01-30 05:03:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 426 transitions. [2018-01-30 05:03:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-01-30 05:03:57,225 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:03:57,225 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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 05:03:57,225 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:03:57,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1432999329, now seen corresponding path program 17 times [2018-01-30 05:03:57,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:03:57,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:03:57,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:57,226 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:03:57,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:03:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:03:57,236 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 05:03:58,469 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 05:03:58,472 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 05:03:58,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:03:58 BasicIcfg [2018-01-30 05:03:58,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 05:03:58,473 INFO L168 Benchmark]: Toolchain (without parser) took 72078.61 ms. Allocated memory was 148.9 MB in the beginning and 755.5 MB in the end (delta: 606.6 MB). Free memory was 114.1 MB in the beginning and 99.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 621.4 MB. Max. memory is 5.3 GB. [2018-01-30 05:03:58,474 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 05:03:58,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.51 ms. Allocated memory is still 148.9 MB. Free memory was 113.9 MB in the beginning and 105.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. [2018-01-30 05:03:58,474 INFO L168 Benchmark]: Boogie Preprocessor took 20.77 ms. Allocated memory is still 148.9 MB. Free memory was 105.6 MB in the beginning and 104.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 05:03:58,474 INFO L168 Benchmark]: RCFGBuilder took 325.50 ms. Allocated memory is still 148.9 MB. Free memory was 104.0 MB in the beginning and 89.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-01-30 05:03:58,475 INFO L168 Benchmark]: IcfgTransformer took 13.60 ms. Allocated memory is still 148.9 MB. Free memory was 89.4 MB in the beginning and 88.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-01-30 05:03:58,475 INFO L168 Benchmark]: TraceAbstraction took 71589.82 ms. Allocated memory was 148.9 MB in the beginning and 755.5 MB in the end (delta: 606.6 MB). Free memory was 87.7 MB in the beginning and 99.3 MB in the end (delta: -11.6 MB). Peak memory consumption was 595.0 MB. Max. memory is 5.3 GB. [2018-01-30 05:03:58,476 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 148.9 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 126.51 ms. Allocated memory is still 148.9 MB. Free memory was 113.9 MB in the beginning and 105.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.77 ms. Allocated memory is still 148.9 MB. Free memory was 105.6 MB in the beginning and 104.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 325.50 ms. Allocated memory is still 148.9 MB. Free memory was 104.0 MB in the beginning and 89.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * IcfgTransformer took 13.60 ms. Allocated memory is still 148.9 MB. Free memory was 89.4 MB in the beginning and 88.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 71589.82 ms. Allocated memory was 148.9 MB in the beginning and 755.5 MB in the end (delta: 606.6 MB). Free memory was 87.7 MB in the beginning and 99.3 MB in the end (delta: -11.6 MB). Peak memory consumption was 595.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was analyzing trace of length 177 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 1 error locations. TIMEOUT Result, 71.5s OverallTime, 27 OverallIterations, 7 TraceHistogramMax, 39.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1347 SDtfs, 8176 SDslu, 21383 SDs, 0 SdLazy, 39634 SolverSat, 3674 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4430 GetRequests, 2486 SyntacticMatches, 119 SemanticMatches, 1825 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64794 ImplicationChecksByTransitivity, 41.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=26, 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.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 810 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 5699 NumberOfCodeBlocks, 5680 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 5649 ConstructedInterpolants, 131 QuantifiedInterpolants, 6255104 SizeOfPredicates, 505 NumberOfNonLiveVariables, 4106 ConjunctsInSsa, 789 ConjunctsInUnsatCore, 50 InterpolantComputations, 2 PerfectInterpolantSequences, 2826/6582 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/revcpyswp2_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_05-03-58-480.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/revcpyswp2_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_05-03-58-480.csv Completed graceful shutdown