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/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 00:30:11,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:30:11,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:30:11,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:30:11,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:30:11,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:30:11,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:30:11,974 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:30:11,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:30:11,975 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:30:11,976 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:30:11,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:30:11,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:30:11,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:30:11,978 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:30:11,979 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:30:11,980 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:30:11,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:30:11,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:30:11,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:30:11,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:30:11,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:30:11,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:30:11,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:30:11,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:30:11,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:30:11,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:30:11,985 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:30:11,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:30:11,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:30:11,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:30:11,986 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 00:30:11,993 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:30:11,993 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:30:11,993 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:30:11,993 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:30:11,993 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:30:11,993 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:30:11,994 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:30:11,994 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:30:11,994 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:30:11,994 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:30:11,994 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:30:11,994 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:30:11,994 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 00:30:11,995 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:30:11,995 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 00:30:11,995 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:30:11,995 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 00:30:11,995 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 00:30:11,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:30:11,995 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:30:11,995 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:30:11,995 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:30:11,995 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:30:11,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:30:11,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:30:11,998 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:30:11,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:30:11,999 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:30:11,999 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:30:11,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:30:11,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:30:11,999 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:30:11,999 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:30:11,999 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:30:12,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:30:12,030 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:30:12,032 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:30:12,034 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:30:12,035 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:30:12,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i [2018-01-30 00:30:12,096 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:30:12,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:30:12,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:30:12,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:30:12,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:30:12,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:30:12" (1/1) ... [2018-01-30 00:30:12,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382ccaeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12, skipping insertion in model container [2018-01-30 00:30:12,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:30:12" (1/1) ... [2018-01-30 00:30:12,115 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:30:12,124 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:30:12,198 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:30:12,207 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:30:12,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12 WrapperNode [2018-01-30 00:30:12,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:30:12,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:30:12,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:30:12,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:30:12,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12" (1/1) ... [2018-01-30 00:30:12,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12" (1/1) ... [2018-01-30 00:30:12,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12" (1/1) ... [2018-01-30 00:30:12,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12" (1/1) ... [2018-01-30 00:30:12,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12" (1/1) ... [2018-01-30 00:30:12,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12" (1/1) ... [2018-01-30 00:30:12,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12" (1/1) ... [2018-01-30 00:30:12,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:30:12,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:30:12,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:30:12,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:30:12,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12" (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 00:30:12,271 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:30:12,271 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:30:12,271 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 00:30:12,271 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:30:12,271 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:30:12,271 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 00:30:12,271 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:30:12,271 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:30:12,271 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:30:12,272 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:30:12,547 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:30:12,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:30:12 BoogieIcfgContainer [2018-01-30 00:30:12,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:30:12,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:30:12,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:30:12,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:30:12,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:30:12" (1/3) ... [2018-01-30 00:30:12,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d05890b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:30:12, skipping insertion in model container [2018-01-30 00:30:12,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:30:12" (2/3) ... [2018-01-30 00:30:12,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d05890b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:30:12, skipping insertion in model container [2018-01-30 00:30:12,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:30:12" (3/3) ... [2018-01-30 00:30:12,556 INFO L107 eAbstractionObserver]: Analyzing ICFG array_shadowinit_true-unreach-call_true-termination.i [2018-01-30 00:30:12,562 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:30:12,567 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 00:30:12,595 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:30:12,595 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:30:12,595 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:30:12,595 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:30:12,595 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:30:12,595 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:30:12,595 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:30:12,595 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:30:12,596 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:30:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-01-30 00:30:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:30:12,611 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:12,612 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:12,612 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash 506005027, now seen corresponding path program 1 times [2018-01-30 00:30:12,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:12,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:12,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:12,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:12,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:12,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:12,694 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 00:30:12,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:30:12,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:30:12,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:30:12,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:30:12,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:30:12,707 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-01-30 00:30:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:12,720 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-01-30 00:30:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:30:12,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-30 00:30:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:12,728 INFO L225 Difference]: With dead ends: 51 [2018-01-30 00:30:12,728 INFO L226 Difference]: Without dead ends: 30 [2018-01-30 00:30:12,731 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 00:30:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-30 00:30:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-30 00:30:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-30 00:30:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-01-30 00:30:12,755 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 22 [2018-01-30 00:30:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:12,756 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-01-30 00:30:12,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:30:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-01-30 00:30:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:30:12,757 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:12,757 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:12,757 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1042364467, now seen corresponding path program 1 times [2018-01-30 00:30:12,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:12,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:12,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:12,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:12,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:12,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:12,870 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 00:30:12,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:30:12,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:30:12,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:30:12,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:30:12,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:30:12,887 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 4 states. [2018-01-30 00:30:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:13,077 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-30 00:30:13,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:30:13,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-30 00:30:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:13,090 INFO L225 Difference]: With dead ends: 45 [2018-01-30 00:30:13,090 INFO L226 Difference]: Without dead ends: 34 [2018-01-30 00:30:13,091 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:30:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-30 00:30:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-01-30 00:30:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-30 00:30:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-30 00:30:13,098 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-01-30 00:30:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:13,098 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-30 00:30:13,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:30:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-30 00:30:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:30:13,098 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:13,099 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:13,099 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:13,099 INFO L82 PathProgramCache]: Analyzing trace with hash 465021416, now seen corresponding path program 1 times [2018-01-30 00:30:13,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:13,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:13,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:13,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:13,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:13,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:13,322 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 00:30:13,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:13,323 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 00:30:13,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:13,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:13,394 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 6 treesize of output 5 [2018-01-30 00:30:13,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:13,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:30:13,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:30:13,453 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 00:30:13,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:13,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-01-30 00:30:13,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:30:13,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:30:13,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:30:13,471 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2018-01-30 00:30:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:13,618 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-30 00:30:13,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:30:13,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-30 00:30:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:13,619 INFO L225 Difference]: With dead ends: 53 [2018-01-30 00:30:13,620 INFO L226 Difference]: Without dead ends: 43 [2018-01-30 00:30:13,620 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:30:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-30 00:30:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-01-30 00:30:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-30 00:30:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-01-30 00:30:13,624 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 28 [2018-01-30 00:30:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:13,624 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-01-30 00:30:13,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:30:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-01-30 00:30:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:30:13,625 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:13,625 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:13,625 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 32109192, now seen corresponding path program 1 times [2018-01-30 00:30:13,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:13,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:13,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:13,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:13,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:13,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:30:13,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:13,723 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 00:30:13,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:13,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:30:13,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:13,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-30 00:30:13,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:30:13,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:30:13,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:30:13,927 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 9 states. [2018-01-30 00:30:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:14,214 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-01-30 00:30:14,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:30:14,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-30 00:30:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:14,217 INFO L225 Difference]: With dead ends: 72 [2018-01-30 00:30:14,217 INFO L226 Difference]: Without dead ends: 51 [2018-01-30 00:30:14,218 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:30:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-30 00:30:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-01-30 00:30:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-30 00:30:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-01-30 00:30:14,224 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2018-01-30 00:30:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:14,228 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-01-30 00:30:14,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:30:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-01-30 00:30:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-30 00:30:14,229 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:14,229 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:14,229 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 91526221, now seen corresponding path program 2 times [2018-01-30 00:30:14,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:14,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:14,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:14,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:14,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:14,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:30:14,442 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:14,442 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) [2018-01-30 00:30:14,456 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:30:14,461 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:14,474 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:14,486 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:14,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:14,525 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 6 treesize of output 5 [2018-01-30 00:30:14,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:14,529 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 00:30:14,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:30:14,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:14,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-01-30 00:30:14,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:30:14,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:30:14,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:30:14,596 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 15 states. [2018-01-30 00:30:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:14,791 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-01-30 00:30:14,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:30:14,792 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-30 00:30:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:14,792 INFO L225 Difference]: With dead ends: 69 [2018-01-30 00:30:14,792 INFO L226 Difference]: Without dead ends: 59 [2018-01-30 00:30:14,793 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:30:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-30 00:30:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-01-30 00:30:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-30 00:30:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-30 00:30:14,799 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 41 [2018-01-30 00:30:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:14,799 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-30 00:30:14,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:30:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-30 00:30:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-30 00:30:14,799 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:14,799 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:14,800 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:14,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2082252781, now seen corresponding path program 3 times [2018-01-30 00:30:14,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:14,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:14,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:14,800 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:14,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:14,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:30:14,940 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:14,940 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 00:30:14,945 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:30:14,956 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:14,958 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:14,961 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:14,961 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:14,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:30:15,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:15,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-01-30 00:30:15,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:30:15,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:30:15,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:30:15,021 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 12 states. [2018-01-30 00:30:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:15,257 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-01-30 00:30:15,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:30:15,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-01-30 00:30:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:15,259 INFO L225 Difference]: With dead ends: 93 [2018-01-30 00:30:15,259 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 00:30:15,259 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:30:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 00:30:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-01-30 00:30:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-30 00:30:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-30 00:30:15,264 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 49 [2018-01-30 00:30:15,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:15,265 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-30 00:30:15,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:30:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-30 00:30:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:30:15,266 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:15,266 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:15,266 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:15,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1414254152, now seen corresponding path program 4 times [2018-01-30 00:30:15,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:15,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:15,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:15,267 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:15,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:15,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 00:30:15,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:15,381 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:30:15,385 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:30:15,406 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:15,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:15,479 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 6 treesize of output 5 [2018-01-30 00:30:15,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:15,482 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 00:30:15,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:30:15,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:15,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-01-30 00:30:15,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:30:15,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:30:15,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:30:15,570 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 22 states. [2018-01-30 00:30:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:15,775 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-01-30 00:30:15,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:30:15,776 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-01-30 00:30:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:15,776 INFO L225 Difference]: With dead ends: 82 [2018-01-30 00:30:15,776 INFO L226 Difference]: Without dead ends: 72 [2018-01-30 00:30:15,777 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:30:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-30 00:30:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2018-01-30 00:30:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 00:30:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-01-30 00:30:15,781 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 54 [2018-01-30 00:30:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:15,781 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-01-30 00:30:15,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:30:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-01-30 00:30:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:30:15,782 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:15,782 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:15,782 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1614563608, now seen corresponding path program 5 times [2018-01-30 00:30:15,782 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:15,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:15,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:15,783 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:15,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:15,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 00:30:15,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:15,916 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 00:30:15,928 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:30:15,932 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:15,937 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:15,938 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:15,941 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:15,942 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:15,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 00:30:16,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:16,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-01-30 00:30:16,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:30:16,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:30:16,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:30:16,074 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 15 states. [2018-01-30 00:30:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:16,257 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-30 00:30:16,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:30:16,258 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-01-30 00:30:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:16,258 INFO L225 Difference]: With dead ends: 114 [2018-01-30 00:30:16,258 INFO L226 Difference]: Without dead ends: 77 [2018-01-30 00:30:16,259 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:30:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-30 00:30:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2018-01-30 00:30:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-30 00:30:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-01-30 00:30:16,267 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 62 [2018-01-30 00:30:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:16,267 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-01-30 00:30:16,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:30:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-01-30 00:30:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:30:16,268 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:16,268 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:16,268 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:16,268 INFO L82 PathProgramCache]: Analyzing trace with hash 28900461, now seen corresponding path program 6 times [2018-01-30 00:30:16,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:16,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:16,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:16,269 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:16,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:16,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 5 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 00:30:16,464 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:16,464 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 00:30:16,469 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:30:16,476 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:16,477 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:16,479 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:16,480 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:16,482 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:16,483 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:16,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:16,528 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 6 treesize of output 5 [2018-01-30 00:30:16,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:16,598 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 00:30:16,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 00:30:16,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:16,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2018-01-30 00:30:16,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:30:16,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:30:16,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:30:16,987 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 21 states. [2018-01-30 00:30:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:17,324 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-01-30 00:30:17,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-30 00:30:17,325 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-01-30 00:30:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:17,325 INFO L225 Difference]: With dead ends: 95 [2018-01-30 00:30:17,325 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 00:30:17,326 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:30:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 00:30:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2018-01-30 00:30:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 00:30:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-01-30 00:30:17,334 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 67 [2018-01-30 00:30:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:17,335 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-01-30 00:30:17,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:30:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-01-30 00:30:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 00:30:17,335 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:17,335 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:17,335 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:17,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1241968653, now seen corresponding path program 7 times [2018-01-30 00:30:17,339 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:17,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:17,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:17,339 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:17,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:17,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 44 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:30:17,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:17,462 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 00:30:17,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:17,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 44 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:30:17,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:17,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-01-30 00:30:17,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 00:30:17,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 00:30:17,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:30:17,570 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 18 states. [2018-01-30 00:30:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:17,760 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-01-30 00:30:17,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 00:30:17,760 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-01-30 00:30:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:17,761 INFO L225 Difference]: With dead ends: 135 [2018-01-30 00:30:17,761 INFO L226 Difference]: Without dead ends: 90 [2018-01-30 00:30:17,761 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:30:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-30 00:30:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-01-30 00:30:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 00:30:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-01-30 00:30:17,766 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 75 [2018-01-30 00:30:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:17,766 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-01-30 00:30:17,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 00:30:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-01-30 00:30:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 00:30:17,767 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:17,767 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:17,767 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:17,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1648129368, now seen corresponding path program 8 times [2018-01-30 00:30:17,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:17,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:17,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:17,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:17,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:17,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 7 proven. 106 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 00:30:17,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:17,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 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 00:30:17,932 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:30:17,941 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:17,946 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:17,952 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:17,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:18,165 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 6 treesize of output 5 [2018-01-30 00:30:18,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:18,170 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 00:30:18,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:30:18,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:18,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 32 [2018-01-30 00:30:18,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-30 00:30:18,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-30 00:30:18,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2018-01-30 00:30:18,313 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 32 states. [2018-01-30 00:30:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:18,856 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-30 00:30:18,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 00:30:18,856 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 80 [2018-01-30 00:30:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:18,857 INFO L225 Difference]: With dead ends: 108 [2018-01-30 00:30:18,857 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 00:30:18,858 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1654, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 00:30:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 00:30:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2018-01-30 00:30:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-30 00:30:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-01-30 00:30:18,865 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 80 [2018-01-30 00:30:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:18,865 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-01-30 00:30:18,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-30 00:30:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-01-30 00:30:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-30 00:30:18,869 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:18,869 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:18,869 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1567167304, now seen corresponding path program 9 times [2018-01-30 00:30:18,869 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:18,869 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:18,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:18,870 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:18,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:18,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 65 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-30 00:30:18,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:18,974 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 00:30:18,979 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:30:18,990 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:18,991 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:18,993 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:18,995 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:18,999 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:19,001 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:19,002 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:19,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 65 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-30 00:30:19,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:19,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-01-30 00:30:19,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:30:19,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:30:19,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:30:19,088 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 21 states. [2018-01-30 00:30:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:19,447 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2018-01-30 00:30:19,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:30:19,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-01-30 00:30:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:19,448 INFO L225 Difference]: With dead ends: 156 [2018-01-30 00:30:19,448 INFO L226 Difference]: Without dead ends: 103 [2018-01-30 00:30:19,448 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:30:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-30 00:30:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-01-30 00:30:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 00:30:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-01-30 00:30:19,454 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 88 [2018-01-30 00:30:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:19,454 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-01-30 00:30:19,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:30:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-01-30 00:30:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-30 00:30:19,455 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:19,455 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:19,455 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash 666881165, now seen corresponding path program 10 times [2018-01-30 00:30:19,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:19,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:19,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:19,456 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:19,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:19,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 9 proven. 155 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-30 00:30:19,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:19,658 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 00:30:19,664 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:30:19,675 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:19,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:19,851 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 6 treesize of output 5 [2018-01-30 00:30:19,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:19,874 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 00:30:19,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 10 proven. 142 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-30 00:30:20,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:20,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 37 [2018-01-30 00:30:20,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 00:30:20,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 00:30:20,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1234, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 00:30:20,033 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 37 states. [2018-01-30 00:30:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:20,649 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-01-30 00:30:20,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-30 00:30:20,649 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 93 [2018-01-30 00:30:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:20,650 INFO L225 Difference]: With dead ends: 121 [2018-01-30 00:30:20,650 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 00:30:20,651 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=2272, Unknown=0, NotChecked=0, Total=2450 [2018-01-30 00:30:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 00:30:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-01-30 00:30:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-30 00:30:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-01-30 00:30:20,667 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 93 [2018-01-30 00:30:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:20,667 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-01-30 00:30:20,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 00:30:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-01-30 00:30:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-30 00:30:20,668 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:20,668 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:20,668 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:20,668 INFO L82 PathProgramCache]: Analyzing trace with hash 751542317, now seen corresponding path program 11 times [2018-01-30 00:30:20,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:20,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:20,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:20,669 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:20,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:20,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 90 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-30 00:30:21,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:21,001 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 00:30:21,006 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:30:21,012 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:21,013 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:21,015 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:21,017 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:21,019 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:21,021 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:21,024 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:21,025 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:21,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 90 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-30 00:30:21,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:21,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-01-30 00:30:21,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 00:30:21,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 00:30:21,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:30:21,157 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 24 states. [2018-01-30 00:30:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:21,317 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2018-01-30 00:30:21,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:30:21,317 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-01-30 00:30:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:21,318 INFO L225 Difference]: With dead ends: 177 [2018-01-30 00:30:21,318 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 00:30:21,318 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=732, Unknown=0, NotChecked=0, Total=992 [2018-01-30 00:30:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 00:30:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2018-01-30 00:30:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-30 00:30:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-01-30 00:30:21,324 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 101 [2018-01-30 00:30:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:21,324 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-01-30 00:30:21,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 00:30:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-01-30 00:30:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-30 00:30:21,325 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:21,325 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:21,325 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:21,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2052006136, now seen corresponding path program 12 times [2018-01-30 00:30:21,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:21,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:21,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:21,326 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:21,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:21,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 11 proven. 213 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 00:30:21,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:21,525 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 00:30:21,531 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:30:21,536 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:21,537 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:21,538 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:21,540 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:21,542 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:21,543 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:21,546 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:21,548 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:21,548 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:21,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:21,555 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 6 treesize of output 5 [2018-01-30 00:30:21,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:21,558 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 00:30:21,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 12 proven. 197 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-30 00:30:21,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:21,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 30 [2018-01-30 00:30:21,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 00:30:21,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 00:30:21,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-30 00:30:21,812 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 30 states. [2018-01-30 00:30:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:23,084 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-01-30 00:30:23,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 00:30:23,084 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 106 [2018-01-30 00:30:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:23,085 INFO L225 Difference]: With dead ends: 134 [2018-01-30 00:30:23,085 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 00:30:23,086 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:30:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 00:30:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2018-01-30 00:30:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-30 00:30:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-01-30 00:30:23,091 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 106 [2018-01-30 00:30:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:23,091 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-01-30 00:30:23,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 00:30:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-01-30 00:30:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-30 00:30:23,092 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:23,092 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:23,092 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash 376178600, now seen corresponding path program 13 times [2018-01-30 00:30:23,098 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:23,098 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:23,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:23,099 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:23,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:23,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 119 proven. 119 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-01-30 00:30:24,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:24,154 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 00:30:24,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:24,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 119 proven. 119 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-01-30 00:30:24,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:24,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-01-30 00:30:24,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:30:24,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:30:24,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:30:24,302 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 27 states. [2018-01-30 00:30:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:24,636 INFO L93 Difference]: Finished difference Result 198 states and 203 transitions. [2018-01-30 00:30:24,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:30:24,637 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 114 [2018-01-30 00:30:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:24,637 INFO L225 Difference]: With dead ends: 198 [2018-01-30 00:30:24,637 INFO L226 Difference]: Without dead ends: 129 [2018-01-30 00:30:24,638 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=936, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:30:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-30 00:30:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-01-30 00:30:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-30 00:30:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-01-30 00:30:24,645 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 114 [2018-01-30 00:30:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:24,645 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-01-30 00:30:24,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:30:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-01-30 00:30:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-30 00:30:24,646 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:24,646 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:24,646 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash 154600621, now seen corresponding path program 14 times [2018-01-30 00:30:24,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:24,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:24,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:24,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:24,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:24,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 13 proven. 280 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-30 00:30:25,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:25,003 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 00:30:25,008 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:30:25,014 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:25,021 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:25,022 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:25,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:25,259 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 6 treesize of output 5 [2018-01-30 00:30:25,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:25,268 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 00:30:25,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 14 proven. 261 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-01-30 00:30:25,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:25,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 47 [2018-01-30 00:30:25,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 00:30:25,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 00:30:25,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2036, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 00:30:25,541 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 47 states. [2018-01-30 00:30:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:26,263 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-01-30 00:30:26,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-30 00:30:26,264 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 119 [2018-01-30 00:30:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:26,265 INFO L225 Difference]: With dead ends: 147 [2018-01-30 00:30:26,265 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 00:30:26,265 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=3802, Unknown=0, NotChecked=0, Total=4032 [2018-01-30 00:30:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 00:30:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2018-01-30 00:30:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-30 00:30:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-01-30 00:30:26,271 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 119 [2018-01-30 00:30:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:26,271 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-01-30 00:30:26,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 00:30:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-01-30 00:30:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-01-30 00:30:26,272 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:26,272 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:26,272 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:26,272 INFO L82 PathProgramCache]: Analyzing trace with hash 672708685, now seen corresponding path program 15 times [2018-01-30 00:30:26,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:26,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:26,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:26,273 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:26,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:26,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 156 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-01-30 00:30:26,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:26,417 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 00:30:26,422 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:30:26,427 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:26,429 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:26,430 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:26,432 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:26,434 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:26,436 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:26,438 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:26,441 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:26,445 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:26,446 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:26,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 156 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-01-30 00:30:26,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:26,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-01-30 00:30:26,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 00:30:26,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 00:30:26,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2018-01-30 00:30:26,599 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 30 states. [2018-01-30 00:30:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:26,836 INFO L93 Difference]: Finished difference Result 219 states and 224 transitions. [2018-01-30 00:30:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:30:26,837 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 127 [2018-01-30 00:30:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:26,838 INFO L225 Difference]: With dead ends: 219 [2018-01-30 00:30:26,838 INFO L226 Difference]: Without dead ends: 142 [2018-01-30 00:30:26,838 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 00:30:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-30 00:30:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2018-01-30 00:30:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-30 00:30:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-01-30 00:30:26,847 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 127 [2018-01-30 00:30:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:26,847 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-01-30 00:30:26,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 00:30:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-01-30 00:30:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-30 00:30:26,848 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:26,848 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:26,848 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:26,848 INFO L82 PathProgramCache]: Analyzing trace with hash 656788328, now seen corresponding path program 16 times [2018-01-30 00:30:26,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:26,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:26,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:26,848 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:26,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:26,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 15 proven. 356 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-01-30 00:30:27,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:27,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 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 00:30:27,217 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:30:27,239 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:27,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:27,509 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 6 treesize of output 5 [2018-01-30 00:30:27,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:27,512 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 00:30:27,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 16 proven. 334 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-01-30 00:30:27,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:27,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 32] total 52 [2018-01-30 00:30:27,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-30 00:30:27,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-30 00:30:27,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2512, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 00:30:27,786 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 52 states. [2018-01-30 00:30:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:28,941 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2018-01-30 00:30:28,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-30 00:30:28,941 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 132 [2018-01-30 00:30:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:28,942 INFO L225 Difference]: With dead ends: 160 [2018-01-30 00:30:28,942 INFO L226 Difference]: Without dead ends: 150 [2018-01-30 00:30:28,943 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=256, Invalid=4714, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 00:30:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-30 00:30:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2018-01-30 00:30:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-30 00:30:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-01-30 00:30:28,956 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 132 [2018-01-30 00:30:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:28,956 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-01-30 00:30:28,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-30 00:30:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-01-30 00:30:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-01-30 00:30:28,956 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:28,957 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:28,957 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1277258744, now seen corresponding path program 17 times [2018-01-30 00:30:28,957 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:28,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:28,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:28,957 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:28,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:28,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 189 proven. 198 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-01-30 00:30:29,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:29,167 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 00:30:29,178 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:30:29,182 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,183 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,185 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,186 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,188 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,190 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,192 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,194 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,196 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,202 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:29,203 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:29,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 189 proven. 198 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-01-30 00:30:29,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:29,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2018-01-30 00:30:29,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:30:29,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:30:29,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:30:29,358 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 33 states. [2018-01-30 00:30:29,507 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 7 DAG size of output 6 [2018-01-30 00:30:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:29,707 INFO L93 Difference]: Finished difference Result 240 states and 245 transitions. [2018-01-30 00:30:29,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 00:30:29,708 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 140 [2018-01-30 00:30:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:29,709 INFO L225 Difference]: With dead ends: 240 [2018-01-30 00:30:29,709 INFO L226 Difference]: Without dead ends: 155 [2018-01-30 00:30:29,709 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=473, Invalid=1419, Unknown=0, NotChecked=0, Total=1892 [2018-01-30 00:30:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-30 00:30:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2018-01-30 00:30:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-30 00:30:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-01-30 00:30:29,722 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 140 [2018-01-30 00:30:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:29,722 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-01-30 00:30:29,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:30:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-01-30 00:30:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-01-30 00:30:29,723 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:29,723 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:29,723 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1706253107, now seen corresponding path program 18 times [2018-01-30 00:30:29,723 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:29,723 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:29,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:29,724 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:29,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:29,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 17 proven. 441 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-30 00:30:30,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:30,127 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 00:30:30,132 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:30:30,138 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,139 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,140 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,142 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,143 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,145 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,150 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,152 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,156 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,158 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,163 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:30,164 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:30,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:30,177 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 6 treesize of output 5 [2018-01-30 00:30:30,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:30,180 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 00:30:30,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 18 proven. 416 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-01-30 00:30:30,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:30,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 39 [2018-01-30 00:30:30,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:30:30,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:30:30,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1383, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:30:30,492 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 39 states. [2018-01-30 00:30:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:31,298 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2018-01-30 00:30:31,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-30 00:30:31,299 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 145 [2018-01-30 00:30:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:31,302 INFO L225 Difference]: With dead ends: 173 [2018-01-30 00:30:31,302 INFO L226 Difference]: Without dead ends: 163 [2018-01-30 00:30:31,303 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=2370, Unknown=0, NotChecked=0, Total=2550 [2018-01-30 00:30:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-30 00:30:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2018-01-30 00:30:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-30 00:30:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-01-30 00:30:31,313 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 145 [2018-01-30 00:30:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:31,313 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-01-30 00:30:31,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:30:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-01-30 00:30:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-30 00:30:31,314 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:31,314 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:31,314 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:31,314 INFO L82 PathProgramCache]: Analyzing trace with hash 572274797, now seen corresponding path program 19 times [2018-01-30 00:30:31,314 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:31,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:31,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:31,315 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:31,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:31,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 230 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 00:30:31,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:31,643 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 00:30:31,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:31,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 230 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 00:30:31,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:31,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2018-01-30 00:30:31,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 00:30:31,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 00:30:31,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:30:31,848 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 36 states. [2018-01-30 00:30:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:32,135 INFO L93 Difference]: Finished difference Result 261 states and 266 transitions. [2018-01-30 00:30:32,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 00:30:32,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 153 [2018-01-30 00:30:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:32,137 INFO L225 Difference]: With dead ends: 261 [2018-01-30 00:30:32,137 INFO L226 Difference]: Without dead ends: 168 [2018-01-30 00:30:32,138 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=558, Invalid=1698, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 00:30:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-30 00:30:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2018-01-30 00:30:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-30 00:30:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-01-30 00:30:32,146 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 153 [2018-01-30 00:30:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:32,146 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-01-30 00:30:32,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 00:30:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-01-30 00:30:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-01-30 00:30:32,147 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:32,147 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:32,147 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1253330888, now seen corresponding path program 20 times [2018-01-30 00:30:32,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:32,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:32,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:32,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:32,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:32,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 19 proven. 535 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-01-30 00:30:32,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:32,555 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 00:30:32,560 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:30:32,566 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:32,575 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:32,578 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:32,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:32,947 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 6 treesize of output 5 [2018-01-30 00:30:32,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:32,950 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 00:30:32,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 20 proven. 507 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 00:30:33,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:33,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 38] total 62 [2018-01-30 00:30:33,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-01-30 00:30:33,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-01-30 00:30:33,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3614, Unknown=0, NotChecked=0, Total=3782 [2018-01-30 00:30:33,378 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 62 states. [2018-01-30 00:30:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:34,870 INFO L93 Difference]: Finished difference Result 186 states and 191 transitions. [2018-01-30 00:30:34,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-30 00:30:34,871 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 158 [2018-01-30 00:30:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:34,871 INFO L225 Difference]: With dead ends: 186 [2018-01-30 00:30:34,872 INFO L226 Difference]: Without dead ends: 176 [2018-01-30 00:30:34,873 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=308, Invalid=6832, Unknown=0, NotChecked=0, Total=7140 [2018-01-30 00:30:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-30 00:30:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2018-01-30 00:30:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-30 00:30:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2018-01-30 00:30:34,880 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 158 [2018-01-30 00:30:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:34,880 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2018-01-30 00:30:34,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-01-30 00:30:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2018-01-30 00:30:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-01-30 00:30:34,881 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:34,881 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:34,881 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1280489576, now seen corresponding path program 21 times [2018-01-30 00:30:34,881 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:34,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:34,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:34,882 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:34,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:34,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 275 proven. 297 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-01-30 00:30:35,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:35,127 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 00:30:35,132 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:30:35,137 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,138 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,140 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,142 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,143 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,146 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,148 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,151 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,155 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,158 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,164 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,168 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:35,169 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:35,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 275 proven. 297 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-01-30 00:30:35,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:35,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 39 [2018-01-30 00:30:35,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:30:35,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:30:35,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:30:35,372 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 39 states. [2018-01-30 00:30:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:36,669 INFO L93 Difference]: Finished difference Result 282 states and 287 transitions. [2018-01-30 00:30:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 00:30:36,669 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 166 [2018-01-30 00:30:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:36,670 INFO L225 Difference]: With dead ends: 282 [2018-01-30 00:30:36,670 INFO L226 Difference]: Without dead ends: 181 [2018-01-30 00:30:36,671 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 00:30:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-30 00:30:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2018-01-30 00:30:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-30 00:30:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2018-01-30 00:30:36,678 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 166 [2018-01-30 00:30:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:36,678 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2018-01-30 00:30:36,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:30:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2018-01-30 00:30:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-01-30 00:30:36,679 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:36,679 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:36,679 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:36,679 INFO L82 PathProgramCache]: Analyzing trace with hash 296660205, now seen corresponding path program 22 times [2018-01-30 00:30:36,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:36,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:36,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:36,680 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:36,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:36,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 21 proven. 638 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-30 00:30:37,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:37,102 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 00:30:37,106 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:30:37,122 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:37,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:37,622 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 6 treesize of output 5 [2018-01-30 00:30:37,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:37,625 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 00:30:37,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 22 proven. 607 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-01-30 00:30:38,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:38,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 41] total 67 [2018-01-30 00:30:38,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-01-30 00:30:38,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-01-30 00:30:38,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=4240, Unknown=0, NotChecked=0, Total=4422 [2018-01-30 00:30:38,064 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 67 states. [2018-01-30 00:30:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:39,251 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2018-01-30 00:30:39,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-30 00:30:39,251 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 171 [2018-01-30 00:30:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:39,252 INFO L225 Difference]: With dead ends: 199 [2018-01-30 00:30:39,252 INFO L226 Difference]: Without dead ends: 189 [2018-01-30 00:30:39,253 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=334, Invalid=8038, Unknown=0, NotChecked=0, Total=8372 [2018-01-30 00:30:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-30 00:30:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2018-01-30 00:30:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-30 00:30:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-01-30 00:30:39,261 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 171 [2018-01-30 00:30:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:39,261 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-01-30 00:30:39,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-01-30 00:30:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-01-30 00:30:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-01-30 00:30:39,262 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:39,262 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:39,262 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1014751091, now seen corresponding path program 23 times [2018-01-30 00:30:39,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:39,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:39,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:39,263 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:39,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:39,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 324 proven. 354 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-01-30 00:30:39,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:39,780 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 00:30:39,787 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:30:39,794 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,798 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,800 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,802 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,803 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,805 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,808 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,810 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,812 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,815 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,818 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,821 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,833 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:39,834 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:39,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 324 proven. 354 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-01-30 00:30:40,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:40,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 42 [2018-01-30 00:30:40,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-30 00:30:40,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-30 00:30:40,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2018-01-30 00:30:40,256 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 42 states. [2018-01-30 00:30:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:40,570 INFO L93 Difference]: Finished difference Result 303 states and 308 transitions. [2018-01-30 00:30:40,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 00:30:40,570 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 179 [2018-01-30 00:30:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:40,571 INFO L225 Difference]: With dead ends: 303 [2018-01-30 00:30:40,571 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 00:30:40,572 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=749, Invalid=2331, Unknown=0, NotChecked=0, Total=3080 [2018-01-30 00:30:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 00:30:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2018-01-30 00:30:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:30:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 189 transitions. [2018-01-30 00:30:40,581 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 189 transitions. Word has length 179 [2018-01-30 00:30:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:40,581 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 189 transitions. [2018-01-30 00:30:40,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-30 00:30:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 189 transitions. [2018-01-30 00:30:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 00:30:40,581 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:40,582 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:40,582 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2039583704, now seen corresponding path program 24 times [2018-01-30 00:30:40,582 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:40,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:40,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:40,589 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:40,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:40,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:41,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 23 proven. 750 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-01-30 00:30:41,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:41,205 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) [2018-01-30 00:30:41,219 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:30:41,225 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,236 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,247 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,260 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,271 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,283 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,297 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,310 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,317 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,333 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,347 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,360 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,374 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,381 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:41,390 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:41,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:41,426 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 6 treesize of output 5 [2018-01-30 00:30:41,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:41,429 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 00:30:41,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 24 proven. 716 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-01-30 00:30:41,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:41,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 48 [2018-01-30 00:30:41,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-30 00:30:41,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-30 00:30:41,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=2133, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 00:30:41,818 INFO L87 Difference]: Start difference. First operand 187 states and 189 transitions. Second operand 48 states. [2018-01-30 00:30:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:42,956 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2018-01-30 00:30:42,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-30 00:30:42,956 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 184 [2018-01-30 00:30:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:42,957 INFO L225 Difference]: With dead ends: 212 [2018-01-30 00:30:42,957 INFO L226 Difference]: Without dead ends: 202 [2018-01-30 00:30:42,958 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=3681, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 00:30:42,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-30 00:30:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2018-01-30 00:30:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-30 00:30:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2018-01-30 00:30:42,971 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 184 [2018-01-30 00:30:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:42,972 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2018-01-30 00:30:42,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-30 00:30:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-01-30 00:30:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-01-30 00:30:42,972 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:42,973 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:42,974 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1138390216, now seen corresponding path program 25 times [2018-01-30 00:30:42,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:42,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:42,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:42,974 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:42,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:42,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 377 proven. 416 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-30 00:30:43,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:43,404 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) [2018-01-30 00:30:43,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:30:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:43,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 377 proven. 416 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-30 00:30:43,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:43,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 45 [2018-01-30 00:30:43,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-30 00:30:43,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-30 00:30:43,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1501, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 00:30:43,679 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 45 states. [2018-01-30 00:30:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:44,094 INFO L93 Difference]: Finished difference Result 324 states and 329 transitions. [2018-01-30 00:30:44,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 00:30:44,095 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 192 [2018-01-30 00:30:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:44,096 INFO L225 Difference]: With dead ends: 324 [2018-01-30 00:30:44,096 INFO L226 Difference]: Without dead ends: 207 [2018-01-30 00:30:44,096 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=855, Invalid=2685, Unknown=0, NotChecked=0, Total=3540 [2018-01-30 00:30:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-30 00:30:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2018-01-30 00:30:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-30 00:30:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-01-30 00:30:44,109 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 192 [2018-01-30 00:30:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:44,109 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-01-30 00:30:44,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-30 00:30:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-01-30 00:30:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-01-30 00:30:44,109 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:44,110 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:44,110 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -930407155, now seen corresponding path program 26 times [2018-01-30 00:30:44,110 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:44,110 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:44,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:44,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:30:44,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:44,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 25 proven. 871 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-01-30 00:30:44,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:44,781 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 00:30:44,786 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:30:44,792 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:44,803 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:44,806 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:44,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:46,381 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 6 treesize of output 5 [2018-01-30 00:30:46,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:46,384 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 00:30:46,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 26 proven. 834 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-30 00:30:47,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:47,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 47] total 77 [2018-01-30 00:30:47,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-01-30 00:30:47,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-01-30 00:30:47,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=5642, Unknown=0, NotChecked=0, Total=5852 [2018-01-30 00:30:47,941 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 77 states. [2018-01-30 00:30:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:49,813 INFO L93 Difference]: Finished difference Result 225 states and 230 transitions. [2018-01-30 00:30:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-01-30 00:30:49,813 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 197 [2018-01-30 00:30:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:49,814 INFO L225 Difference]: With dead ends: 225 [2018-01-30 00:30:49,814 INFO L226 Difference]: Without dead ends: 215 [2018-01-30 00:30:49,815 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=386, Invalid=10744, Unknown=0, NotChecked=0, Total=11130 [2018-01-30 00:30:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-30 00:30:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 208. [2018-01-30 00:30:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-30 00:30:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2018-01-30 00:30:49,827 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 197 [2018-01-30 00:30:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:49,827 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2018-01-30 00:30:49,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-01-30 00:30:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2018-01-30 00:30:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-01-30 00:30:49,828 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:49,828 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:49,828 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1467904173, now seen corresponding path program 27 times [2018-01-30 00:30:49,828 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:49,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:49,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:49,829 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:49,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:49,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 434 proven. 483 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-01-30 00:30:50,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:50,181 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 00:30:50,185 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:30:50,191 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,203 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,226 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,229 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,231 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,233 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,236 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,239 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,243 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,247 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,252 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,257 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,264 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,270 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,277 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:30:50,278 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:50,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 434 proven. 483 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-01-30 00:30:50,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:50,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 48 [2018-01-30 00:30:50,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-30 00:30:50,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-30 00:30:50,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1713, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 00:30:50,564 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 48 states. [2018-01-30 00:30:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:50,928 INFO L93 Difference]: Finished difference Result 345 states and 350 transitions. [2018-01-30 00:30:50,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 00:30:50,928 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 205 [2018-01-30 00:30:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:50,929 INFO L225 Difference]: With dead ends: 345 [2018-01-30 00:30:50,929 INFO L226 Difference]: Without dead ends: 220 [2018-01-30 00:30:50,930 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=968, Invalid=3064, Unknown=0, NotChecked=0, Total=4032 [2018-01-30 00:30:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-30 00:30:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 213. [2018-01-30 00:30:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-30 00:30:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2018-01-30 00:30:50,940 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 205 [2018-01-30 00:30:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:50,940 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2018-01-30 00:30:50,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-30 00:30:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2018-01-30 00:30:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-01-30 00:30:50,940 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:50,941 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:50,941 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:50,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1575362696, now seen corresponding path program 28 times [2018-01-30 00:30:50,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:50,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:50,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:50,941 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:50,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:50,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 27 proven. 1001 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-01-30 00:30:51,690 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:51,690 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 00:30:51,695 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:30:51,715 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:51,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:52,420 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 6 treesize of output 5 [2018-01-30 00:30:52,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:52,423 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 00:30:52,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 28 proven. 961 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-01-30 00:30:53,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:53,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 50] total 82 [2018-01-30 00:30:53,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-01-30 00:30:53,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-01-30 00:30:53,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=6418, Unknown=0, NotChecked=0, Total=6642 [2018-01-30 00:30:53,031 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 82 states. [2018-01-30 00:30:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:55,048 INFO L93 Difference]: Finished difference Result 238 states and 243 transitions. [2018-01-30 00:30:55,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-01-30 00:30:55,048 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 210 [2018-01-30 00:30:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:55,049 INFO L225 Difference]: With dead ends: 238 [2018-01-30 00:30:55,049 INFO L226 Difference]: Without dead ends: 228 [2018-01-30 00:30:55,050 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2915 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=412, Invalid=12244, Unknown=0, NotChecked=0, Total=12656 [2018-01-30 00:30:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-30 00:30:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 221. [2018-01-30 00:30:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-30 00:30:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 223 transitions. [2018-01-30 00:30:55,061 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 223 transitions. Word has length 210 [2018-01-30 00:30:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:55,061 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 223 transitions. [2018-01-30 00:30:55,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-01-30 00:30:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 223 transitions. [2018-01-30 00:30:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-01-30 00:30:55,062 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:55,062 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:55,062 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:55,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1812449576, now seen corresponding path program 29 times [2018-01-30 00:30:55,062 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:55,062 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:55,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:55,063 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:55,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:55,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 495 proven. 555 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-30 00:30:56,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:56,964 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 00:30:56,968 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:30:56,973 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,974 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,976 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,977 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,979 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,981 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,983 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,985 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,987 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,990 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,993 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,996 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:56,999 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:57,003 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:57,007 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:57,018 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:30:57,019 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:57,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 495 proven. 555 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-30 00:30:57,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:57,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 51 [2018-01-30 00:30:57,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-30 00:30:57,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-30 00:30:57,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=1939, Unknown=0, NotChecked=0, Total=2550 [2018-01-30 00:30:57,352 INFO L87 Difference]: Start difference. First operand 221 states and 223 transitions. Second operand 51 states. [2018-01-30 00:30:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:30:57,702 INFO L93 Difference]: Finished difference Result 366 states and 371 transitions. [2018-01-30 00:30:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-30 00:30:57,702 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 218 [2018-01-30 00:30:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:30:57,703 INFO L225 Difference]: With dead ends: 366 [2018-01-30 00:30:57,703 INFO L226 Difference]: Without dead ends: 233 [2018-01-30 00:30:57,704 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1088, Invalid=3468, Unknown=0, NotChecked=0, Total=4556 [2018-01-30 00:30:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-30 00:30:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2018-01-30 00:30:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-30 00:30:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 228 transitions. [2018-01-30 00:30:57,715 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 228 transitions. Word has length 218 [2018-01-30 00:30:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:30:57,715 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 228 transitions. [2018-01-30 00:30:57,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-30 00:30:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 228 transitions. [2018-01-30 00:30:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-01-30 00:30:57,716 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:30:57,716 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:30:57,716 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:30:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash 445642029, now seen corresponding path program 30 times [2018-01-30 00:30:57,716 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:30:57,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:30:57,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:57,717 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:30:57,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:30:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:30:57,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:30:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 29 proven. 1140 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-01-30 00:30:58,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:30:58,533 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 00:30:58,537 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:30:58,543 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,544 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,545 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,547 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,549 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,550 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,552 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,554 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,556 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,559 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,562 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,565 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,569 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,572 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,577 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,582 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,603 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:30:58,606 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:30:58,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:30:58,669 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 6 treesize of output 5 [2018-01-30 00:30:58,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:30:58,691 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 00:30:58,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:30:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 30 proven. 1097 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-30 00:30:59,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:30:59,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 57 [2018-01-30 00:30:59,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-01-30 00:30:59,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-01-30 00:30:59,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=3045, Unknown=0, NotChecked=0, Total=3192 [2018-01-30 00:30:59,239 INFO L87 Difference]: Start difference. First operand 226 states and 228 transitions. Second operand 57 states. [2018-01-30 00:31:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:31:00,680 INFO L93 Difference]: Finished difference Result 251 states and 256 transitions. [2018-01-30 00:31:00,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-30 00:31:00,681 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 223 [2018-01-30 00:31:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:31:00,682 INFO L225 Difference]: With dead ends: 251 [2018-01-30 00:31:00,682 INFO L226 Difference]: Without dead ends: 241 [2018-01-30 00:31:00,682 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=270, Invalid=5280, Unknown=0, NotChecked=0, Total=5550 [2018-01-30 00:31:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-01-30 00:31:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 234. [2018-01-30 00:31:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-30 00:31:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2018-01-30 00:31:00,696 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 223 [2018-01-30 00:31:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:31:00,696 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2018-01-30 00:31:00,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-01-30 00:31:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2018-01-30 00:31:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-01-30 00:31:00,697 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:31:00,697 INFO L350 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:31:00,697 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:31:00,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1413928755, now seen corresponding path program 31 times [2018-01-30 00:31:00,698 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:31:00,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:31:00,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:31:00,698 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:31:00,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:31:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:31:00,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:31:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 560 proven. 632 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-01-30 00:31:03,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:31:03,011 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 00:31:03,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:31:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:31:03,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:31:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 560 proven. 632 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-01-30 00:31:03,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:31:03,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 54 [2018-01-30 00:31:03,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-30 00:31:03,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-30 00:31:03,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2018-01-30 00:31:03,607 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 54 states. [2018-01-30 00:31:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:31:04,042 INFO L93 Difference]: Finished difference Result 387 states and 392 transitions. [2018-01-30 00:31:04,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 00:31:04,042 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 231 [2018-01-30 00:31:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:31:04,043 INFO L225 Difference]: With dead ends: 387 [2018-01-30 00:31:04,043 INFO L226 Difference]: Without dead ends: 246 [2018-01-30 00:31:04,043 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1215, Invalid=3897, Unknown=0, NotChecked=0, Total=5112 [2018-01-30 00:31:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-30 00:31:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 239. [2018-01-30 00:31:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-30 00:31:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 241 transitions. [2018-01-30 00:31:04,056 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 241 transitions. Word has length 231 [2018-01-30 00:31:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:31:04,056 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 241 transitions. [2018-01-30 00:31:04,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-30 00:31:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 241 transitions. [2018-01-30 00:31:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-01-30 00:31:04,056 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:31:04,057 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:31:04,057 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:31:04,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1647144168, now seen corresponding path program 32 times [2018-01-30 00:31:04,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:31:04,057 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:31:04,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:31:04,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:31:04,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:31:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:31:04,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:31:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 31 proven. 1288 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-01-30 00:31:08,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:31:08,352 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 00:31:08,356 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:31:08,362 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:31:08,376 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:31:08,384 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:31:08,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:31:09,332 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 6 treesize of output 5 [2018-01-30 00:31:09,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:31:09,335 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 00:31:09,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 00:31:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 32 proven. 1242 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-01-30 00:31:10,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:31:10,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 56] total 92 [2018-01-30 00:31:10,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-01-30 00:31:10,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-01-30 00:31:10,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=8120, Unknown=0, NotChecked=0, Total=8372 [2018-01-30 00:31:10,084 INFO L87 Difference]: Start difference. First operand 239 states and 241 transitions. Second operand 92 states. [2018-01-30 00:31:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:31:12,542 INFO L93 Difference]: Finished difference Result 264 states and 269 transitions. [2018-01-30 00:31:12,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-01-30 00:31:12,543 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 236 [2018-01-30 00:31:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:31:12,544 INFO L225 Difference]: With dead ends: 264 [2018-01-30 00:31:12,544 INFO L226 Difference]: Without dead ends: 254 [2018-01-30 00:31:12,544 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3728 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=464, Invalid=15538, Unknown=0, NotChecked=0, Total=16002 [2018-01-30 00:31:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-30 00:31:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 247. [2018-01-30 00:31:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-30 00:31:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 249 transitions. [2018-01-30 00:31:12,562 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 249 transitions. Word has length 236 [2018-01-30 00:31:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:31:12,562 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 249 transitions. [2018-01-30 00:31:12,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-01-30 00:31:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 249 transitions. [2018-01-30 00:31:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-01-30 00:31:12,563 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:31:12,563 INFO L350 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:31:12,563 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:31:12,563 INFO L82 PathProgramCache]: Analyzing trace with hash 602715528, now seen corresponding path program 33 times [2018-01-30 00:31:12,563 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:31:12,563 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:31:12,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:31:12,563 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:31:12,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:31:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:31:12,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:31:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 629 proven. 714 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-01-30 00:31:13,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:31:13,635 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 00:31:13,640 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:31:13,645 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,647 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,649 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,650 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,652 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,654 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,657 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,659 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,663 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,667 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,672 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,676 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,683 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,692 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,698 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,707 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,717 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,727 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:31:13,728 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:31:13,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:31:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 629 proven. 714 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-01-30 00:31:14,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:31:14,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 57 [2018-01-30 00:31:14,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-01-30 00:31:14,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-01-30 00:31:14,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=2433, Unknown=0, NotChecked=0, Total=3192 [2018-01-30 00:31:14,216 INFO L87 Difference]: Start difference. First operand 247 states and 249 transitions. Second operand 57 states. [2018-01-30 00:31:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:31:14,721 INFO L93 Difference]: Finished difference Result 408 states and 413 transitions. [2018-01-30 00:31:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-30 00:31:14,721 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 244 [2018-01-30 00:31:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:31:14,722 INFO L225 Difference]: With dead ends: 408 [2018-01-30 00:31:14,722 INFO L226 Difference]: Without dead ends: 259 [2018-01-30 00:31:14,722 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1349, Invalid=4351, Unknown=0, NotChecked=0, Total=5700 [2018-01-30 00:31:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-30 00:31:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 252. [2018-01-30 00:31:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-30 00:31:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 254 transitions. [2018-01-30 00:31:14,736 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 254 transitions. Word has length 244 [2018-01-30 00:31:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:31:14,737 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 254 transitions. [2018-01-30 00:31:14,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-01-30 00:31:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 254 transitions. [2018-01-30 00:31:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-01-30 00:31:14,737 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:31:14,737 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:31:14,738 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:31:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1173042509, now seen corresponding path program 34 times [2018-01-30 00:31:14,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:31:14,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:31:14,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:31:14,738 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:31:14,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:31:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:31:14,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:31:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 33 proven. 1445 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-01-30 00:31:15,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:31:15,755 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 00:31:15,760 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:31:15,787 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:31:15,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-01-30 00:31:16,237 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 00:31:16,237 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:31:16,240 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:31:16,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:31:16 BoogieIcfgContainer [2018-01-30 00:31:16,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:31:16,241 INFO L168 Benchmark]: Toolchain (without parser) took 64143.79 ms. Allocated memory was 151.0 MB in the beginning and 643.3 MB in the end (delta: 492.3 MB). Free memory was 115.9 MB in the beginning and 168.0 MB in the end (delta: -52.1 MB). Peak memory consumption was 440.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:31:16,241 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:31:16,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 112.65 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 108.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:31:16,242 INFO L168 Benchmark]: Boogie Preprocessor took 19.80 ms. Allocated memory is still 151.0 MB. Free memory was 108.0 MB in the beginning and 106.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:31:16,242 INFO L168 Benchmark]: RCFGBuilder took 317.15 ms. Allocated memory is still 151.0 MB. Free memory was 106.3 MB in the beginning and 94.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:31:16,242 INFO L168 Benchmark]: TraceAbstraction took 63691.76 ms. Allocated memory was 151.0 MB in the beginning and 643.3 MB in the end (delta: 492.3 MB). Free memory was 94.2 MB in the beginning and 168.0 MB in the end (delta: -73.8 MB). Peak memory consumption was 418.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:31:16,243 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 112.65 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 108.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.80 ms. Allocated memory is still 151.0 MB. Free memory was 108.0 MB in the beginning and 106.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 317.15 ms. Allocated memory is still 151.0 MB. Free memory was 106.3 MB in the beginning and 94.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63691.76 ms. Allocated memory was 151.0 MB in the beginning and 643.3 MB in the end (delta: 492.3 MB). Free memory was 94.2 MB in the beginning and 168.0 MB in the end (delta: -73.8 MB). Peak memory consumption was 418.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 250 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. TIMEOUT Result, 63.6s OverallTime, 37 OverallIterations, 19 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1958 SDtfs, 2371 SDslu, 36083 SDs, 0 SdLazy, 51130 SolverSat, 1862 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5908 GetRequests, 4126 SyntacticMatches, 34 SemanticMatches, 1748 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25288 ImplicationChecksByTransitivity, 36.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 237 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 34.6s InterpolantComputationTime, 9293 NumberOfCodeBlocks, 9288 NumberOfCodeBlocksAsserted, 228 NumberOfCheckSat, 9223 ConstructedInterpolants, 0 QuantifiedInterpolants, 6589643 SizeOfPredicates, 112 NumberOfNonLiveVariables, 7385 ConjunctsInSsa, 1305 ConjunctsInUnsatCore, 70 InterpolantComputations, 2 PerfectInterpolantSequences, 20194/44370 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/array_shadowinit_true-unreach-call_true-termination.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-31-16-247.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_shadowinit_true-unreach-call_true-termination.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-31-16-247.csv Completed graceful shutdown