java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 03:55:41,234 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 03:55:41,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 03:55:41,251 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 03:55:41,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 03:55:41,252 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 03:55:41,253 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 03:55:41,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 03:55:41,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 03:55:41,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 03:55:41,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 03:55:41,258 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 03:55:41,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 03:55:41,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 03:55:41,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 03:55:41,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 03:55:41,269 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 03:55:41,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 03:55:41,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 03:55:41,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 03:55:41,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 03:55:41,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 03:55:41,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 03:55:41,273 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 03:55:41,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 03:55:41,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 03:55:41,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 03:55:41,274 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 03:55:41,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 03:55:41,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 03:55:41,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 03:55:41,279 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 03:55:41,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 03:55:41,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 03:55:41,289 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 03:55:41,289 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 03:55:41,289 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 03:55:41,289 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 03:55:41,289 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 03:55:41,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 03:55:41,290 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 03:55:41,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 03:55:41,290 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 03:55:41,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 03:55:41,290 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 03:55:41,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 03:55:41,290 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 03:55:41,290 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 03:55:41,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 03:55:41,291 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 03:55:41,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 03:55:41,291 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 03:55:41,291 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 03:55:41,291 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 03:55:41,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 03:55:41,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 03:55:41,291 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 03:55:41,291 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 03:55:41,291 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 03:55:41,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 03:55:41,292 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 03:55:41,292 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 03:55:41,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 03:55:41,292 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 03:55:41,292 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 03:55:41,293 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 03:55:41,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 03:55:41,327 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 03:55:41,329 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 03:55:41,330 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 03:55:41,330 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 03:55:41,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_true-unreach-call_ground.i [2018-01-30 03:55:41,395 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 03:55:41,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 03:55:41,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 03:55:41,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 03:55:41,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 03:55:41,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ff2267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41, skipping insertion in model container [2018-01-30 03:55:41,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,411 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 03:55:41,420 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 03:55:41,488 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 03:55:41,496 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 03:55:41,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41 WrapperNode [2018-01-30 03:55:41,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 03:55:41,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 03:55:41,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 03:55:41,499 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 03:55:41,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 03:55:41,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 03:55:41,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 03:55:41,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 03:55:41,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 03:55:41,555 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 03:55:41,555 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 03:55:41,555 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 03:55:41,555 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 03:55:41,555 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 03:55:41,556 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 03:55:41,556 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 03:55:41,556 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 03:55:41,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 03:55:41,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 03:55:41,896 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 03:55:41,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:55:41 BoogieIcfgContainer [2018-01-30 03:55:41,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 03:55:41,897 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 03:55:41,897 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 03:55:41,898 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 03:55:41,900 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:55:41" (1/1) ... [2018-01-30 03:55:41,902 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 03:55:41,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 03:55:41 BasicIcfg [2018-01-30 03:55:41,909 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 03:55:41,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 03:55:41,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 03:55:41,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 03:55:41,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 03:55:41" (1/4) ... [2018-01-30 03:55:41,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb461f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 03:55:41, skipping insertion in model container [2018-01-30 03:55:41,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:55:41" (2/4) ... [2018-01-30 03:55:41,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb461f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 03:55:41, skipping insertion in model container [2018-01-30 03:55:41,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:55:41" (3/4) ... [2018-01-30 03:55:41,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb461f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 03:55:41, skipping insertion in model container [2018-01-30 03:55:41,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 03:55:41" (4/4) ... [2018-01-30 03:55:41,914 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_true-unreach-call_ground.ileft_unchanged_by_heapseparator [2018-01-30 03:55:41,919 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 03:55:41,928 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 03:55:41,954 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 03:55:41,954 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 03:55:41,954 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 03:55:41,955 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 03:55:41,955 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 03:55:41,955 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 03:55:41,955 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 03:55:41,955 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 03:55:41,955 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 03:55:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-30 03:55:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 03:55:41,968 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:41,968 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:41,968 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash -958524817, now seen corresponding path program 1 times [2018-01-30 03:55:41,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:41,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:42,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:42,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:42,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:55:42,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:55:42,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 03:55:42,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 03:55:42,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 03:55:42,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 03:55:42,047 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-01-30 03:55:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:42,060 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-01-30 03:55:42,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 03:55:42,060 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-30 03:55:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:42,066 INFO L225 Difference]: With dead ends: 60 [2018-01-30 03:55:42,066 INFO L226 Difference]: Without dead ends: 32 [2018-01-30 03:55:42,068 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 03:55:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-30 03:55:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-30 03:55:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-30 03:55:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-01-30 03:55:42,089 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2018-01-30 03:55:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:42,089 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-01-30 03:55:42,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 03:55:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-01-30 03:55:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 03:55:42,090 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:42,090 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:42,090 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash 711297744, now seen corresponding path program 1 times [2018-01-30 03:55:42,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:42,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:42,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:42,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:42,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:55:42,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:55:42,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 03:55:42,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 03:55:42,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 03:55:42,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 03:55:42,153 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-01-30 03:55:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:42,273 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-30 03:55:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 03:55:42,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-30 03:55:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:42,279 INFO L225 Difference]: With dead ends: 56 [2018-01-30 03:55:42,279 INFO L226 Difference]: Without dead ends: 38 [2018-01-30 03:55:42,280 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 03:55:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-30 03:55:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-01-30 03:55:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-30 03:55:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-30 03:55:42,283 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 20 [2018-01-30 03:55:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:42,291 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-30 03:55:42,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 03:55:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-30 03:55:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 03:55:42,292 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:42,292 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:42,292 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash -896299333, now seen corresponding path program 1 times [2018-01-30 03:55:42,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:42,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:42,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:42,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:42,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:55:42,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:42,359 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:42,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:42,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:55:42,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:42,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 03:55:42,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 03:55:42,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 03:55:42,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 03:55:42,429 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-01-30 03:55:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:42,496 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-30 03:55:42,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 03:55:42,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-30 03:55:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:42,497 INFO L225 Difference]: With dead ends: 62 [2018-01-30 03:55:42,497 INFO L226 Difference]: Without dead ends: 44 [2018-01-30 03:55:42,497 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 03:55:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-30 03:55:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-01-30 03:55:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-30 03:55:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-30 03:55:42,501 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 26 [2018-01-30 03:55:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:42,501 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-30 03:55:42,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 03:55:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-30 03:55:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 03:55:42,501 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:42,502 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:42,502 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1380693606, now seen corresponding path program 2 times [2018-01-30 03:55:42,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:42,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:42,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:42,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:42,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:55:42,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:42,591 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:42,602 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:55:42,608 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:42,611 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:42,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-30 03:55:42,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 03:55:42,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-01-30 03:55:42,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 03:55:42,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 03:55:42,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 03:55:42,699 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-01-30 03:55:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:42,851 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-01-30 03:55:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 03:55:42,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-30 03:55:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:42,851 INFO L225 Difference]: With dead ends: 76 [2018-01-30 03:55:42,851 INFO L226 Difference]: Without dead ends: 54 [2018-01-30 03:55:42,852 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-01-30 03:55:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-30 03:55:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-01-30 03:55:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-30 03:55:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-30 03:55:42,855 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 32 [2018-01-30 03:55:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:42,855 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-30 03:55:42,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 03:55:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-30 03:55:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 03:55:42,856 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:42,856 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:42,856 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:42,856 INFO L82 PathProgramCache]: Analyzing trace with hash 361371512, now seen corresponding path program 1 times [2018-01-30 03:55:42,856 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:42,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:42,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,857 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:42,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:42,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 03:55:42,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:42,926 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:42,941 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:42,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 03:55:42,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:42,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-30 03:55:42,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 03:55:42,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 03:55:42,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-30 03:55:42,984 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2018-01-30 03:55:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:43,077 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2018-01-30 03:55:43,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 03:55:43,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-30 03:55:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:43,078 INFO L225 Difference]: With dead ends: 78 [2018-01-30 03:55:43,078 INFO L226 Difference]: Without dead ends: 58 [2018-01-30 03:55:43,079 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-30 03:55:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-30 03:55:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-01-30 03:55:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-30 03:55:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-30 03:55:43,082 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 42 [2018-01-30 03:55:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:43,082 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-30 03:55:43,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 03:55:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-30 03:55:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-30 03:55:43,083 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:43,083 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:43,083 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:43,083 INFO L82 PathProgramCache]: Analyzing trace with hash -276068061, now seen corresponding path program 2 times [2018-01-30 03:55:43,083 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:43,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:43,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:43,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:43,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:43,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 03:55:43,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:43,188 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:43,204 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:55:43,214 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:43,222 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:43,223 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:43,224 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 03:55:43,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:43,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 03:55:43,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 03:55:43,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 03:55:43,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-30 03:55:43,246 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2018-01-30 03:55:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:43,272 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-30 03:55:43,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 03:55:43,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-01-30 03:55:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:43,274 INFO L225 Difference]: With dead ends: 84 [2018-01-30 03:55:43,275 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 03:55:43,275 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-30 03:55:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 03:55:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-01-30 03:55:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-30 03:55:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-30 03:55:43,278 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 48 [2018-01-30 03:55:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:43,279 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-30 03:55:43,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 03:55:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-30 03:55:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 03:55:43,279 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:43,279 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:43,279 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2059259534, now seen corresponding path program 3 times [2018-01-30 03:55:43,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:43,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:43,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:43,280 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:43,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:43,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 03:55:43,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:43,406 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) [2018-01-30 03:55:43,413 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:43,419 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:43,432 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:43,444 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:43,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:43,572 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 03:55:43,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:55:43,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:55:43,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-30 03:55:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-30 03:55:43,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:43,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-01-30 03:55:43,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 03:55:43,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 03:55:43,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-30 03:55:43,649 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 13 states. [2018-01-30 03:55:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:43,960 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-01-30 03:55:43,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 03:55:43,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-01-30 03:55:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:43,961 INFO L225 Difference]: With dead ends: 101 [2018-01-30 03:55:43,961 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 03:55:43,962 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-01-30 03:55:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 03:55:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-01-30 03:55:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-30 03:55:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-01-30 03:55:43,966 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 54 [2018-01-30 03:55:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:43,966 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-01-30 03:55:43,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 03:55:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-01-30 03:55:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-30 03:55:43,967 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:43,967 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:43,967 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash 792283516, now seen corresponding path program 1 times [2018-01-30 03:55:43,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:43,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:43,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:43,968 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:43,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:43,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:55:44,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:44,128 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:44,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:44,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-30 03:55:44,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:44,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-30 03:55:44,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 03:55:44,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 03:55:44,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-30 03:55:44,180 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2018-01-30 03:55:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:44,206 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-01-30 03:55:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 03:55:44,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-01-30 03:55:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:44,209 INFO L225 Difference]: With dead ends: 110 [2018-01-30 03:55:44,209 INFO L226 Difference]: Without dead ends: 83 [2018-01-30 03:55:44,209 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-30 03:55:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-30 03:55:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-01-30 03:55:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-30 03:55:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-01-30 03:55:44,213 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 70 [2018-01-30 03:55:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:44,213 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-01-30 03:55:44,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 03:55:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-01-30 03:55:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-30 03:55:44,214 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:44,214 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:44,214 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash -906699609, now seen corresponding path program 2 times [2018-01-30 03:55:44,214 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:44,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:44,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:44,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:44,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:44,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 140 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:55:44,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:44,403 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:44,411 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:55:44,415 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:44,432 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:44,441 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:44,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-30 03:55:44,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:44,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-01-30 03:55:44,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 03:55:44,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 03:55:44,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-30 03:55:44,469 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 10 states. [2018-01-30 03:55:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:44,549 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-01-30 03:55:44,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 03:55:44,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2018-01-30 03:55:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:44,550 INFO L225 Difference]: With dead ends: 116 [2018-01-30 03:55:44,551 INFO L226 Difference]: Without dead ends: 89 [2018-01-30 03:55:44,551 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-30 03:55:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-30 03:55:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-01-30 03:55:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 03:55:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-01-30 03:55:44,555 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 76 [2018-01-30 03:55:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:44,555 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-01-30 03:55:44,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 03:55:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-01-30 03:55:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-30 03:55:44,556 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:44,556 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:44,556 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:44,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1126310802, now seen corresponding path program 3 times [2018-01-30 03:55:44,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:44,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:44,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:44,557 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:44,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:44,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 2 proven. 184 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:55:44,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:44,722 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:44,731 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:55:44,735 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:44,737 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:44,738 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:44,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-01-30 03:55:44,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:44,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-01-30 03:55:44,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 03:55:44,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 03:55:44,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-01-30 03:55:44,820 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 16 states. [2018-01-30 03:55:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:44,956 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-01-30 03:55:44,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 03:55:44,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2018-01-30 03:55:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:44,957 INFO L225 Difference]: With dead ends: 138 [2018-01-30 03:55:44,957 INFO L226 Difference]: Without dead ends: 101 [2018-01-30 03:55:44,958 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2018-01-30 03:55:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-30 03:55:44,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2018-01-30 03:55:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-30 03:55:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-01-30 03:55:44,964 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 82 [2018-01-30 03:55:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:44,964 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-01-30 03:55:44,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 03:55:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-01-30 03:55:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-30 03:55:44,965 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:44,965 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 3, 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] [2018-01-30 03:55:44,965 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash -631172444, now seen corresponding path program 4 times [2018-01-30 03:55:44,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:44,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:44,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:44,966 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:44,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:44,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 2 proven. 234 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-30 03:55:45,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:45,046 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:45,053 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:55:45,062 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:45,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:45,090 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 03:55:45,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:55:45,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:55:45,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-30 03:55:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-01-30 03:55:45,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:45,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-01-30 03:55:45,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 03:55:45,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 03:55:45,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-30 03:55:45,188 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 20 states. [2018-01-30 03:55:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:45,451 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-01-30 03:55:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 03:55:45,451 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 92 [2018-01-30 03:55:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:45,451 INFO L225 Difference]: With dead ends: 150 [2018-01-30 03:55:45,451 INFO L226 Difference]: Without dead ends: 119 [2018-01-30 03:55:45,452 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 03:55:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-30 03:55:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-01-30 03:55:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 03:55:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2018-01-30 03:55:45,458 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 92 [2018-01-30 03:55:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:45,458 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2018-01-30 03:55:45,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 03:55:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-01-30 03:55:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-30 03:55:45,459 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:45,459 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:45,459 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1239219758, now seen corresponding path program 5 times [2018-01-30 03:55:45,459 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:45,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:45,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:45,460 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:45,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:45,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 4 proven. 290 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 03:55:45,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:45,566 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:45,571 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:55:45,575 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,580 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,581 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,582 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,582 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,590 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,591 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,592 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,595 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,609 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,613 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:45,624 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:45,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-30 03:55:45,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:45,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-01-30 03:55:45,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 03:55:45,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 03:55:45,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 03:55:45,653 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 13 states. [2018-01-30 03:55:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:45,682 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-01-30 03:55:45,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 03:55:45,683 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-01-30 03:55:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:45,684 INFO L225 Difference]: With dead ends: 162 [2018-01-30 03:55:45,684 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 03:55:45,684 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 03:55:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 03:55:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-01-30 03:55:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-30 03:55:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2018-01-30 03:55:45,687 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 108 [2018-01-30 03:55:45,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:45,687 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2018-01-30 03:55:45,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 03:55:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2018-01-30 03:55:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-30 03:55:45,688 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:45,688 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:45,688 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:45,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1111368515, now seen corresponding path program 6 times [2018-01-30 03:55:45,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:45,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:45,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:45,689 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:45,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:45,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 4 proven. 352 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 03:55:46,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:46,070 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:46,075 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:55:46,085 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:46,095 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:46,100 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:46,101 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:46,103 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:46,104 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:46,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2018-01-30 03:55:46,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:46,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-01-30 03:55:46,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 03:55:46,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 03:55:46,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-01-30 03:55:46,220 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 22 states. [2018-01-30 03:55:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:46,396 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2018-01-30 03:55:46,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 03:55:46,396 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 114 [2018-01-30 03:55:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:46,396 INFO L225 Difference]: With dead ends: 190 [2018-01-30 03:55:46,396 INFO L226 Difference]: Without dead ends: 133 [2018-01-30 03:55:46,397 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-01-30 03:55:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-30 03:55:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2018-01-30 03:55:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-30 03:55:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2018-01-30 03:55:46,401 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 114 [2018-01-30 03:55:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:46,402 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2018-01-30 03:55:46,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 03:55:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2018-01-30 03:55:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-30 03:55:46,403 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:46,403 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 4, 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] [2018-01-30 03:55:46,403 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1578358543, now seen corresponding path program 7 times [2018-01-30 03:55:46,403 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:46,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:46,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:46,404 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:46,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:46,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 4 proven. 420 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-30 03:55:46,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:46,529 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:46,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:46,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-30 03:55:46,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:46,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-01-30 03:55:46,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 03:55:46,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 03:55:46,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-01-30 03:55:46,592 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand 15 states. [2018-01-30 03:55:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:46,921 INFO L93 Difference]: Finished difference Result 182 states and 188 transitions. [2018-01-30 03:55:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 03:55:46,921 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 124 [2018-01-30 03:55:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:46,922 INFO L225 Difference]: With dead ends: 182 [2018-01-30 03:55:46,922 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 03:55:46,922 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-01-30 03:55:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 03:55:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-01-30 03:55:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-30 03:55:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-01-30 03:55:46,925 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 124 [2018-01-30 03:55:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:46,925 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-01-30 03:55:46,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 03:55:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-01-30 03:55:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-01-30 03:55:46,926 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:46,926 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 4, 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] [2018-01-30 03:55:46,926 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:46,926 INFO L82 PathProgramCache]: Analyzing trace with hash 481131514, now seen corresponding path program 8 times [2018-01-30 03:55:46,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:46,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:46,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:46,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:46,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:46,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 4 proven. 494 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-30 03:55:47,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:47,266 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:47,271 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:55:47,276 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:47,283 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:47,294 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:47,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-30 03:55:47,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:47,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-01-30 03:55:47,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 03:55:47,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 03:55:47,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 03:55:47,325 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 16 states. [2018-01-30 03:55:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:47,434 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2018-01-30 03:55:47,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 03:55:47,435 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 130 [2018-01-30 03:55:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:47,435 INFO L225 Difference]: With dead ends: 188 [2018-01-30 03:55:47,435 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 03:55:47,436 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 03:55:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 03:55:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-01-30 03:55:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-30 03:55:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2018-01-30 03:55:47,439 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 130 [2018-01-30 03:55:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:47,440 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2018-01-30 03:55:47,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 03:55:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2018-01-30 03:55:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-01-30 03:55:47,441 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:47,441 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 4, 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] [2018-01-30 03:55:47,441 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash -774601563, now seen corresponding path program 9 times [2018-01-30 03:55:47,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:47,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:47,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:47,442 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:47,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:47,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 4 proven. 574 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-30 03:55:47,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:47,571 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:47,576 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:55:47,582 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:47,584 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:47,587 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:47,589 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:47,589 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:47,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:47,613 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 03:55:47,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:55:47,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:55:47,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:55:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 14 proven. 18 refuted. 2 times theorem prover too weak. 578 trivial. 0 not checked. [2018-01-30 03:55:47,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:47,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2018-01-30 03:55:47,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 03:55:47,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 03:55:48,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=689, Unknown=5, NotChecked=0, Total=870 [2018-01-30 03:55:48,000 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 30 states. [2018-01-30 03:55:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:48,715 INFO L93 Difference]: Finished difference Result 223 states and 234 transitions. [2018-01-30 03:55:48,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 03:55:48,715 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 136 [2018-01-30 03:55:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:48,716 INFO L225 Difference]: With dead ends: 223 [2018-01-30 03:55:48,716 INFO L226 Difference]: Without dead ends: 155 [2018-01-30 03:55:48,717 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=562, Invalid=2509, Unknown=9, NotChecked=0, Total=3080 [2018-01-30 03:55:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-30 03:55:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-01-30 03:55:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-30 03:55:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 152 transitions. [2018-01-30 03:55:48,719 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 152 transitions. Word has length 136 [2018-01-30 03:55:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:48,720 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 152 transitions. [2018-01-30 03:55:48,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 03:55:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2018-01-30 03:55:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-01-30 03:55:48,720 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:48,721 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 5, 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] [2018-01-30 03:55:48,721 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1715844937, now seen corresponding path program 10 times [2018-01-30 03:55:48,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:48,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:48,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:48,721 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:48,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:48,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 4 proven. 660 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-30 03:55:48,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:48,883 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:48,888 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:55:48,908 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:48,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:48,969 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 03:55:48,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:55:48,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:55:48,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:55:48,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:55:48,997 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 03:55:48,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:55:49,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:55:49,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 03:55:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 3 proven. 214 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-01-30 03:55:49,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:49,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-01-30 03:55:49,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 03:55:49,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 03:55:49,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 03:55:49,339 INFO L87 Difference]: Start difference. First operand 149 states and 152 transitions. Second operand 36 states. [2018-01-30 03:55:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:50,229 INFO L93 Difference]: Finished difference Result 223 states and 231 transitions. [2018-01-30 03:55:50,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 03:55:50,229 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 146 [2018-01-30 03:55:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:50,230 INFO L225 Difference]: With dead ends: 223 [2018-01-30 03:55:50,230 INFO L226 Difference]: Without dead ends: 174 [2018-01-30 03:55:50,230 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=572, Invalid=3088, Unknown=0, NotChecked=0, Total=3660 [2018-01-30 03:55:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-30 03:55:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2018-01-30 03:55:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-30 03:55:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-01-30 03:55:50,234 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 146 [2018-01-30 03:55:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:50,234 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-01-30 03:55:50,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 03:55:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-01-30 03:55:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-01-30 03:55:50,235 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:50,235 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 5, 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] [2018-01-30 03:55:50,235 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash 101780965, now seen corresponding path program 11 times [2018-01-30 03:55:50,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:50,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:50,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:50,236 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:50,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:50,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 6 proven. 752 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-01-30 03:55:50,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:50,667 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:50,672 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:55:50,677 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,677 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,678 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,679 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,680 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,681 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,682 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,683 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,685 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,686 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,688 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,689 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,692 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,695 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,699 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,703 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,710 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:50,710 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:50,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-01-30 03:55:50,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:50,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-01-30 03:55:50,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 03:55:50,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 03:55:50,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-01-30 03:55:50,748 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 19 states. [2018-01-30 03:55:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:50,799 INFO L93 Difference]: Finished difference Result 234 states and 240 transitions. [2018-01-30 03:55:50,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 03:55:50,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 162 [2018-01-30 03:55:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:50,807 INFO L225 Difference]: With dead ends: 234 [2018-01-30 03:55:50,807 INFO L226 Difference]: Without dead ends: 175 [2018-01-30 03:55:50,807 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-01-30 03:55:50,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-30 03:55:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-01-30 03:55:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-30 03:55:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 174 transitions. [2018-01-30 03:55:50,810 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 174 transitions. Word has length 162 [2018-01-30 03:55:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:50,810 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 174 transitions. [2018-01-30 03:55:50,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 03:55:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2018-01-30 03:55:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-01-30 03:55:50,811 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:50,811 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 5, 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] [2018-01-30 03:55:50,811 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash 741517968, now seen corresponding path program 12 times [2018-01-30 03:55:50,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:50,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:50,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:50,812 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:50,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:50,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 6 proven. 850 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-01-30 03:55:51,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:51,241 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:51,246 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:55:51,253 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:51,255 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:51,256 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:51,258 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:51,260 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:51,261 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:51,264 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:51,266 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:51,267 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:51,268 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:51,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:51,309 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 03:55:51,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:55:51,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:55:51,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:55:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-01-30 03:55:51,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:51,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-01-30 03:55:51,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 03:55:51,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 03:55:51,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 03:55:51,597 INFO L87 Difference]: Start difference. First operand 171 states and 174 transitions. Second operand 36 states. [2018-01-30 03:55:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:52,246 INFO L93 Difference]: Finished difference Result 281 states and 294 transitions. [2018-01-30 03:55:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-30 03:55:52,247 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 168 [2018-01-30 03:55:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:52,248 INFO L225 Difference]: With dead ends: 281 [2018-01-30 03:55:52,248 INFO L226 Difference]: Without dead ends: 222 [2018-01-30 03:55:52,249 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=645, Invalid=3015, Unknown=0, NotChecked=0, Total=3660 [2018-01-30 03:55:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-30 03:55:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 208. [2018-01-30 03:55:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-30 03:55:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 215 transitions. [2018-01-30 03:55:52,259 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 215 transitions. Word has length 168 [2018-01-30 03:55:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:52,259 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 215 transitions. [2018-01-30 03:55:52,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 03:55:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 215 transitions. [2018-01-30 03:55:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-30 03:55:52,260 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:52,260 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 6, 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] [2018-01-30 03:55:52,260 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:52,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1258367458, now seen corresponding path program 13 times [2018-01-30 03:55:52,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:52,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:52,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:52,262 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:52,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:52,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 6 proven. 954 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-01-30 03:55:52,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:52,605 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:52,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:52,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-01-30 03:55:52,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:52,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-01-30 03:55:52,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 03:55:52,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 03:55:52,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-01-30 03:55:52,662 INFO L87 Difference]: Start difference. First operand 208 states and 215 transitions. Second operand 21 states. [2018-01-30 03:55:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:52,708 INFO L93 Difference]: Finished difference Result 308 states and 322 transitions. [2018-01-30 03:55:52,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 03:55:52,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 178 [2018-01-30 03:55:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:52,709 INFO L225 Difference]: With dead ends: 308 [2018-01-30 03:55:52,709 INFO L226 Difference]: Without dead ends: 218 [2018-01-30 03:55:52,709 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-01-30 03:55:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-30 03:55:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2018-01-30 03:55:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-30 03:55:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 221 transitions. [2018-01-30 03:55:52,714 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 221 transitions. Word has length 178 [2018-01-30 03:55:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:52,714 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 221 transitions. [2018-01-30 03:55:52,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 03:55:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 221 transitions. [2018-01-30 03:55:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 03:55:52,715 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:52,715 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 6, 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] [2018-01-30 03:55:52,715 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1944195213, now seen corresponding path program 14 times [2018-01-30 03:55:52,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:52,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:52,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:52,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:55:52,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:52,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 6 proven. 1064 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-01-30 03:55:52,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:52,900 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:52,904 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:55:52,909 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:52,919 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:52,921 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:52,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-01-30 03:55:52,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:52,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-01-30 03:55:52,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 03:55:52,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 03:55:52,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-01-30 03:55:52,957 INFO L87 Difference]: Start difference. First operand 214 states and 221 transitions. Second operand 22 states. [2018-01-30 03:55:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:53,028 INFO L93 Difference]: Finished difference Result 314 states and 328 transitions. [2018-01-30 03:55:53,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 03:55:53,029 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 184 [2018-01-30 03:55:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:53,030 INFO L225 Difference]: With dead ends: 314 [2018-01-30 03:55:53,030 INFO L226 Difference]: Without dead ends: 224 [2018-01-30 03:55:53,031 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-01-30 03:55:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-30 03:55:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2018-01-30 03:55:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-30 03:55:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 227 transitions. [2018-01-30 03:55:53,035 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 227 transitions. Word has length 184 [2018-01-30 03:55:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:53,036 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 227 transitions. [2018-01-30 03:55:53,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 03:55:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 227 transitions. [2018-01-30 03:55:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-30 03:55:53,036 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:53,036 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 6, 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] [2018-01-30 03:55:53,037 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1547171080, now seen corresponding path program 15 times [2018-01-30 03:55:53,037 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:53,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:53,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:53,037 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:53,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:53,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 6 proven. 1180 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-01-30 03:55:53,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:53,452 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:53,456 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:55:53,462 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:53,464 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:53,466 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:53,469 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:53,471 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:53,474 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:55:53,475 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:53,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:53,536 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 03:55:53,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:55:53,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:55:53,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:55:53,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:55:53,565 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 03:55:53,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:55:53,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:55:53,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 03:55:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 6 proven. 77 refuted. 0 times theorem prover too weak. 1192 trivial. 0 not checked. [2018-01-30 03:55:53,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:53,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 39 [2018-01-30 03:55:53,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 03:55:53,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 03:55:53,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 03:55:53,832 INFO L87 Difference]: Start difference. First operand 220 states and 227 transitions. Second operand 39 states. [2018-01-30 03:55:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:54,636 INFO L93 Difference]: Finished difference Result 339 states and 356 transitions. [2018-01-30 03:55:54,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 03:55:54,637 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 190 [2018-01-30 03:55:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:54,638 INFO L225 Difference]: With dead ends: 339 [2018-01-30 03:55:54,638 INFO L226 Difference]: Without dead ends: 249 [2018-01-30 03:55:54,639 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=877, Invalid=4235, Unknown=0, NotChecked=0, Total=5112 [2018-01-30 03:55:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-30 03:55:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 205. [2018-01-30 03:55:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-30 03:55:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 208 transitions. [2018-01-30 03:55:54,647 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 208 transitions. Word has length 190 [2018-01-30 03:55:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:54,647 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 208 transitions. [2018-01-30 03:55:54,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 03:55:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 208 transitions. [2018-01-30 03:55:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-01-30 03:55:54,647 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:54,648 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:54,648 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:54,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1284721855, now seen corresponding path program 16 times [2018-01-30 03:55:54,648 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:54,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:54,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:54,648 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:54,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:54,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 8 proven. 1302 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-01-30 03:55:54,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:54,878 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:54,883 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:55:54,898 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:54,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 56 proven. 32 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-01-30 03:55:55,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:55,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 38 [2018-01-30 03:55:55,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-30 03:55:55,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-30 03:55:55,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2018-01-30 03:55:55,085 INFO L87 Difference]: Start difference. First operand 205 states and 208 transitions. Second operand 38 states. [2018-01-30 03:55:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:57,284 INFO L93 Difference]: Finished difference Result 318 states and 329 transitions. [2018-01-30 03:55:57,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 03:55:57,285 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 202 [2018-01-30 03:55:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:57,285 INFO L225 Difference]: With dead ends: 318 [2018-01-30 03:55:57,285 INFO L226 Difference]: Without dead ends: 221 [2018-01-30 03:55:57,286 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1073, Invalid=3483, Unknown=0, NotChecked=0, Total=4556 [2018-01-30 03:55:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-30 03:55:57,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2018-01-30 03:55:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-30 03:55:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 218 transitions. [2018-01-30 03:55:57,291 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 218 transitions. Word has length 202 [2018-01-30 03:55:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:57,291 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 218 transitions. [2018-01-30 03:55:57,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-30 03:55:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 218 transitions. [2018-01-30 03:55:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-01-30 03:55:57,292 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:57,292 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:57,292 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:57,292 INFO L82 PathProgramCache]: Analyzing trace with hash -980564335, now seen corresponding path program 17 times [2018-01-30 03:55:57,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:57,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:57,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:57,292 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:57,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:57,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 8 proven. 1430 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-01-30 03:55:57,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:57,824 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:57,828 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:55:57,833 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,845 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,855 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,865 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,875 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,885 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,895 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,905 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,918 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,928 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,938 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,948 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,958 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,968 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,978 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,988 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:57,998 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:58,009 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:58,023 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:58,031 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:58,041 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:58,051 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:58,062 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:55:58,069 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:58,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-01-30 03:55:58,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:55:58,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-01-30 03:55:58,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 03:55:58,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 03:55:58,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-01-30 03:55:58,110 INFO L87 Difference]: Start difference. First operand 215 states and 218 transitions. Second operand 25 states. [2018-01-30 03:55:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:55:58,166 INFO L93 Difference]: Finished difference Result 298 states and 304 transitions. [2018-01-30 03:55:58,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 03:55:58,166 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 212 [2018-01-30 03:55:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:55:58,166 INFO L225 Difference]: With dead ends: 298 [2018-01-30 03:55:58,167 INFO L226 Difference]: Without dead ends: 225 [2018-01-30 03:55:58,167 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-01-30 03:55:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-30 03:55:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2018-01-30 03:55:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-30 03:55:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 224 transitions. [2018-01-30 03:55:58,171 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 224 transitions. Word has length 212 [2018-01-30 03:55:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:55:58,171 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 224 transitions. [2018-01-30 03:55:58,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 03:55:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 224 transitions. [2018-01-30 03:55:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-01-30 03:55:58,172 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:55:58,172 INFO L350 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:55:58,172 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:55:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 628966012, now seen corresponding path program 18 times [2018-01-30 03:55:58,172 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:55:58,172 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:55:58,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:58,172 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:55:58,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:55:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:55:58,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:55:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 8 proven. 1564 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-01-30 03:55:59,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:55:59,210 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:55:59,215 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:55:59,220 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,221 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,223 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,224 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,226 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,228 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,230 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,233 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,235 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,238 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,241 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:55:59,242 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:55:59,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:55:59,471 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 03:55:59,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:55:59,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:55:59,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:56:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 8 proven. 98 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2018-01-30 03:56:00,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:00,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 45 [2018-01-30 03:56:00,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-30 03:56:00,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-30 03:56:00,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=1602, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 03:56:00,855 INFO L87 Difference]: Start difference. First operand 221 states and 224 transitions. Second operand 45 states. [2018-01-30 03:56:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:02,789 INFO L93 Difference]: Finished difference Result 345 states and 358 transitions. [2018-01-30 03:56:02,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 03:56:02,789 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 218 [2018-01-30 03:56:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:02,790 INFO L225 Difference]: With dead ends: 345 [2018-01-30 03:56:02,790 INFO L226 Difference]: Without dead ends: 237 [2018-01-30 03:56:02,791 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1641 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1161, Invalid=6493, Unknown=2, NotChecked=0, Total=7656 [2018-01-30 03:56:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-30 03:56:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2018-01-30 03:56:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-30 03:56:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 234 transitions. [2018-01-30 03:56:02,796 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 234 transitions. Word has length 218 [2018-01-30 03:56:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:02,796 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 234 transitions. [2018-01-30 03:56:02,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-30 03:56:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 234 transitions. [2018-01-30 03:56:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-30 03:56:02,797 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:02,797 INFO L350 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:02,797 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:02,797 INFO L82 PathProgramCache]: Analyzing trace with hash 559210446, now seen corresponding path program 19 times [2018-01-30 03:56:02,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:02,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:02,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:02,798 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:02,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:02,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 8 proven. 1704 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-01-30 03:56:03,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:03,287 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:03,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:56:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:03,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-01-30 03:56:03,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:03,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-01-30 03:56:03,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 03:56:03,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 03:56:03,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-01-30 03:56:03,358 INFO L87 Difference]: Start difference. First operand 231 states and 234 transitions. Second operand 27 states. [2018-01-30 03:56:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:03,497 INFO L93 Difference]: Finished difference Result 318 states and 324 transitions. [2018-01-30 03:56:03,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 03:56:03,498 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 228 [2018-01-30 03:56:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:03,499 INFO L225 Difference]: With dead ends: 318 [2018-01-30 03:56:03,499 INFO L226 Difference]: Without dead ends: 241 [2018-01-30 03:56:03,499 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-01-30 03:56:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-01-30 03:56:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2018-01-30 03:56:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-30 03:56:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 240 transitions. [2018-01-30 03:56:03,503 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 240 transitions. Word has length 228 [2018-01-30 03:56:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:03,503 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 240 transitions. [2018-01-30 03:56:03,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 03:56:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 240 transitions. [2018-01-30 03:56:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-01-30 03:56:03,504 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:03,504 INFO L350 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:03,504 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1826432441, now seen corresponding path program 20 times [2018-01-30 03:56:03,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:03,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:03,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:03,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:56:03,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:03,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 8 proven. 1850 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-01-30 03:56:03,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:03,861 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:03,866 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:56:03,873 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:03,888 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:03,890 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:03,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-01-30 03:56:03,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:03,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-01-30 03:56:03,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 03:56:03,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 03:56:03,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-01-30 03:56:03,939 INFO L87 Difference]: Start difference. First operand 237 states and 240 transitions. Second operand 28 states. [2018-01-30 03:56:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:04,024 INFO L93 Difference]: Finished difference Result 324 states and 330 transitions. [2018-01-30 03:56:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 03:56:04,025 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 234 [2018-01-30 03:56:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:04,025 INFO L225 Difference]: With dead ends: 324 [2018-01-30 03:56:04,025 INFO L226 Difference]: Without dead ends: 247 [2018-01-30 03:56:04,026 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-01-30 03:56:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-01-30 03:56:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2018-01-30 03:56:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-30 03:56:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 246 transitions. [2018-01-30 03:56:04,031 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 246 transitions. Word has length 234 [2018-01-30 03:56:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:04,031 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 246 transitions. [2018-01-30 03:56:04,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 03:56:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 246 transitions. [2018-01-30 03:56:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-30 03:56:04,032 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:04,032 INFO L350 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:04,032 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1883893916, now seen corresponding path program 21 times [2018-01-30 03:56:04,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:04,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:04,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:04,033 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:04,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:04,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2154 backedges. 8 proven. 2002 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-01-30 03:56:04,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:04,718 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:04,723 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:56:04,729 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:04,742 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:04,750 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:04,753 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:04,756 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:04,759 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:04,762 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:04,764 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:04,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:05,894 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 03:56:05,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:05,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:56:05,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:56:05,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:56:05,924 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 03:56:05,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:05,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:56:05,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 03:56:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2154 backedges. 8 proven. 120 refuted. 0 times theorem prover too weak. 2026 trivial. 0 not checked. [2018-01-30 03:56:06,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:06,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21] total 48 [2018-01-30 03:56:06,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-30 03:56:06,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-30 03:56:06,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=1802, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 03:56:06,374 INFO L87 Difference]: Start difference. First operand 243 states and 246 transitions. Second operand 48 states. [2018-01-30 03:56:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:07,284 INFO L93 Difference]: Finished difference Result 343 states and 351 transitions. [2018-01-30 03:56:07,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-30 03:56:07,284 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 240 [2018-01-30 03:56:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:07,285 INFO L225 Difference]: With dead ends: 343 [2018-01-30 03:56:07,285 INFO L226 Difference]: Without dead ends: 266 [2018-01-30 03:56:07,287 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1366, Invalid=6644, Unknown=0, NotChecked=0, Total=8010 [2018-01-30 03:56:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-30 03:56:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 259. [2018-01-30 03:56:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-01-30 03:56:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 262 transitions. [2018-01-30 03:56:07,303 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 262 transitions. Word has length 240 [2018-01-30 03:56:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:07,303 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 262 transitions. [2018-01-30 03:56:07,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-30 03:56:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 262 transitions. [2018-01-30 03:56:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-01-30 03:56:07,304 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:07,304 INFO L350 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:07,304 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:07,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1704649966, now seen corresponding path program 22 times [2018-01-30 03:56:07,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:07,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:07,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:07,310 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:07,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:07,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2357 backedges. 10 proven. 2160 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-01-30 03:56:07,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:07,683 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:07,688 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:56:07,705 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:07,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:07,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, 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 03:56:07,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:07,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:56:07,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-30 03:56:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2357 backedges. 10 proven. 877 refuted. 0 times theorem prover too weak. 1470 trivial. 0 not checked. [2018-01-30 03:56:08,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:08,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 55 [2018-01-30 03:56:08,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-30 03:56:08,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-30 03:56:08,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=2339, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 03:56:08,151 INFO L87 Difference]: Start difference. First operand 259 states and 262 transitions. Second operand 55 states. [2018-01-30 03:56:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:09,329 INFO L93 Difference]: Finished difference Result 370 states and 378 transitions. [2018-01-30 03:56:09,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-30 03:56:09,329 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 256 [2018-01-30 03:56:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:09,330 INFO L225 Difference]: With dead ends: 370 [2018-01-30 03:56:09,330 INFO L226 Difference]: Without dead ends: 283 [2018-01-30 03:56:09,331 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1402, Invalid=6608, Unknown=0, NotChecked=0, Total=8010 [2018-01-30 03:56:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-30 03:56:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2018-01-30 03:56:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-01-30 03:56:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2018-01-30 03:56:09,341 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 256 [2018-01-30 03:56:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:09,341 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2018-01-30 03:56:09,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-30 03:56:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2018-01-30 03:56:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-01-30 03:56:09,342 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:09,342 INFO L350 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:09,342 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1708839104, now seen corresponding path program 23 times [2018-01-30 03:56:09,342 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:09,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:09,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:09,343 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:09,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:09,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 12 proven. 2324 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-01-30 03:56:09,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:09,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:09,814 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:56:09,819 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,821 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,821 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,822 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,823 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,824 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,825 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,826 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,827 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,829 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,831 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,832 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,834 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,836 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,839 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,841 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,844 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,848 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,851 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,855 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,860 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,865 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,871 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,878 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,886 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,895 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,905 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,916 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,937 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:09,938 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:09,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-01-30 03:56:09,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:09,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-01-30 03:56:09,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 03:56:09,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 03:56:09,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-01-30 03:56:09,990 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand 31 states. [2018-01-30 03:56:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:10,077 INFO L93 Difference]: Finished difference Result 382 states and 388 transitions. [2018-01-30 03:56:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 03:56:10,077 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 272 [2018-01-30 03:56:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:10,078 INFO L225 Difference]: With dead ends: 382 [2018-01-30 03:56:10,078 INFO L226 Difference]: Without dead ends: 285 [2018-01-30 03:56:10,078 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-01-30 03:56:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-30 03:56:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2018-01-30 03:56:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-30 03:56:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2018-01-30 03:56:10,084 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 272 [2018-01-30 03:56:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:10,084 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2018-01-30 03:56:10,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 03:56:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2018-01-30 03:56:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-01-30 03:56:10,085 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:10,085 INFO L350 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:10,085 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -5472085, now seen corresponding path program 24 times [2018-01-30 03:56:10,085 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:10,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:10,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:10,086 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:10,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:10,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2746 backedges. 12 proven. 2494 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-01-30 03:56:10,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:10,659 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:10,665 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:56:10,671 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,672 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,673 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,675 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,676 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,678 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,681 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,683 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,686 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,689 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,692 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,697 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,700 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:10,701 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:10,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2746 backedges. 120 proven. 72 refuted. 0 times theorem prover too weak. 2554 trivial. 0 not checked. [2018-01-30 03:56:11,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:11,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22] total 52 [2018-01-30 03:56:11,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-30 03:56:11,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-30 03:56:11,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=2046, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 03:56:11,047 INFO L87 Difference]: Start difference. First operand 281 states and 284 transitions. Second operand 52 states. [2018-01-30 03:56:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:11,866 INFO L93 Difference]: Finished difference Result 434 states and 447 transitions. [2018-01-30 03:56:11,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-01-30 03:56:11,869 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 278 [2018-01-30 03:56:11,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:11,870 INFO L225 Difference]: With dead ends: 434 [2018-01-30 03:56:11,870 INFO L226 Difference]: Without dead ends: 297 [2018-01-30 03:56:11,871 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1858 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1968, Invalid=6774, Unknown=0, NotChecked=0, Total=8742 [2018-01-30 03:56:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-01-30 03:56:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2018-01-30 03:56:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-30 03:56:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2018-01-30 03:56:11,878 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 278 [2018-01-30 03:56:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:11,878 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2018-01-30 03:56:11,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-30 03:56:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2018-01-30 03:56:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-01-30 03:56:11,879 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:11,879 INFO L350 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:11,879 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash -950280835, now seen corresponding path program 25 times [2018-01-30 03:56:11,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:11,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:11,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:11,880 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:11,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:11,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 12 proven. 2670 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-01-30 03:56:12,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:12,648 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:12,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:56:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:12,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-01-30 03:56:12,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:12,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-01-30 03:56:12,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 03:56:12,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 03:56:12,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 03:56:12,745 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand 33 states. [2018-01-30 03:56:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:12,817 INFO L93 Difference]: Finished difference Result 402 states and 408 transitions. [2018-01-30 03:56:12,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 03:56:12,817 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 288 [2018-01-30 03:56:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:12,818 INFO L225 Difference]: With dead ends: 402 [2018-01-30 03:56:12,818 INFO L226 Difference]: Without dead ends: 301 [2018-01-30 03:56:12,818 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 03:56:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-01-30 03:56:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-01-30 03:56:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-30 03:56:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 300 transitions. [2018-01-30 03:56:12,823 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 300 transitions. Word has length 288 [2018-01-30 03:56:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:12,823 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 300 transitions. [2018-01-30 03:56:12,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 03:56:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 300 transitions. [2018-01-30 03:56:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-01-30 03:56:12,824 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:12,824 INFO L350 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:12,824 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1256130328, now seen corresponding path program 26 times [2018-01-30 03:56:12,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:12,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:12,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:12,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:56:12,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:12,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3130 backedges. 12 proven. 2852 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-01-30 03:56:13,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:13,702 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:13,707 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:56:13,713 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:13,729 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:13,732 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:13,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3130 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-01-30 03:56:13,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:13,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-01-30 03:56:13,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 03:56:13,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 03:56:13,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 03:56:13,787 INFO L87 Difference]: Start difference. First operand 297 states and 300 transitions. Second operand 34 states. [2018-01-30 03:56:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:13,885 INFO L93 Difference]: Finished difference Result 408 states and 414 transitions. [2018-01-30 03:56:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 03:56:13,892 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 294 [2018-01-30 03:56:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:13,893 INFO L225 Difference]: With dead ends: 408 [2018-01-30 03:56:13,893 INFO L226 Difference]: Without dead ends: 307 [2018-01-30 03:56:13,893 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 03:56:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-30 03:56:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-01-30 03:56:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-01-30 03:56:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 306 transitions. [2018-01-30 03:56:13,899 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 306 transitions. Word has length 294 [2018-01-30 03:56:13,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:13,899 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 306 transitions. [2018-01-30 03:56:13,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 03:56:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 306 transitions. [2018-01-30 03:56:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-01-30 03:56:13,900 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:13,900 INFO L350 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:13,900 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:13,900 INFO L82 PathProgramCache]: Analyzing trace with hash -543123437, now seen corresponding path program 27 times [2018-01-30 03:56:13,900 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:13,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:13,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:13,901 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:13,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:13,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3318 backedges. 12 proven. 3040 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-01-30 03:56:14,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:14,542 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:14,546 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:56:14,552 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:14,554 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:14,556 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:14,559 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:14,562 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:14,567 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:14,573 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:14,582 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:14,584 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:14,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:14,798 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 03:56:14,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:14,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:56:14,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:56:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3318 backedges. 12 proven. 206 refuted. 0 times theorem prover too weak. 3100 trivial. 0 not checked. [2018-01-30 03:56:15,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:15,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 27] total 60 [2018-01-30 03:56:15,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-30 03:56:15,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-30 03:56:15,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=661, Invalid=2879, Unknown=0, NotChecked=0, Total=3540 [2018-01-30 03:56:15,296 INFO L87 Difference]: Start difference. First operand 303 states and 306 transitions. Second operand 60 states. [2018-01-30 03:56:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:16,845 INFO L93 Difference]: Finished difference Result 473 states and 489 transitions. [2018-01-30 03:56:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-01-30 03:56:16,845 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 300 [2018-01-30 03:56:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:16,846 INFO L225 Difference]: With dead ends: 473 [2018-01-30 03:56:16,846 INFO L226 Difference]: Without dead ends: 372 [2018-01-30 03:56:16,847 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2397 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1914, Invalid=9216, Unknown=0, NotChecked=0, Total=11130 [2018-01-30 03:56:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-01-30 03:56:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 358. [2018-01-30 03:56:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-30 03:56:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 368 transitions. [2018-01-30 03:56:16,855 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 368 transitions. Word has length 300 [2018-01-30 03:56:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:16,855 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 368 transitions. [2018-01-30 03:56:16,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-30 03:56:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 368 transitions. [2018-01-30 03:56:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-01-30 03:56:16,856 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:16,856 INFO L350 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 9, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:16,856 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:16,856 INFO L82 PathProgramCache]: Analyzing trace with hash 996679333, now seen corresponding path program 28 times [2018-01-30 03:56:16,857 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:16,857 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:16,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:16,857 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:16,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:16,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 12 proven. 3234 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-01-30 03:56:17,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:17,604 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:17,608 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:56:17,629 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:17,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:17,753 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 03:56:17,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:17,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:56:17,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:56:17,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:56:17,793 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 03:56:17,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:17,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:56:17,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 03:56:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 11 proven. 1326 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2018-01-30 03:56:18,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:18,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2018-01-30 03:56:18,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-01-30 03:56:18,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-01-30 03:56:18,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=3920, Unknown=0, NotChecked=0, Total=4830 [2018-01-30 03:56:18,647 INFO L87 Difference]: Start difference. First operand 358 states and 368 transitions. Second operand 70 states. [2018-01-30 03:56:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:21,037 INFO L93 Difference]: Finished difference Result 539 states and 563 transitions. [2018-01-30 03:56:21,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-30 03:56:21,037 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 310 [2018-01-30 03:56:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:21,038 INFO L225 Difference]: With dead ends: 539 [2018-01-30 03:56:21,039 INFO L226 Difference]: Without dead ends: 389 [2018-01-30 03:56:21,040 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3635 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2109, Invalid=12411, Unknown=0, NotChecked=0, Total=14520 [2018-01-30 03:56:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-30 03:56:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 325. [2018-01-30 03:56:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-30 03:56:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 328 transitions. [2018-01-30 03:56:21,050 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 328 transitions. Word has length 310 [2018-01-30 03:56:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:21,050 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 328 transitions. [2018-01-30 03:56:21,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-01-30 03:56:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 328 transitions. [2018-01-30 03:56:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 03:56:21,051 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:21,051 INFO L350 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:21,051 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash 896182124, now seen corresponding path program 29 times [2018-01-30 03:56:21,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:21,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:21,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:21,052 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:21,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:21,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3777 backedges. 14 proven. 3434 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2018-01-30 03:56:21,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:21,691 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:21,696 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:56:21,701 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,708 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,709 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,710 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,711 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,712 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,713 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,714 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,715 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,717 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,718 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,720 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,722 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,724 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,727 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,730 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,733 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,736 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,740 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,743 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,748 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,753 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,759 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,765 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,771 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,779 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,787 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,797 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,808 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,820 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,834 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,849 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,866 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,884 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,910 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:21,911 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:21,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3777 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-01-30 03:56:21,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:21,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-01-30 03:56:21,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 03:56:21,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 03:56:21,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 03:56:21,985 INFO L87 Difference]: Start difference. First operand 325 states and 328 transitions. Second operand 37 states. [2018-01-30 03:56:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:22,130 INFO L93 Difference]: Finished difference Result 446 states and 452 transitions. [2018-01-30 03:56:22,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-30 03:56:22,130 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 322 [2018-01-30 03:56:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:22,131 INFO L225 Difference]: With dead ends: 446 [2018-01-30 03:56:22,131 INFO L226 Difference]: Without dead ends: 335 [2018-01-30 03:56:22,131 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 03:56:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-30 03:56:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-01-30 03:56:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-01-30 03:56:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 334 transitions. [2018-01-30 03:56:22,139 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 334 transitions. Word has length 322 [2018-01-30 03:56:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:22,139 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 334 transitions. [2018-01-30 03:56:22,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 03:56:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 334 transitions. [2018-01-30 03:56:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-01-30 03:56:22,140 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:22,140 INFO L350 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:22,140 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:22,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1254172695, now seen corresponding path program 30 times [2018-01-30 03:56:22,140 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:22,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:22,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:22,141 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:22,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:22,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3983 backedges. 14 proven. 3640 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2018-01-30 03:56:22,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:22,712 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:22,716 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:56:22,723 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,724 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,725 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,727 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,729 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,730 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,733 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,735 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,738 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,740 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,746 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,753 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,756 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,761 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,766 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:22,767 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:22,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3983 backedges. 161 proven. 98 refuted. 0 times theorem prover too weak. 3724 trivial. 0 not checked. [2018-01-30 03:56:23,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:23,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 25] total 61 [2018-01-30 03:56:23,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-01-30 03:56:23,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-01-30 03:56:23,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=841, Invalid=2819, Unknown=0, NotChecked=0, Total=3660 [2018-01-30 03:56:23,729 INFO L87 Difference]: Start difference. First operand 331 states and 334 transitions. Second operand 61 states. [2018-01-30 03:56:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:24,580 INFO L93 Difference]: Finished difference Result 504 states and 518 transitions. [2018-01-30 03:56:24,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-01-30 03:56:24,580 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 328 [2018-01-30 03:56:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:24,581 INFO L225 Difference]: With dead ends: 504 [2018-01-30 03:56:24,581 INFO L226 Difference]: Without dead ends: 347 [2018-01-30 03:56:24,583 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2620 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2749, Invalid=9461, Unknown=0, NotChecked=0, Total=12210 [2018-01-30 03:56:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-01-30 03:56:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 341. [2018-01-30 03:56:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-01-30 03:56:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 344 transitions. [2018-01-30 03:56:24,589 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 344 transitions. Word has length 328 [2018-01-30 03:56:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:24,590 INFO L432 AbstractCegarLoop]: Abstraction has 341 states and 344 transitions. [2018-01-30 03:56:24,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-01-30 03:56:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 344 transitions. [2018-01-30 03:56:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-01-30 03:56:24,591 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:24,591 INFO L350 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:24,591 INFO L371 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1208115945, now seen corresponding path program 31 times [2018-01-30 03:56:24,591 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:24,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:24,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:24,592 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:24,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:24,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 14 proven. 3852 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2018-01-30 03:56:25,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:25,292 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:25,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:56:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:25,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2018-01-30 03:56:25,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:25,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-01-30 03:56:25,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 03:56:25,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 03:56:25,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 03:56:25,398 INFO L87 Difference]: Start difference. First operand 341 states and 344 transitions. Second operand 39 states. [2018-01-30 03:56:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:25,510 INFO L93 Difference]: Finished difference Result 466 states and 472 transitions. [2018-01-30 03:56:25,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 03:56:25,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 338 [2018-01-30 03:56:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:25,511 INFO L225 Difference]: With dead ends: 466 [2018-01-30 03:56:25,511 INFO L226 Difference]: Without dead ends: 351 [2018-01-30 03:56:25,512 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 03:56:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-01-30 03:56:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 347. [2018-01-30 03:56:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-01-30 03:56:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 350 transitions. [2018-01-30 03:56:25,518 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 350 transitions. Word has length 338 [2018-01-30 03:56:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:25,519 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 350 transitions. [2018-01-30 03:56:25,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 03:56:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 350 transitions. [2018-01-30 03:56:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-01-30 03:56:25,520 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:25,520 INFO L350 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:25,520 INFO L371 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:25,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1043321452, now seen corresponding path program 32 times [2018-01-30 03:56:25,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:25,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:25,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:25,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:56:25,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:25,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4443 backedges. 14 proven. 4070 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2018-01-30 03:56:26,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:26,290 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:26,295 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:56:26,302 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:26,324 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:26,327 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:26,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4443 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2018-01-30 03:56:26,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:26,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-01-30 03:56:26,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 03:56:26,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 03:56:26,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 03:56:26,395 INFO L87 Difference]: Start difference. First operand 347 states and 350 transitions. Second operand 40 states. [2018-01-30 03:56:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:26,510 INFO L93 Difference]: Finished difference Result 472 states and 478 transitions. [2018-01-30 03:56:26,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-30 03:56:26,510 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 344 [2018-01-30 03:56:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:26,511 INFO L225 Difference]: With dead ends: 472 [2018-01-30 03:56:26,511 INFO L226 Difference]: Without dead ends: 357 [2018-01-30 03:56:26,511 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 03:56:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-01-30 03:56:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2018-01-30 03:56:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-01-30 03:56:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 356 transitions. [2018-01-30 03:56:26,525 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 356 transitions. Word has length 344 [2018-01-30 03:56:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:26,525 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 356 transitions. [2018-01-30 03:56:26,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 03:56:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 356 transitions. [2018-01-30 03:56:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-01-30 03:56:26,532 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:26,532 INFO L350 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:26,532 INFO L371 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash -295171073, now seen corresponding path program 33 times [2018-01-30 03:56:26,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:26,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:26,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:26,533 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:26,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:26,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4667 backedges. 14 proven. 4294 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2018-01-30 03:56:27,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:27,224 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:27,229 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:56:27,236 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:27,238 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:27,240 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:27,243 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:27,250 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:27,259 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:27,264 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:27,270 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:27,276 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:27,278 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:27,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:27,393 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 03:56:27,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:27,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:56:27,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:56:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4667 backedges. 18 proven. 270 refuted. 1 times theorem prover too weak. 4378 trivial. 0 not checked. [2018-01-30 03:56:28,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:28,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 30] total 69 [2018-01-30 03:56:28,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-01-30 03:56:28,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-01-30 03:56:28,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=3781, Unknown=3, NotChecked=0, Total=4692 [2018-01-30 03:56:28,131 INFO L87 Difference]: Start difference. First operand 353 states and 356 transitions. Second operand 69 states. [2018-01-30 03:56:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:30,465 INFO L93 Difference]: Finished difference Result 537 states and 553 transitions. [2018-01-30 03:56:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-01-30 03:56:30,465 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 350 [2018-01-30 03:56:30,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:30,466 INFO L225 Difference]: With dead ends: 537 [2018-01-30 03:56:30,466 INFO L226 Difference]: Without dead ends: 369 [2018-01-30 03:56:30,467 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4254 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2846, Invalid=16332, Unknown=4, NotChecked=0, Total=19182 [2018-01-30 03:56:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-01-30 03:56:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2018-01-30 03:56:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-01-30 03:56:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 366 transitions. [2018-01-30 03:56:30,473 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 366 transitions. Word has length 350 [2018-01-30 03:56:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:30,474 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 366 transitions. [2018-01-30 03:56:30,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-01-30 03:56:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 366 transitions. [2018-01-30 03:56:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-01-30 03:56:30,475 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:30,475 INFO L350 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 10, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:30,475 INFO L371 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:30,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1363394415, now seen corresponding path program 34 times [2018-01-30 03:56:30,475 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:30,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:30,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:30,476 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:30,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:30,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 14 proven. 4524 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-01-30 03:56:31,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:31,155 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:31,159 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:56:31,191 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:31,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:31,697 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 03:56:31,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:31,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:56:31,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:56:31,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:56:31,741 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 03:56:31,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:31,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:56:31,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 03:56:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 13 proven. 1812 refuted. 0 times theorem prover too weak. 3106 trivial. 0 not checked. [2018-01-30 03:56:32,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:32,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 80 [2018-01-30 03:56:32,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-01-30 03:56:32,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-01-30 03:56:32,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1222, Invalid=5098, Unknown=0, NotChecked=0, Total=6320 [2018-01-30 03:56:32,636 INFO L87 Difference]: Start difference. First operand 363 states and 366 transitions. Second operand 80 states. [2018-01-30 03:56:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:35,620 INFO L93 Difference]: Finished difference Result 507 states and 515 transitions. [2018-01-30 03:56:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-01-30 03:56:35,621 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 360 [2018-01-30 03:56:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:35,622 INFO L225 Difference]: With dead ends: 507 [2018-01-30 03:56:35,622 INFO L226 Difference]: Without dead ends: 388 [2018-01-30 03:56:35,623 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4824 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2826, Invalid=16356, Unknown=0, NotChecked=0, Total=19182 [2018-01-30 03:56:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-01-30 03:56:35,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 379. [2018-01-30 03:56:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-01-30 03:56:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 382 transitions. [2018-01-30 03:56:35,634 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 382 transitions. Word has length 360 [2018-01-30 03:56:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:35,634 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 382 transitions. [2018-01-30 03:56:35,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-01-30 03:56:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 382 transitions. [2018-01-30 03:56:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-01-30 03:56:35,645 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:35,646 INFO L350 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:35,646 INFO L371 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2084020991, now seen corresponding path program 35 times [2018-01-30 03:56:35,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:35,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:35,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:35,646 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:35,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:35,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5242 backedges. 16 proven. 4760 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-01-30 03:56:36,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:36,455 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-30 03:56:36,460 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:36,468 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,476 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,477 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,478 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,478 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,479 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,480 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,482 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,483 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,484 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,486 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,488 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,490 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,492 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,494 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,497 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,500 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,503 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,507 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,511 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,515 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,520 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,525 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,531 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,538 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,546 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,554 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,563 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,573 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,584 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,596 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,609 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,624 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,642 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,661 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,682 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,705 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,730 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,757 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,786 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,892 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:36,895 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:36,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5242 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-01-30 03:56:36,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:36,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-01-30 03:56:36,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 03:56:36,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 03:56:36,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 03:56:36,973 INFO L87 Difference]: Start difference. First operand 379 states and 382 transitions. Second operand 43 states. [2018-01-30 03:56:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:37,094 INFO L93 Difference]: Finished difference Result 518 states and 524 transitions. [2018-01-30 03:56:37,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 03:56:37,094 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 376 [2018-01-30 03:56:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:37,095 INFO L225 Difference]: With dead ends: 518 [2018-01-30 03:56:37,095 INFO L226 Difference]: Without dead ends: 389 [2018-01-30 03:56:37,096 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 03:56:37,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-30 03:56:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2018-01-30 03:56:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-01-30 03:56:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 388 transitions. [2018-01-30 03:56:37,104 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 388 transitions. Word has length 376 [2018-01-30 03:56:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:37,104 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 388 transitions. [2018-01-30 03:56:37,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 03:56:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 388 transitions. [2018-01-30 03:56:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-01-30 03:56:37,105 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:37,105 INFO L350 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:37,106 INFO L371 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:37,106 INFO L82 PathProgramCache]: Analyzing trace with hash 990057834, now seen corresponding path program 36 times [2018-01-30 03:56:37,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:37,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:37,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:37,106 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:37,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:37,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5484 backedges. 16 proven. 5002 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-01-30 03:56:37,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:37,865 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:37,870 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:56:37,877 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,878 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,879 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,881 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,883 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,884 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,886 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,889 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,892 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,894 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,898 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,902 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,906 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,913 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,919 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,927 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,932 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,941 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,950 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:56:37,952 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:37,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:38,067 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 03:56:38,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:38,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:56:38,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:56:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5484 backedges. 68 proven. 298 refuted. 4 times theorem prover too weak. 5114 trivial. 0 not checked. [2018-01-30 03:56:38,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:38,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 33] total 75 [2018-01-30 03:56:38,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-01-30 03:56:38,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-01-30 03:56:38,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1077, Invalid=4466, Unknown=7, NotChecked=0, Total=5550 [2018-01-30 03:56:38,854 INFO L87 Difference]: Start difference. First operand 385 states and 388 transitions. Second operand 75 states. [2018-01-30 03:56:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:41,473 INFO L93 Difference]: Finished difference Result 589 states and 606 transitions. [2018-01-30 03:56:41,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-01-30 03:56:41,473 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 382 [2018-01-30 03:56:41,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:41,474 INFO L225 Difference]: With dead ends: 589 [2018-01-30 03:56:41,474 INFO L226 Difference]: Without dead ends: 401 [2018-01-30 03:56:41,476 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5333 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3578, Invalid=19366, Unknown=8, NotChecked=0, Total=22952 [2018-01-30 03:56:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-01-30 03:56:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 395. [2018-01-30 03:56:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-01-30 03:56:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 398 transitions. [2018-01-30 03:56:41,490 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 398 transitions. Word has length 382 [2018-01-30 03:56:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:41,491 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 398 transitions. [2018-01-30 03:56:41,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-01-30 03:56:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 398 transitions. [2018-01-30 03:56:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-01-30 03:56:41,493 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:41,493 INFO L350 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 11, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:41,493 INFO L371 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1514444092, now seen corresponding path program 37 times [2018-01-30 03:56:41,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:41,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:41,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:41,494 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:41,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:41,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5770 backedges. 16 proven. 5250 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2018-01-30 03:56:42,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:42,272 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:42,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:56:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:42,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5770 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-01-30 03:56:42,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:42,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-01-30 03:56:42,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-30 03:56:42,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-30 03:56:42,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 03:56:42,390 INFO L87 Difference]: Start difference. First operand 395 states and 398 transitions. Second operand 45 states. [2018-01-30 03:56:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:42,506 INFO L93 Difference]: Finished difference Result 538 states and 544 transitions. [2018-01-30 03:56:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-30 03:56:42,506 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 392 [2018-01-30 03:56:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:42,507 INFO L225 Difference]: With dead ends: 538 [2018-01-30 03:56:42,507 INFO L226 Difference]: Without dead ends: 405 [2018-01-30 03:56:42,508 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 03:56:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-01-30 03:56:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2018-01-30 03:56:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-01-30 03:56:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 404 transitions. [2018-01-30 03:56:42,516 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 404 transitions. Word has length 392 [2018-01-30 03:56:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:42,517 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 404 transitions. [2018-01-30 03:56:42,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-30 03:56:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 404 transitions. [2018-01-30 03:56:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-01-30 03:56:42,518 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:42,518 INFO L350 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 11, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:42,518 INFO L371 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2129383847, now seen corresponding path program 38 times [2018-01-30 03:56:42,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:42,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:42,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:42,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:56:42,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:42,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 16 proven. 5504 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2018-01-30 03:56:43,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:43,390 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:43,395 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:56:43,402 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:43,423 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:56:43,427 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:43,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-01-30 03:56:43,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:43,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-01-30 03:56:43,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-30 03:56:43,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-30 03:56:43,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-01-30 03:56:43,521 INFO L87 Difference]: Start difference. First operand 401 states and 404 transitions. Second operand 46 states. [2018-01-30 03:56:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:56:43,622 INFO L93 Difference]: Finished difference Result 544 states and 550 transitions. [2018-01-30 03:56:43,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-30 03:56:43,622 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 398 [2018-01-30 03:56:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:56:43,623 INFO L225 Difference]: With dead ends: 544 [2018-01-30 03:56:43,623 INFO L226 Difference]: Without dead ends: 411 [2018-01-30 03:56:43,624 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-01-30 03:56:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-01-30 03:56:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2018-01-30 03:56:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-01-30 03:56:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 410 transitions. [2018-01-30 03:56:43,641 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 410 transitions. Word has length 398 [2018-01-30 03:56:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:56:43,642 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 410 transitions. [2018-01-30 03:56:43,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-30 03:56:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 410 transitions. [2018-01-30 03:56:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-01-30 03:56:43,643 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:56:43,643 INFO L350 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 11, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:56:43,643 INFO L371 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:56:43,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1550897618, now seen corresponding path program 39 times [2018-01-30 03:56:43,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:56:43,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:56:43,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:43,644 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:56:43,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:56:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:56:43,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:56:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6284 backedges. 16 proven. 5764 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2018-01-30 03:56:44,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:56:44,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:56:44,493 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:56:44,500 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,502 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,504 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,507 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,510 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,514 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,518 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,523 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,528 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,533 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,539 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:56:44,542 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:56:44,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:56:44,663 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 03:56:44,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:44,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:56:44,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:56:44,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:56:44,706 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 03:56:44,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:56:44,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:56:44,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 03:56:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6284 backedges. 16 proven. 392 refuted. 0 times theorem prover too weak. 5876 trivial. 0 not checked. [2018-01-30 03:56:45,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:56:45,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 33] total 78 [2018-01-30 03:56:45,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-30 03:56:45,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-30 03:56:45,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1161, Invalid=4845, Unknown=0, NotChecked=0, Total=6006 [2018-01-30 03:56:45,580 INFO L87 Difference]: Start difference. First operand 407 states and 410 transitions. Second operand 78 states. Received shutdown request... [2018-01-30 03:56:46,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-30 03:56:46,205 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 03:56:46,208 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 03:56:46,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 03:56:46 BasicIcfg [2018-01-30 03:56:46,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 03:56:46,209 INFO L168 Benchmark]: Toolchain (without parser) took 64813.66 ms. Allocated memory was 151.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 116.2 MB in the beginning and 859.6 MB in the end (delta: -743.4 MB). Peak memory consumption was 276.3 MB. Max. memory is 5.3 GB. [2018-01-30 03:56:46,210 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 151.0 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 03:56:46,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 102.12 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 107.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-30 03:56:46,210 INFO L168 Benchmark]: Boogie Preprocessor took 17.41 ms. Allocated memory is still 151.0 MB. Free memory was 107.9 MB in the beginning and 106.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 03:56:46,210 INFO L168 Benchmark]: RCFGBuilder took 380.62 ms. Allocated memory is still 151.0 MB. Free memory was 106.2 MB in the beginning and 94.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-30 03:56:46,210 INFO L168 Benchmark]: IcfgTransformer took 12.18 ms. Allocated memory is still 151.0 MB. Free memory was 94.0 MB in the beginning and 92.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 5.3 GB. [2018-01-30 03:56:46,211 INFO L168 Benchmark]: TraceAbstraction took 64298.90 ms. Allocated memory was 151.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 92.7 MB in the beginning and 859.6 MB in the end (delta: -766.9 MB). Peak memory consumption was 252.8 MB. Max. memory is 5.3 GB. [2018-01-30 03:56:46,211 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 151.0 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 102.12 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 107.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.41 ms. Allocated memory is still 151.0 MB. Free memory was 107.9 MB in the beginning and 106.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 380.62 ms. Allocated memory is still 151.0 MB. Free memory was 106.2 MB in the beginning and 94.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 12.18 ms. Allocated memory is still 151.0 MB. Free memory was 94.0 MB in the beginning and 92.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64298.90 ms. Allocated memory was 151.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 92.7 MB in the beginning and 859.6 MB in the end (delta: -766.9 MB). Peak memory consumption was 252.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 3]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 3). Cancelled while BasicCegarLoop was constructing difference of abstraction (407states) and interpolant automaton (currently 38 states, 78 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 113 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. TIMEOUT Result, 64.2s OverallTime, 46 OverallIterations, 45 TraceHistogramMax, 26.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1737 SDtfs, 6475 SDslu, 41406 SDs, 0 SdLazy, 31944 SolverSat, 750 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11313 GetRequests, 9138 SyntacticMatches, 0 SemanticMatches, 2174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37720 ImplicationChecksByTransitivity, 36.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=45, 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.2s AutomataMinimizationTime, 45 MinimizatonAttempts, 341 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 32.2s InterpolantComputationTime, 19014 NumberOfCodeBlocks, 17253 NumberOfCodeBlocksAsserted, 355 NumberOfCheckSat, 18924 ConstructedInterpolants, 382 QuantifiedInterpolants, 15520934 SizeOfPredicates, 259 NumberOfNonLiveVariables, 11182 ConjunctsInSsa, 1241 ConjunctsInUnsatCore, 90 InterpolantComputations, 3 PerfectInterpolantSequences, 53351/190456 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/standard_strcpy_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_03-56-46-216.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_03-56-46-216.csv Completed graceful shutdown