java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-programs/copysome2_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 05:12:03,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 05:12:03,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 05:12:03,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 05:12:03,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 05:12:03,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 05:12:03,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 05:12:03,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 05:12:03,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 05:12:03,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 05:12:03,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 05:12:03,333 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 05:12:03,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 05:12:03,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 05:12:03,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 05:12:03,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 05:12:03,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 05:12:03,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 05:12:03,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 05:12:03,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 05:12:03,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 05:12:03,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 05:12:03,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 05:12:03,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 05:12:03,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 05:12:03,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 05:12:03,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 05:12:03,343 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 05:12:03,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 05:12:03,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 05:12:03,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 05:12:03,344 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 05:12:03,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 05:12:03,349 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 05:12:03,350 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 05:12:03,350 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 05:12:03,350 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 05:12:03,350 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 05:12:03,350 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 05:12:03,350 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 05:12:03,351 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 05:12:03,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 05:12:03,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 05:12:03,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 05:12:03,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 05:12:03,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 05:12:03,351 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 05:12:03,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 05:12:03,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 05:12:03,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 05:12:03,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 05:12:03,352 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 05:12:03,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 05:12:03,352 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 05:12:03,352 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 05:12:03,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:12:03,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 05:12:03,352 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 05:12:03,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 05:12:03,353 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 05:12:03,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 05:12:03,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 05:12:03,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 05:12:03,353 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 05:12:03,353 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 05:12:03,353 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 05:12:03,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 05:12:03,378 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 05:12:03,380 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 05:12:03,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 05:12:03,381 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 05:12:03,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/copysome2_false-unreach-call.i [2018-01-30 05:12:03,444 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 05:12:03,444 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 05:12:03,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 05:12:03,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 05:12:03,449 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 05:12:03,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1110d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03, skipping insertion in model container [2018-01-30 05:12:03,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,460 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:12:03,469 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:12:03,553 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:12:03,564 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:12:03,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03 WrapperNode [2018-01-30 05:12:03,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 05:12:03,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 05:12:03,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 05:12:03,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 05:12:03,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 05:12:03,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 05:12:03,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 05:12:03,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 05:12:03,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:12:03,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 05:12:03,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 05:12:03,627 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 05:12:03,627 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 05:12:03,627 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 05:12:03,628 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 05:12:03,628 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 05:12:03,628 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 05:12:03,628 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 05:12:03,628 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 05:12:03,956 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 05:12:03,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:12:03 BoogieIcfgContainer [2018-01-30 05:12:03,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 05:12:03,956 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 05:12:03,956 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 05:12:03,957 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 05:12:03,959 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:12:03" (1/1) ... [2018-01-30 05:12:03,961 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 05:12:03,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:12:03 BasicIcfg [2018-01-30 05:12:03,968 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 05:12:03,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 05:12:03,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 05:12:03,970 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 05:12:03,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 05:12:03" (1/4) ... [2018-01-30 05:12:03,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e617c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:12:03, skipping insertion in model container [2018-01-30 05:12:03,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:12:03" (2/4) ... [2018-01-30 05:12:03,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e617c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:12:03, skipping insertion in model container [2018-01-30 05:12:03,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:12:03" (3/4) ... [2018-01-30 05:12:03,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e617c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:12:03, skipping insertion in model container [2018-01-30 05:12:03,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:12:03" (4/4) ... [2018-01-30 05:12:03,972 INFO L107 eAbstractionObserver]: Analyzing ICFG copysome2_false-unreach-call.ileft_unchanged_by_heapseparator [2018-01-30 05:12:03,977 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 05:12:03,982 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 05:12:04,005 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 05:12:04,005 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 05:12:04,005 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 05:12:04,005 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 05:12:04,005 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 05:12:04,005 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 05:12:04,005 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 05:12:04,006 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 05:12:04,006 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 05:12:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-30 05:12:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 05:12:04,018 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:04,019 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:04,019 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1593372224, now seen corresponding path program 1 times [2018-01-30 05:12:04,022 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:04,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:04,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:04,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:04,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:04,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:12:04,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:12:04,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 05:12:04,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 05:12:04,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 05:12:04,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 05:12:04,098 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-01-30 05:12:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:04,112 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-01-30 05:12:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 05:12:04,113 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-30 05:12:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:04,118 INFO L225 Difference]: With dead ends: 97 [2018-01-30 05:12:04,118 INFO L226 Difference]: Without dead ends: 56 [2018-01-30 05:12:04,120 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 05:12:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-30 05:12:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-30 05:12:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-30 05:12:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-01-30 05:12:04,150 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 24 [2018-01-30 05:12:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:04,151 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-01-30 05:12:04,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 05:12:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-01-30 05:12:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 05:12:04,151 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:04,152 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:04,152 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash -58111803, now seen corresponding path program 1 times [2018-01-30 05:12:04,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:04,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:04,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:04,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:04,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:04,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:12:04,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:12:04,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:12:04,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:12:04,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:12:04,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:12:04,273 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 3 states. [2018-01-30 05:12:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:04,472 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-01-30 05:12:04,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:12:04,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-30 05:12:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:04,473 INFO L225 Difference]: With dead ends: 113 [2018-01-30 05:12:04,473 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 05:12:04,473 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:12:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 05:12:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2018-01-30 05:12:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 05:12:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-30 05:12:04,478 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 27 [2018-01-30 05:12:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:04,478 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-30 05:12:04,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:12:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-30 05:12:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 05:12:04,479 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:04,479 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:04,479 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:04,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1271294242, now seen corresponding path program 1 times [2018-01-30 05:12:04,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:04,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:04,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:04,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:04,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:04,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:12:04,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:12:04,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:12:04,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:12:04,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:12:04,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:12:04,574 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-30 05:12:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:04,782 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-30 05:12:04,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 05:12:04,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-01-30 05:12:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:04,783 INFO L225 Difference]: With dead ends: 113 [2018-01-30 05:12:04,784 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 05:12:04,784 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:12:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 05:12:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2018-01-30 05:12:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 05:12:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-01-30 05:12:04,791 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 54 [2018-01-30 05:12:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:04,793 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-01-30 05:12:04,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:12:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-01-30 05:12:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 05:12:04,794 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:04,794 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:04,794 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:04,794 INFO L82 PathProgramCache]: Analyzing trace with hash -779202658, now seen corresponding path program 1 times [2018-01-30 05:12:04,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:04,795 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:04,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:04,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:04,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:04,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:12:04,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:04,867 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:04,876 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:04,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:12:04,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:04,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 05:12:04,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:12:04,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:12:04,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:12:04,935 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 5 states. [2018-01-30 05:12:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:05,114 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2018-01-30 05:12:05,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:12:05,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-01-30 05:12:05,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:05,117 INFO L225 Difference]: With dead ends: 132 [2018-01-30 05:12:05,117 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 05:12:05,117 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:12:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 05:12:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2018-01-30 05:12:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 05:12:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-01-30 05:12:05,123 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 55 [2018-01-30 05:12:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:05,123 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-01-30 05:12:05,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:12:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-01-30 05:12:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 05:12:05,124 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:05,124 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:05,124 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:05,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1220485988, now seen corresponding path program 2 times [2018-01-30 05:12:05,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:05,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:05,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:05,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:05,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:05,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 05:12:05,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:05,212 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:05,228 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:12:05,235 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:05,251 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:05,261 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:05,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:12:05,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:05,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-01-30 05:12:05,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 05:12:05,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 05:12:05,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:12:05,470 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 8 states. [2018-01-30 05:12:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:05,678 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2018-01-30 05:12:05,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:12:05,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-01-30 05:12:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:05,679 INFO L225 Difference]: With dead ends: 153 [2018-01-30 05:12:05,679 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 05:12:05,679 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-30 05:12:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 05:12:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2018-01-30 05:12:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-30 05:12:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-30 05:12:05,684 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 69 [2018-01-30 05:12:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:05,684 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-30 05:12:05,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 05:12:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-30 05:12:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-30 05:12:05,685 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:05,685 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:05,685 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:05,686 INFO L82 PathProgramCache]: Analyzing trace with hash -117616120, now seen corresponding path program 1 times [2018-01-30 05:12:05,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:05,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:05,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:05,686 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:05,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:05,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 05:12:05,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:05,759 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:05,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:05,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 05:12:05,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:05,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-30 05:12:05,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 05:12:05,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 05:12:05,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:12:05,891 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 13 states. [2018-01-30 05:12:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:06,201 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-01-30 05:12:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 05:12:06,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2018-01-30 05:12:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:06,202 INFO L225 Difference]: With dead ends: 180 [2018-01-30 05:12:06,202 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 05:12:06,203 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-01-30 05:12:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 05:12:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-01-30 05:12:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 05:12:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-01-30 05:12:06,208 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 89 [2018-01-30 05:12:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:06,208 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-01-30 05:12:06,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 05:12:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-01-30 05:12:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-30 05:12:06,209 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:06,209 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:06,209 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash -506436166, now seen corresponding path program 3 times [2018-01-30 05:12:06,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:06,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:06,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:06,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:06,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:06,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 05:12:06,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:06,288 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:06,292 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:12:06,298 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:06,307 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:06,308 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:06,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 05:12:06,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:06,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 05:12:06,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:12:06,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:12:06,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:12:06,333 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 5 states. [2018-01-30 05:12:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:06,378 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-01-30 05:12:06,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:12:06,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-01-30 05:12:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:06,379 INFO L225 Difference]: With dead ends: 139 [2018-01-30 05:12:06,379 INFO L226 Difference]: Without dead ends: 125 [2018-01-30 05:12:06,379 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:12:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-30 05:12:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 118. [2018-01-30 05:12:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-30 05:12:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-30 05:12:06,384 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 104 [2018-01-30 05:12:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:06,384 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-30 05:12:06,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:12:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-30 05:12:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 05:12:06,385 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:06,385 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:06,385 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:06,385 INFO L82 PathProgramCache]: Analyzing trace with hash 736660701, now seen corresponding path program 4 times [2018-01-30 05:12:06,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:06,386 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:06,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:06,386 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:06,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:06,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 05:12:06,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:06,768 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:06,776 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:12:06,786 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:06,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:06,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:12:06,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:06,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:06,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-30 05:12:06,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 05:12:06,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:06,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:12:06,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:15 [2018-01-30 05:12:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-30 05:12:06,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:06,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-01-30 05:12:06,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 05:12:06,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 05:12:06,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:12:06,992 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 13 states. [2018-01-30 05:12:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:07,198 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-01-30 05:12:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 05:12:07,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 111 [2018-01-30 05:12:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:07,200 INFO L225 Difference]: With dead ends: 198 [2018-01-30 05:12:07,200 INFO L226 Difference]: Without dead ends: 166 [2018-01-30 05:12:07,201 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-01-30 05:12:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-30 05:12:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2018-01-30 05:12:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-30 05:12:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-01-30 05:12:07,207 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 111 [2018-01-30 05:12:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:07,208 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-01-30 05:12:07,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 05:12:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-01-30 05:12:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-30 05:12:07,208 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:07,209 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:07,209 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:07,209 INFO L82 PathProgramCache]: Analyzing trace with hash 156429995, now seen corresponding path program 1 times [2018-01-30 05:12:07,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:07,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:07,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:07,209 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:07,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:07,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-01-30 05:12:07,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:07,288 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:07,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:07,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-30 05:12:07,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:07,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2018-01-30 05:12:07,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 05:12:07,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 05:12:07,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-30 05:12:07,543 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 15 states. [2018-01-30 05:12:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:07,851 INFO L93 Difference]: Finished difference Result 240 states and 258 transitions. [2018-01-30 05:12:07,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 05:12:07,851 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2018-01-30 05:12:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:07,853 INFO L225 Difference]: With dead ends: 240 [2018-01-30 05:12:07,853 INFO L226 Difference]: Without dead ends: 168 [2018-01-30 05:12:07,854 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2018-01-30 05:12:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-30 05:12:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2018-01-30 05:12:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-30 05:12:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2018-01-30 05:12:07,859 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 117 [2018-01-30 05:12:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:07,860 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2018-01-30 05:12:07,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 05:12:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2018-01-30 05:12:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-30 05:12:07,861 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:07,861 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:07,861 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:07,861 INFO L82 PathProgramCache]: Analyzing trace with hash 576001313, now seen corresponding path program 1 times [2018-01-30 05:12:07,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:07,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:07,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:07,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:07,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:07,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-01-30 05:12:07,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:07,966 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:07,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:07,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-01-30 05:12:08,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:08,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2018-01-30 05:12:08,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 05:12:08,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 05:12:08,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-01-30 05:12:08,383 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 17 states. [2018-01-30 05:12:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:08,690 INFO L93 Difference]: Finished difference Result 256 states and 273 transitions. [2018-01-30 05:12:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 05:12:08,690 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 132 [2018-01-30 05:12:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:08,691 INFO L225 Difference]: With dead ends: 256 [2018-01-30 05:12:08,691 INFO L226 Difference]: Without dead ends: 184 [2018-01-30 05:12:08,691 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=328, Invalid=932, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 05:12:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-30 05:12:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-01-30 05:12:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-30 05:12:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 178 transitions. [2018-01-30 05:12:08,695 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 178 transitions. Word has length 132 [2018-01-30 05:12:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:08,695 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 178 transitions. [2018-01-30 05:12:08,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 05:12:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 178 transitions. [2018-01-30 05:12:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-30 05:12:08,696 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:08,696 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 05:12:08,696 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1041383084, now seen corresponding path program 2 times [2018-01-30 05:12:08,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:08,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:08,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:08,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:08,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:08,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-30 05:12:08,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:08,778 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:08,782 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:12:08,788 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:08,797 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:08,798 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:08,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-01-30 05:12:08,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:08,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15] total 19 [2018-01-30 05:12:08,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 05:12:08,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 05:12:08,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-01-30 05:12:08,907 INFO L87 Difference]: Start difference. First operand 170 states and 178 transitions. Second operand 19 states. [2018-01-30 05:12:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:09,243 INFO L93 Difference]: Finished difference Result 282 states and 300 transitions. [2018-01-30 05:12:09,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 05:12:09,243 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 153 [2018-01-30 05:12:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:09,244 INFO L225 Difference]: With dead ends: 282 [2018-01-30 05:12:09,244 INFO L226 Difference]: Without dead ends: 209 [2018-01-30 05:12:09,245 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=521, Invalid=1285, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 05:12:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-30 05:12:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2018-01-30 05:12:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-30 05:12:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 197 transitions. [2018-01-30 05:12:09,248 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 197 transitions. Word has length 153 [2018-01-30 05:12:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:09,249 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 197 transitions. [2018-01-30 05:12:09,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 05:12:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2018-01-30 05:12:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-01-30 05:12:09,250 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:09,250 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:09,250 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -500601686, now seen corresponding path program 1 times [2018-01-30 05:12:09,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:09,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:09,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:09,251 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:09,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:09,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-30 05:12:09,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:09,348 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:09,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:09,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-01-30 05:12:09,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:09,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 19 [2018-01-30 05:12:09,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 05:12:09,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 05:12:09,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-01-30 05:12:09,572 INFO L87 Difference]: Start difference. First operand 189 states and 197 transitions. Second operand 19 states. [2018-01-30 05:12:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:09,895 INFO L93 Difference]: Finished difference Result 305 states and 323 transitions. [2018-01-30 05:12:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 05:12:09,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 170 [2018-01-30 05:12:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:09,901 INFO L225 Difference]: With dead ends: 305 [2018-01-30 05:12:09,901 INFO L226 Difference]: Without dead ends: 227 [2018-01-30 05:12:09,901 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=371, Invalid=961, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 05:12:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-30 05:12:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 209. [2018-01-30 05:12:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-30 05:12:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 217 transitions. [2018-01-30 05:12:09,906 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 217 transitions. Word has length 170 [2018-01-30 05:12:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:09,906 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 217 transitions. [2018-01-30 05:12:09,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 05:12:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 217 transitions. [2018-01-30 05:12:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-01-30 05:12:09,908 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:09,908 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:09,908 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:09,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1272084985, now seen corresponding path program 3 times [2018-01-30 05:12:09,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:09,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:09,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:09,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:09,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:09,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-01-30 05:12:10,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:10,061 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:10,065 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:12:10,082 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:10,090 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:10,101 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:10,102 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:10,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2018-01-30 05:12:10,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:10,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-30 05:12:10,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 05:12:10,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 05:12:10,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-30 05:12:10,171 INFO L87 Difference]: Start difference. First operand 209 states and 217 transitions. Second operand 14 states. [2018-01-30 05:12:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:10,441 INFO L93 Difference]: Finished difference Result 276 states and 295 transitions. [2018-01-30 05:12:10,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 05:12:10,442 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-01-30 05:12:10,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:10,443 INFO L225 Difference]: With dead ends: 276 [2018-01-30 05:12:10,443 INFO L226 Difference]: Without dead ends: 240 [2018-01-30 05:12:10,443 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=600, Unknown=0, NotChecked=0, Total=870 [2018-01-30 05:12:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-30 05:12:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 230. [2018-01-30 05:12:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-30 05:12:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 240 transitions. [2018-01-30 05:12:10,454 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 240 transitions. Word has length 188 [2018-01-30 05:12:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:10,455 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 240 transitions. [2018-01-30 05:12:10,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 05:12:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 240 transitions. [2018-01-30 05:12:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-01-30 05:12:10,456 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:10,456 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:10,456 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:10,456 INFO L82 PathProgramCache]: Analyzing trace with hash -144920153, now seen corresponding path program 4 times [2018-01-30 05:12:10,456 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:10,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:10,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:10,457 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:10,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:10,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2018-01-30 05:12:10,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:10,799 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:10,805 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:12:10,834 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:10,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:10,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:12:10,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:10,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:10,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-30 05:12:10,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:10,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:12:10,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:10,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:10,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-01-30 05:12:11,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 05:12:11,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:11,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:11,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-01-30 05:12:11,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 05:12:11,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:12:11,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2018-01-30 05:12:11,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:11,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:11,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-01-30 05:12:11,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 05:12:11,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:11,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:11,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 05:12:11,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:11,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 64 [2018-01-30 05:12:11,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:11,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 05:12:11,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:44 [2018-01-30 05:12:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-01-30 05:12:11,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:11,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 27] total 35 [2018-01-30 05:12:11,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-30 05:12:11,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-30 05:12:11,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 05:12:11,758 INFO L87 Difference]: Start difference. First operand 230 states and 240 transitions. Second operand 35 states. [2018-01-30 05:12:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:18,062 INFO L93 Difference]: Finished difference Result 381 states and 409 transitions. [2018-01-30 05:12:18,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 05:12:18,062 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 202 [2018-01-30 05:12:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:18,063 INFO L225 Difference]: With dead ends: 381 [2018-01-30 05:12:18,063 INFO L226 Difference]: Without dead ends: 288 [2018-01-30 05:12:18,064 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=446, Invalid=3976, Unknown=0, NotChecked=0, Total=4422 [2018-01-30 05:12:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-30 05:12:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 221. [2018-01-30 05:12:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-30 05:12:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 228 transitions. [2018-01-30 05:12:18,069 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 228 transitions. Word has length 202 [2018-01-30 05:12:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:18,069 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 228 transitions. [2018-01-30 05:12:18,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-30 05:12:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 228 transitions. [2018-01-30 05:12:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-01-30 05:12:18,070 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:18,070 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:18,071 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2019534261, now seen corresponding path program 2 times [2018-01-30 05:12:18,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:18,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:18,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:18,071 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:18,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:18,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 2 proven. 80 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-01-30 05:12:18,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:18,213 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:18,217 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:12:18,224 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:18,234 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:18,236 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:18,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-01-30 05:12:18,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:18,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 24 [2018-01-30 05:12:18,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 05:12:18,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 05:12:18,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-01-30 05:12:18,343 INFO L87 Difference]: Start difference. First operand 221 states and 228 transitions. Second operand 24 states. [2018-01-30 05:12:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:18,807 INFO L93 Difference]: Finished difference Result 372 states and 390 transitions. [2018-01-30 05:12:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-30 05:12:18,810 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 205 [2018-01-30 05:12:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:18,810 INFO L225 Difference]: With dead ends: 372 [2018-01-30 05:12:18,810 INFO L226 Difference]: Without dead ends: 276 [2018-01-30 05:12:18,811 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2018-01-30 05:12:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-01-30 05:12:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 236. [2018-01-30 05:12:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-01-30 05:12:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 243 transitions. [2018-01-30 05:12:18,816 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 243 transitions. Word has length 205 [2018-01-30 05:12:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:18,816 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 243 transitions. [2018-01-30 05:12:18,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 05:12:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 243 transitions. [2018-01-30 05:12:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-01-30 05:12:18,817 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:18,817 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:18,817 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash -910094738, now seen corresponding path program 3 times [2018-01-30 05:12:18,817 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:18,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:18,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:18,818 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:18,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:18,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2018-01-30 05:12:19,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:19,229 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:19,234 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:12:19,240 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:19,243 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:19,246 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:19,249 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:19,250 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:19,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2018-01-30 05:12:19,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:19,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-30 05:12:19,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:12:19,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:12:19,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:12:19,291 INFO L87 Difference]: Start difference. First operand 236 states and 243 transitions. Second operand 9 states. [2018-01-30 05:12:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:19,446 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2018-01-30 05:12:19,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 05:12:19,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 226 [2018-01-30 05:12:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:19,448 INFO L225 Difference]: With dead ends: 315 [2018-01-30 05:12:19,448 INFO L226 Difference]: Without dead ends: 248 [2018-01-30 05:12:19,448 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-30 05:12:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-30 05:12:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2018-01-30 05:12:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-30 05:12:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 244 transitions. [2018-01-30 05:12:19,453 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 244 transitions. Word has length 226 [2018-01-30 05:12:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:19,454 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 244 transitions. [2018-01-30 05:12:19,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:12:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 244 transitions. [2018-01-30 05:12:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-01-30 05:12:19,454 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:19,454 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:19,454 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2090533304, now seen corresponding path program 4 times [2018-01-30 05:12:19,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:19,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:19,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:19,455 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:19,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:19,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2018-01-30 05:12:19,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:19,592 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:19,596 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:12:19,619 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:19,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:19,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:12:19,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:19,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:19,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 05:12:19,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:12:19,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:19,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:19,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 05:12:19,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 05:12:19,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:19,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:19,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 05:12:19,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 05:12:19,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:19,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:19,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 05:12:19,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:19,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 64 [2018-01-30 05:12:19,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:19,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 05:12:19,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:44 [2018-01-30 05:12:20,476 WARN L143 SmtUtils]: Spent 405ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-30 05:12:20,862 WARN L143 SmtUtils]: Spent 246ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 05:12:21,405 WARN L143 SmtUtils]: Spent 516ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 05:12:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 7 proven. 162 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-01-30 05:12:21,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:21,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30] total 39 [2018-01-30 05:12:21,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 05:12:21,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 05:12:21,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 05:12:21,525 INFO L87 Difference]: Start difference. First operand 237 states and 244 transitions. Second operand 39 states. [2018-01-30 05:12:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:27,837 INFO L93 Difference]: Finished difference Result 359 states and 377 transitions. [2018-01-30 05:12:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-30 05:12:27,838 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 233 [2018-01-30 05:12:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:27,838 INFO L225 Difference]: With dead ends: 359 [2018-01-30 05:12:27,839 INFO L226 Difference]: Without dead ends: 292 [2018-01-30 05:12:27,839 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=389, Invalid=4167, Unknown=0, NotChecked=0, Total=4556 [2018-01-30 05:12:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-01-30 05:12:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 254. [2018-01-30 05:12:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-01-30 05:12:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 262 transitions. [2018-01-30 05:12:27,846 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 262 transitions. Word has length 233 [2018-01-30 05:12:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:27,846 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 262 transitions. [2018-01-30 05:12:27,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 05:12:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 262 transitions. [2018-01-30 05:12:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-01-30 05:12:27,847 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:27,847 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:27,847 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1685401909, now seen corresponding path program 1 times [2018-01-30 05:12:27,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:27,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:27,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:27,848 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:27,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:27,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2018-01-30 05:12:27,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:27,952 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:27,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:27,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 522 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-01-30 05:12:28,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:28,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21] total 27 [2018-01-30 05:12:28,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 05:12:28,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 05:12:28,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2018-01-30 05:12:28,131 INFO L87 Difference]: Start difference. First operand 254 states and 262 transitions. Second operand 27 states. [2018-01-30 05:12:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:28,660 INFO L93 Difference]: Finished difference Result 412 states and 431 transitions. [2018-01-30 05:12:28,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 05:12:28,660 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 249 [2018-01-30 05:12:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:28,661 INFO L225 Difference]: With dead ends: 412 [2018-01-30 05:12:28,661 INFO L226 Difference]: Without dead ends: 297 [2018-01-30 05:12:28,662 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1052, Invalid=2854, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 05:12:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-01-30 05:12:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 268. [2018-01-30 05:12:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-01-30 05:12:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 276 transitions. [2018-01-30 05:12:28,679 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 276 transitions. Word has length 249 [2018-01-30 05:12:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:28,679 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 276 transitions. [2018-01-30 05:12:28,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 05:12:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 276 transitions. [2018-01-30 05:12:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-01-30 05:12:28,680 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:28,680 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:28,680 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1543747989, now seen corresponding path program 5 times [2018-01-30 05:12:28,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:28,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:28,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:28,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:28,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:28,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2018-01-30 05:12:29,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:29,020 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:29,024 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:12:29,031 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,039 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,043 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,045 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,047 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,049 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,052 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,055 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,060 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,065 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,087 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:29,088 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:29,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-30 05:12:29,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:29,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 29 [2018-01-30 05:12:29,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 05:12:29,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 05:12:29,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2018-01-30 05:12:29,254 INFO L87 Difference]: Start difference. First operand 268 states and 276 transitions. Second operand 29 states. [2018-01-30 05:12:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:29,791 INFO L93 Difference]: Finished difference Result 457 states and 479 transitions. [2018-01-30 05:12:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-30 05:12:29,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 264 [2018-01-30 05:12:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:29,802 INFO L225 Difference]: With dead ends: 457 [2018-01-30 05:12:29,802 INFO L226 Difference]: Without dead ends: 342 [2018-01-30 05:12:29,803 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=858, Invalid=2802, Unknown=0, NotChecked=0, Total=3660 [2018-01-30 05:12:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-01-30 05:12:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 289. [2018-01-30 05:12:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-01-30 05:12:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 298 transitions. [2018-01-30 05:12:29,809 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 298 transitions. Word has length 264 [2018-01-30 05:12:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:29,809 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 298 transitions. [2018-01-30 05:12:29,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 05:12:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 298 transitions. [2018-01-30 05:12:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-01-30 05:12:29,810 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:29,810 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:29,810 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash 109068148, now seen corresponding path program 6 times [2018-01-30 05:12:29,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:29,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:29,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:29,811 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:29,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:29,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 4 proven. 161 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked. [2018-01-30 05:12:32,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:32,009 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) [2018-01-30 05:12:32,013 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:32,021 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,031 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,046 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,058 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,073 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,085 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,099 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,112 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,126 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,139 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,152 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:12:32,164 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:32,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-01-30 05:12:33,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:33,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 22 [2018-01-30 05:12:33,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 05:12:33,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 05:12:33,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-01-30 05:12:33,353 INFO L87 Difference]: Start difference. First operand 289 states and 298 transitions. Second operand 22 states. [2018-01-30 05:12:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:34,968 INFO L93 Difference]: Finished difference Result 469 states and 495 transitions. [2018-01-30 05:12:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 05:12:34,968 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 285 [2018-01-30 05:12:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:34,970 INFO L225 Difference]: With dead ends: 469 [2018-01-30 05:12:34,970 INFO L226 Difference]: Without dead ends: 385 [2018-01-30 05:12:34,970 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=488, Invalid=1582, Unknown=0, NotChecked=0, Total=2070 [2018-01-30 05:12:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-01-30 05:12:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 304. [2018-01-30 05:12:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-01-30 05:12:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 315 transitions. [2018-01-30 05:12:34,977 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 315 transitions. Word has length 285 [2018-01-30 05:12:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:34,977 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 315 transitions. [2018-01-30 05:12:34,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 05:12:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 315 transitions. [2018-01-30 05:12:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-01-30 05:12:34,978 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:34,978 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:34,978 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash 365572617, now seen corresponding path program 2 times [2018-01-30 05:12:34,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:34,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:34,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:34,979 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:34,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:34,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 69 proven. 30 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2018-01-30 05:12:35,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:35,471 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:35,479 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:12:35,490 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:35,515 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:35,527 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:35,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-01-30 05:12:35,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:35,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25] total 33 [2018-01-30 05:12:35,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 05:12:35,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 05:12:35,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 05:12:35,974 INFO L87 Difference]: Start difference. First operand 304 states and 315 transitions. Second operand 33 states. [2018-01-30 05:12:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:36,627 INFO L93 Difference]: Finished difference Result 468 states and 490 transitions. [2018-01-30 05:12:36,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-30 05:12:36,633 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 298 [2018-01-30 05:12:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:36,634 INFO L225 Difference]: With dead ends: 468 [2018-01-30 05:12:36,634 INFO L226 Difference]: Without dead ends: 331 [2018-01-30 05:12:36,635 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1254, Invalid=4446, Unknown=0, NotChecked=0, Total=5700 [2018-01-30 05:12:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-30 05:12:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 318. [2018-01-30 05:12:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-01-30 05:12:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 328 transitions. [2018-01-30 05:12:36,642 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 328 transitions. Word has length 298 [2018-01-30 05:12:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:36,642 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 328 transitions. [2018-01-30 05:12:36,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 05:12:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 328 transitions. [2018-01-30 05:12:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-01-30 05:12:36,643 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:36,643 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:36,643 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash 877462263, now seen corresponding path program 7 times [2018-01-30 05:12:36,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:36,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:36,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:36,644 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:36,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:36,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-01-30 05:12:37,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:37,138 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:37,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:37,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 0 proven. 948 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2018-01-30 05:12:38,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:38,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27] total 33 [2018-01-30 05:12:38,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 05:12:38,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 05:12:38,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=834, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 05:12:38,250 INFO L87 Difference]: Start difference. First operand 318 states and 328 transitions. Second operand 33 states. [2018-01-30 05:12:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:38,816 INFO L93 Difference]: Finished difference Result 526 states and 552 transitions. [2018-01-30 05:12:38,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-30 05:12:38,826 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 313 [2018-01-30 05:12:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:38,827 INFO L225 Difference]: With dead ends: 526 [2018-01-30 05:12:38,827 INFO L226 Difference]: Without dead ends: 389 [2018-01-30 05:12:38,828 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1122, Invalid=3570, Unknown=0, NotChecked=0, Total=4692 [2018-01-30 05:12:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-30 05:12:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 339. [2018-01-30 05:12:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-01-30 05:12:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 350 transitions. [2018-01-30 05:12:38,835 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 350 transitions. Word has length 313 [2018-01-30 05:12:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:38,835 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 350 transitions. [2018-01-30 05:12:38,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 05:12:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 350 transitions. [2018-01-30 05:12:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 05:12:38,836 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:38,837 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:38,837 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:38,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1270405561, now seen corresponding path program 3 times [2018-01-30 05:12:38,837 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:38,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:38,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:38,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:38,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:38,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 88 proven. 54 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked. [2018-01-30 05:12:39,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:39,044 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:39,049 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:12:39,061 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:39,064 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:39,067 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:39,070 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:39,074 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:39,075 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:39,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-01-30 05:12:39,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:39,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-01-30 05:12:39,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 05:12:39,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 05:12:39,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-01-30 05:12:39,408 INFO L87 Difference]: Start difference. First operand 339 states and 350 transitions. Second operand 20 states. [2018-01-30 05:12:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:39,931 INFO L93 Difference]: Finished difference Result 467 states and 490 transitions. [2018-01-30 05:12:39,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 05:12:39,931 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 333 [2018-01-30 05:12:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:39,933 INFO L225 Difference]: With dead ends: 467 [2018-01-30 05:12:39,933 INFO L226 Difference]: Without dead ends: 356 [2018-01-30 05:12:39,933 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=583, Invalid=1397, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 05:12:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-01-30 05:12:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 346. [2018-01-30 05:12:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-01-30 05:12:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 357 transitions. [2018-01-30 05:12:39,941 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 357 transitions. Word has length 333 [2018-01-30 05:12:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:39,941 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 357 transitions. [2018-01-30 05:12:39,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 05:12:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 357 transitions. [2018-01-30 05:12:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-01-30 05:12:39,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:39,942 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:39,942 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash -293005899, now seen corresponding path program 8 times [2018-01-30 05:12:39,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:39,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:39,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:39,943 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:39,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:39,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 4 proven. 1118 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-01-30 05:12:40,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:40,456 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:40,461 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:12:40,470 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:40,495 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:40,507 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:40,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 0 proven. 1118 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-01-30 05:12:40,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:40,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-01-30 05:12:40,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 05:12:40,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 05:12:40,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-01-30 05:12:40,582 INFO L87 Difference]: Start difference. First operand 346 states and 357 transitions. Second operand 29 states. [2018-01-30 05:12:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:41,049 INFO L93 Difference]: Finished difference Result 522 states and 544 transitions. [2018-01-30 05:12:41,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 05:12:41,049 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 341 [2018-01-30 05:12:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:41,050 INFO L225 Difference]: With dead ends: 522 [2018-01-30 05:12:41,050 INFO L226 Difference]: Without dead ends: 371 [2018-01-30 05:12:41,051 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 05:12:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-30 05:12:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 360. [2018-01-30 05:12:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-01-30 05:12:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 371 transitions. [2018-01-30 05:12:41,058 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 371 transitions. Word has length 341 [2018-01-30 05:12:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:41,059 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 371 transitions. [2018-01-30 05:12:41,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 05:12:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 371 transitions. [2018-01-30 05:12:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-01-30 05:12:41,060 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:41,060 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:41,060 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:41,060 INFO L82 PathProgramCache]: Analyzing trace with hash -878079437, now seen corresponding path program 9 times [2018-01-30 05:12:41,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:41,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:41,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:41,061 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:41,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:41,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1746 backedges. 4 proven. 212 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2018-01-30 05:12:41,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:41,438 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:41,442 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:12:41,453 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:41,455 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:41,459 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:41,463 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:41,467 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:41,472 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:41,476 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:41,481 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:41,487 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:12:41,488 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:41,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1746 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 1534 trivial. 0 not checked. [2018-01-30 05:12:41,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:41,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-01-30 05:12:41,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 05:12:41,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 05:12:41,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-01-30 05:12:41,637 INFO L87 Difference]: Start difference. First operand 360 states and 371 transitions. Second operand 27 states. [2018-01-30 05:12:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:42,008 INFO L93 Difference]: Finished difference Result 578 states and 611 transitions. [2018-01-30 05:12:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 05:12:42,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 355 [2018-01-30 05:12:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:42,009 INFO L225 Difference]: With dead ends: 578 [2018-01-30 05:12:42,009 INFO L226 Difference]: Without dead ends: 486 [2018-01-30 05:12:42,010 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=751, Invalid=2671, Unknown=0, NotChecked=0, Total=3422 [2018-01-30 05:12:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-01-30 05:12:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 375. [2018-01-30 05:12:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-01-30 05:12:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 388 transitions. [2018-01-30 05:12:42,035 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 388 transitions. Word has length 355 [2018-01-30 05:12:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:42,035 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 388 transitions. [2018-01-30 05:12:42,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 05:12:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 388 transitions. [2018-01-30 05:12:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-01-30 05:12:42,036 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:42,036 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:42,036 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 102786666, now seen corresponding path program 4 times [2018-01-30 05:12:42,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:42,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:42,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:42,037 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:42,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:42,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1854 backedges. 4 proven. 177 refuted. 0 times theorem prover too weak. 1673 trivial. 0 not checked. [2018-01-30 05:12:42,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:42,435 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:42,439 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:12:42,472 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:42,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1854 backedges. 146 proven. 311 refuted. 0 times theorem prover too weak. 1397 trivial. 0 not checked. [2018-01-30 05:12:42,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:42,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25] total 35 [2018-01-30 05:12:42,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-30 05:12:42,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-30 05:12:42,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 05:12:42,814 INFO L87 Difference]: Start difference. First operand 375 states and 388 transitions. Second operand 35 states. [2018-01-30 05:12:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:43,641 INFO L93 Difference]: Finished difference Result 617 states and 656 transitions. [2018-01-30 05:12:43,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-30 05:12:43,642 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 368 [2018-01-30 05:12:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:43,643 INFO L225 Difference]: With dead ends: 617 [2018-01-30 05:12:43,643 INFO L226 Difference]: Without dead ends: 517 [2018-01-30 05:12:43,645 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2439 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1257, Invalid=6225, Unknown=0, NotChecked=0, Total=7482 [2018-01-30 05:12:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-01-30 05:12:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 454. [2018-01-30 05:12:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-01-30 05:12:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 473 transitions. [2018-01-30 05:12:43,657 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 473 transitions. Word has length 368 [2018-01-30 05:12:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:43,657 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 473 transitions. [2018-01-30 05:12:43,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-30 05:12:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 473 transitions. [2018-01-30 05:12:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-01-30 05:12:43,661 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:43,661 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:43,661 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1237522532, now seen corresponding path program 1 times [2018-01-30 05:12:43,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:43,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:43,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:43,662 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:43,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:43,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 4 proven. 241 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2018-01-30 05:12:43,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:43,947 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:43,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:43,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-01-30 05:12:44,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:44,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 31] total 43 [2018-01-30 05:12:44,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 05:12:44,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 05:12:44,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 05:12:44,387 INFO L87 Difference]: Start difference. First operand 454 states and 473 transitions. Second operand 43 states. [2018-01-30 05:12:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:45,241 INFO L93 Difference]: Finished difference Result 778 states and 825 transitions. [2018-01-30 05:12:45,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-30 05:12:45,241 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 375 [2018-01-30 05:12:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:45,242 INFO L225 Difference]: With dead ends: 778 [2018-01-30 05:12:45,243 INFO L226 Difference]: Without dead ends: 533 [2018-01-30 05:12:45,244 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2806 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2589, Invalid=7917, Unknown=0, NotChecked=0, Total=10506 [2018-01-30 05:12:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-01-30 05:12:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 481. [2018-01-30 05:12:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-01-30 05:12:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 502 transitions. [2018-01-30 05:12:45,254 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 502 transitions. Word has length 375 [2018-01-30 05:12:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:45,254 INFO L432 AbstractCegarLoop]: Abstraction has 481 states and 502 transitions. [2018-01-30 05:12:45,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 05:12:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 502 transitions. [2018-01-30 05:12:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-01-30 05:12:45,256 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:45,256 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:45,256 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:45,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1767786470, now seen corresponding path program 10 times [2018-01-30 05:12:45,256 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:45,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:45,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:45,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:45,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:45,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 4 proven. 270 refuted. 0 times theorem prover too weak. 1851 trivial. 0 not checked. [2018-01-30 05:12:45,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:45,872 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:45,878 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:12:45,915 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:45,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:46,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:12:46,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:46,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:46,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 05:12:46,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:46,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:12:46,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:46,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:46,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 05:12:46,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:46,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:46,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 05:12:46,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:46,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:46,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 05:12:46,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:46,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:46,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:46,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 05:12:46,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:46,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:46,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 05:12:47,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:47,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:47,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:47,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:47,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-30 05:12:47,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:47,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:47,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 05:12:47,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:47,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:47,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:47,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:47,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:12:47,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 63 [2018-01-30 05:12:47,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:47,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:47,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 05:12:47,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-01-30 05:12:47,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:12:47,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:12:47,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:50 [2018-01-30 05:12:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 3 proven. 2057 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-01-30 05:12:47,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:47,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 65] total 84 [2018-01-30 05:12:47,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-01-30 05:12:47,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-01-30 05:12:47,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=6542, Unknown=0, NotChecked=0, Total=6972 [2018-01-30 05:12:47,987 INFO L87 Difference]: Start difference. First operand 481 states and 502 transitions. Second operand 84 states. [2018-01-30 05:12:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:52,379 INFO L93 Difference]: Finished difference Result 752 states and 806 transitions. [2018-01-30 05:12:52,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-01-30 05:12:52,380 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 390 [2018-01-30 05:12:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:52,381 INFO L225 Difference]: With dead ends: 752 [2018-01-30 05:12:52,381 INFO L226 Difference]: Without dead ends: 721 [2018-01-30 05:12:52,382 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7620 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1436, Invalid=24970, Unknown=0, NotChecked=0, Total=26406 [2018-01-30 05:12:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-01-30 05:12:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 550. [2018-01-30 05:12:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-01-30 05:12:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 580 transitions. [2018-01-30 05:12:52,397 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 580 transitions. Word has length 390 [2018-01-30 05:12:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:52,398 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 580 transitions. [2018-01-30 05:12:52,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-01-30 05:12:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 580 transitions. [2018-01-30 05:12:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-01-30 05:12:52,400 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:52,400 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:52,400 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash 581102129, now seen corresponding path program 1 times [2018-01-30 05:12:52,400 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:52,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:52,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:52,401 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:52,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:52,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 145 proven. 168 refuted. 0 times theorem prover too weak. 1868 trivial. 0 not checked. [2018-01-30 05:12:52,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:52,812 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:12:52,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:52,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2018-01-30 05:12:53,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:53,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 33] total 49 [2018-01-30 05:12:53,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-30 05:12:53,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-30 05:12:53,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1983, Unknown=0, NotChecked=0, Total=2352 [2018-01-30 05:12:53,899 INFO L87 Difference]: Start difference. First operand 550 states and 580 transitions. Second operand 49 states. [2018-01-30 05:12:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:55,217 INFO L93 Difference]: Finished difference Result 878 states and 935 transitions. [2018-01-30 05:12:55,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-30 05:12:55,220 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 397 [2018-01-30 05:12:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:55,221 INFO L225 Difference]: With dead ends: 878 [2018-01-30 05:12:55,221 INFO L226 Difference]: Without dead ends: 472 [2018-01-30 05:12:55,223 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3027 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2562, Invalid=10778, Unknown=0, NotChecked=0, Total=13340 [2018-01-30 05:12:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-01-30 05:12:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 461. [2018-01-30 05:12:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-01-30 05:12:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 477 transitions. [2018-01-30 05:12:55,242 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 477 transitions. Word has length 397 [2018-01-30 05:12:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:55,242 INFO L432 AbstractCegarLoop]: Abstraction has 461 states and 477 transitions. [2018-01-30 05:12:55,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-30 05:12:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 477 transitions. [2018-01-30 05:12:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-01-30 05:12:55,244 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:55,245 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:55,245 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:55,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1720335396, now seen corresponding path program 2 times [2018-01-30 05:12:55,245 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:55,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:55,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:55,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:12:55,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:55,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 4 proven. 177 refuted. 0 times theorem prover too weak. 2283 trivial. 0 not checked. [2018-01-30 05:12:55,690 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:55,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 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 05:12:55,696 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:12:55,706 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:55,728 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:55,732 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:55,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 0 proven. 1712 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-01-30 05:12:56,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:56,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 35] total 43 [2018-01-30 05:12:56,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 05:12:56,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 05:12:56,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 05:12:56,078 INFO L87 Difference]: Start difference. First operand 461 states and 477 transitions. Second operand 43 states. [2018-01-30 05:12:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:57,173 INFO L93 Difference]: Finished difference Result 721 states and 756 transitions. [2018-01-30 05:12:57,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-30 05:12:57,187 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 418 [2018-01-30 05:12:57,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:57,189 INFO L225 Difference]: With dead ends: 721 [2018-01-30 05:12:57,189 INFO L226 Difference]: Without dead ends: 497 [2018-01-30 05:12:57,190 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2689 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2745, Invalid=7761, Unknown=0, NotChecked=0, Total=10506 [2018-01-30 05:12:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-01-30 05:12:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 482. [2018-01-30 05:12:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-01-30 05:12:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 499 transitions. [2018-01-30 05:12:57,204 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 499 transitions. Word has length 418 [2018-01-30 05:12:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:57,204 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 499 transitions. [2018-01-30 05:12:57,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 05:12:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 499 transitions. [2018-01-30 05:12:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-01-30 05:12:57,206 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:57,206 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:57,206 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:57,206 INFO L82 PathProgramCache]: Analyzing trace with hash 816475186, now seen corresponding path program 11 times [2018-01-30 05:12:57,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:57,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:57,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:57,207 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:57,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:57,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:12:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 6 proven. 1938 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-01-30 05:12:58,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:12:58,169 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 05:12:58,174 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:12:58,184 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,186 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,187 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,189 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,190 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,192 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,194 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,197 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,200 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,204 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,208 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,213 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,218 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,225 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,233 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,242 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,252 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,289 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:12:58,291 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:12:58,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:12:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 2318 trivial. 0 not checked. [2018-01-30 05:12:58,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:12:58,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 23] total 47 [2018-01-30 05:12:58,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 05:12:58,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 05:12:58,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1737, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 05:12:58,548 INFO L87 Difference]: Start difference. First operand 482 states and 499 transitions. Second operand 47 states. [2018-01-30 05:12:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:12:59,440 INFO L93 Difference]: Finished difference Result 856 states and 906 transitions. [2018-01-30 05:12:59,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-01-30 05:12:59,440 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 435 [2018-01-30 05:12:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:12:59,441 INFO L225 Difference]: With dead ends: 856 [2018-01-30 05:12:59,441 INFO L226 Difference]: Without dead ends: 625 [2018-01-30 05:12:59,442 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2283, Invalid=7817, Unknown=0, NotChecked=0, Total=10100 [2018-01-30 05:12:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-01-30 05:12:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 497. [2018-01-30 05:12:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-01-30 05:12:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 514 transitions. [2018-01-30 05:12:59,456 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 514 transitions. Word has length 435 [2018-01-30 05:12:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:12:59,457 INFO L432 AbstractCegarLoop]: Abstraction has 497 states and 514 transitions. [2018-01-30 05:12:59,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 05:12:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 514 transitions. [2018-01-30 05:12:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-01-30 05:12:59,458 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:12:59,458 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:12:59,458 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:12:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1993953930, now seen corresponding path program 12 times [2018-01-30 05:12:59,459 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:12:59,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:12:59,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:59,459 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:12:59,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:12:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:12:59,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:13:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 6 proven. 2178 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2018-01-30 05:13:00,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:13:00,320 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 05:13:00,325 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 05:13:00,335 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,346 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,349 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,351 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,354 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,357 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,360 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,363 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,367 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,371 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,376 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,380 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,385 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,391 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,397 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,404 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,411 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,420 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,430 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:13:00,431 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:13:00,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:13:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2018-01-30 05:13:00,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:13:00,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-01-30 05:13:00,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 05:13:00,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 05:13:00,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 05:13:00,525 INFO L87 Difference]: Start difference. First operand 497 states and 514 transitions. Second operand 39 states. [2018-01-30 05:13:01,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:13:01,790 INFO L93 Difference]: Finished difference Result 754 states and 788 transitions. [2018-01-30 05:13:01,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-30 05:13:01,790 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 456 [2018-01-30 05:13:01,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:13:01,791 INFO L225 Difference]: With dead ends: 754 [2018-01-30 05:13:01,791 INFO L226 Difference]: Without dead ends: 522 [2018-01-30 05:13:01,792 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-01-30 05:13:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-01-30 05:13:01,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 511. [2018-01-30 05:13:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-01-30 05:13:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 528 transitions. [2018-01-30 05:13:01,807 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 528 transitions. Word has length 456 [2018-01-30 05:13:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:13:01,807 INFO L432 AbstractCegarLoop]: Abstraction has 511 states and 528 transitions. [2018-01-30 05:13:01,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 05:13:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 528 transitions. [2018-01-30 05:13:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-01-30 05:13:01,809 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:13:01,809 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:13:01,809 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:13:01,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1656471220, now seen corresponding path program 13 times [2018-01-30 05:13:01,809 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:13:01,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:13:01,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:01,810 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:13:01,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:13:01,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:13:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3219 backedges. 6 proven. 335 refuted. 0 times theorem prover too weak. 2878 trivial. 0 not checked. [2018-01-30 05:13:02,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:13:02,409 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 05:13:02,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:13:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:13:02,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:13:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3219 backedges. 0 proven. 2432 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2018-01-30 05:13:02,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:13:02,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 41] total 51 [2018-01-30 05:13:02,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-30 05:13:02,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-30 05:13:02,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=2045, Unknown=0, NotChecked=0, Total=2550 [2018-01-30 05:13:02,885 INFO L87 Difference]: Start difference. First operand 511 states and 528 transitions. Second operand 51 states. [2018-01-30 05:13:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:13:03,950 INFO L93 Difference]: Finished difference Result 809 states and 849 transitions. [2018-01-30 05:13:03,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-01-30 05:13:03,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 470 [2018-01-30 05:13:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:13:03,956 INFO L225 Difference]: With dead ends: 809 [2018-01-30 05:13:03,956 INFO L226 Difference]: Without dead ends: 577 [2018-01-30 05:13:03,957 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2703, Invalid=9069, Unknown=0, NotChecked=0, Total=11772 [2018-01-30 05:13:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-01-30 05:13:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 532. [2018-01-30 05:13:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-01-30 05:13:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 550 transitions. [2018-01-30 05:13:03,970 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 550 transitions. Word has length 470 [2018-01-30 05:13:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:13:03,970 INFO L432 AbstractCegarLoop]: Abstraction has 532 states and 550 transitions. [2018-01-30 05:13:03,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-30 05:13:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 550 transitions. [2018-01-30 05:13:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-01-30 05:13:03,972 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:13:03,972 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:13:03,972 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:13:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash -485236695, now seen corresponding path program 3 times [2018-01-30 05:13:03,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:13:03,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:13:03,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:03,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:13:03,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:13:03,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:13:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3602 backedges. 4 proven. 255 refuted. 0 times theorem prover too weak. 3343 trivial. 0 not checked. [2018-01-30 05:13:04,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:13:04,534 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 05:13:04,538 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:13:04,549 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:13:04,559 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:13:04,562 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:13:04,565 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:13:04,569 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:13:04,572 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:13:04,573 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:13:04,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:13:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3602 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 3347 trivial. 0 not checked. [2018-01-30 05:13:04,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:13:04,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-01-30 05:13:04,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 05:13:04,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 05:13:04,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-30 05:13:04,699 INFO L87 Difference]: Start difference. First operand 532 states and 550 transitions. Second operand 12 states. [2018-01-30 05:13:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:13:04,850 INFO L93 Difference]: Finished difference Result 576 states and 598 transitions. [2018-01-30 05:13:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 05:13:04,850 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 488 [2018-01-30 05:13:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:13:04,852 INFO L225 Difference]: With dead ends: 576 [2018-01-30 05:13:04,852 INFO L226 Difference]: Without dead ends: 545 [2018-01-30 05:13:04,852 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-01-30 05:13:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-01-30 05:13:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 539. [2018-01-30 05:13:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-01-30 05:13:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 558 transitions. [2018-01-30 05:13:04,866 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 558 transitions. Word has length 488 [2018-01-30 05:13:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:13:04,866 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 558 transitions. [2018-01-30 05:13:04,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 05:13:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 558 transitions. [2018-01-30 05:13:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-01-30 05:13:04,868 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:13:04,868 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:13:04,868 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:13:04,868 INFO L82 PathProgramCache]: Analyzing trace with hash 476697735, now seen corresponding path program 14 times [2018-01-30 05:13:04,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:13:04,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:13:04,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:04,869 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:13:04,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:13:04,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:13:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3559 backedges. 6 proven. 407 refuted. 0 times theorem prover too weak. 3146 trivial. 0 not checked. [2018-01-30 05:13:05,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:13:05,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 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 05:13:05,467 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:13:05,477 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:05,502 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:05,507 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:13:05,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:13:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3559 backedges. 0 proven. 2700 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2018-01-30 05:13:06,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:13:06,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 43] total 54 [2018-01-30 05:13:06,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-30 05:13:06,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-30 05:13:06,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-01-30 05:13:06,005 INFO L87 Difference]: Start difference. First operand 539 states and 558 transitions. Second operand 54 states. [2018-01-30 05:13:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:13:07,074 INFO L93 Difference]: Finished difference Result 967 states and 1026 transitions. [2018-01-30 05:13:07,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-01-30 05:13:07,075 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 491 [2018-01-30 05:13:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:13:07,077 INFO L225 Difference]: With dead ends: 967 [2018-01-30 05:13:07,077 INFO L226 Difference]: Without dead ends: 721 [2018-01-30 05:13:07,078 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2682 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3028, Invalid=10312, Unknown=0, NotChecked=0, Total=13340 [2018-01-30 05:13:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-01-30 05:13:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 560. [2018-01-30 05:13:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-01-30 05:13:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 580 transitions. [2018-01-30 05:13:07,093 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 580 transitions. Word has length 491 [2018-01-30 05:13:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:13:07,094 INFO L432 AbstractCegarLoop]: Abstraction has 560 states and 580 transitions. [2018-01-30 05:13:07,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-30 05:13:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 580 transitions. [2018-01-30 05:13:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2018-01-30 05:13:07,096 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:13:07,096 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:13:07,096 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:13:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash -791186601, now seen corresponding path program 5 times [2018-01-30 05:13:07,096 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:13:07,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:13:07,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:07,097 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:13:07,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:13:07,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:13:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3909 backedges. 6 proven. 407 refuted. 0 times theorem prover too weak. 3496 trivial. 0 not checked. [2018-01-30 05:13:07,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:13:07,672 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 05:13:07,677 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:13:07,686 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,693 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,700 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,702 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,703 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,705 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,707 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,709 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,712 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,715 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,718 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,723 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,728 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,733 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,740 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,748 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,757 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,767 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,778 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,792 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,807 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,880 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:13:07,881 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:13:07,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:13:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3909 backedges. 257 proven. 123 refuted. 0 times theorem prover too weak. 3529 trivial. 0 not checked. [2018-01-30 05:13:08,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:13:08,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 39 [2018-01-30 05:13:08,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 05:13:08,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 05:13:08,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 05:13:08,142 INFO L87 Difference]: Start difference. First operand 560 states and 580 transitions. Second operand 39 states. [2018-01-30 05:13:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:13:08,681 INFO L93 Difference]: Finished difference Result 779 states and 820 transitions. [2018-01-30 05:13:08,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-30 05:13:08,682 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 511 [2018-01-30 05:13:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:13:08,683 INFO L225 Difference]: With dead ends: 779 [2018-01-30 05:13:08,683 INFO L226 Difference]: Without dead ends: 573 [2018-01-30 05:13:08,683 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1458, Invalid=4548, Unknown=0, NotChecked=0, Total=6006 [2018-01-30 05:13:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-01-30 05:13:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 568. [2018-01-30 05:13:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-01-30 05:13:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 585 transitions. [2018-01-30 05:13:08,697 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 585 transitions. Word has length 511 [2018-01-30 05:13:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:13:08,698 INFO L432 AbstractCegarLoop]: Abstraction has 568 states and 585 transitions. [2018-01-30 05:13:08,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 05:13:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 585 transitions. [2018-01-30 05:13:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-01-30 05:13:08,699 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:13:08,700 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:13:08,700 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:13:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash 842530634, now seen corresponding path program 15 times [2018-01-30 05:13:08,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:13:08,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:13:08,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:08,700 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:13:08,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:13:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:13:08,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-30 05:13:08,951 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$0(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:130) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 05:13:08,954 INFO L168 Benchmark]: Toolchain (without parser) took 65509.77 ms. Allocated memory was 149.4 MB in the beginning and 1.1 GB in the end (delta: 961.0 MB). Free memory was 114.5 MB in the beginning and 1.1 GB in the end (delta: -949.9 MB). Peak memory consumption was 944.7 MB. Max. memory is 5.3 GB. [2018-01-30 05:13:08,955 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 149.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 05:13:08,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 122.08 ms. Allocated memory is still 149.4 MB. Free memory was 114.3 MB in the beginning and 106.1 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. [2018-01-30 05:13:08,955 INFO L168 Benchmark]: Boogie Preprocessor took 17.72 ms. Allocated memory is still 149.4 MB. Free memory was 106.1 MB in the beginning and 104.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 05:13:08,955 INFO L168 Benchmark]: RCFGBuilder took 371.01 ms. Allocated memory is still 149.4 MB. Free memory was 104.4 MB in the beginning and 89.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-30 05:13:08,955 INFO L168 Benchmark]: IcfgTransformer took 11.78 ms. Allocated memory is still 149.4 MB. Free memory was 89.3 MB in the beginning and 88.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-01-30 05:13:08,955 INFO L168 Benchmark]: TraceAbstraction took 64984.61 ms. Allocated memory was 149.4 MB in the beginning and 1.1 GB in the end (delta: 961.0 MB). Free memory was 87.7 MB in the beginning and 1.1 GB in the end (delta: -976.6 MB). Peak memory consumption was 918.0 MB. Max. memory is 5.3 GB. [2018-01-30 05:13:08,956 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 149.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 122.08 ms. Allocated memory is still 149.4 MB. Free memory was 114.3 MB in the beginning and 106.1 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.72 ms. Allocated memory is still 149.4 MB. Free memory was 106.1 MB in the beginning and 104.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 371.01 ms. Allocated memory is still 149.4 MB. Free memory was 104.4 MB in the beginning and 89.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 11.78 ms. Allocated memory is still 149.4 MB. Free memory was 89.3 MB in the beginning and 88.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64984.61 ms. Allocated memory was 149.4 MB in the beginning and 1.1 GB in the end (delta: 961.0 MB). Free memory was 87.7 MB in the beginning and 1.1 GB in the end (delta: -976.6 MB). Peak memory consumption was 918.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/copysome2_false-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_05-13-08-961.csv Completed graceful shutdown