java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_06_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 00:12:06,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:12:06,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:12:06,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:12:06,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:12:06,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:12:06,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:12:06,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:12:06,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:12:06,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:12:06,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:12:06,087 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:12:06,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:12:06,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:12:06,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:12:06,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:12:06,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:12:06,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:12:06,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:12:06,093 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:12:06,094 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:12:06,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:12:06,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:12:06,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:12:06,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:12:06,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:12:06,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:12:06,097 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:12:06,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:12:06,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:12:06,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:12:06,098 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:12:06,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:12:06,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:12:06,104 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:12:06,104 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:12:06,105 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:12:06,105 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:12:06,105 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:12:06,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:12:06,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:12:06,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:12:06,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:12:06,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:12:06,106 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 00:12:06,106 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:12:06,106 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 00:12:06,106 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:12:06,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 00:12:06,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 00:12:06,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:12:06,106 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:12:06,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:12:06,107 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:12:06,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:12:06,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:12:06,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:12:06,107 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:12:06,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:12:06,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:12:06,107 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:12:06,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:12:06,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:12:06,108 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:12:06,108 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:12:06,108 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:12:06,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:12:06,134 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:12:06,136 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:12:06,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:12:06,137 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:12:06,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_06_true-unreach-call.i [2018-01-30 00:12:06,202 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:12:06,203 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:12:06,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:12:06,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:12:06,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:12:06,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:12:06" (1/1) ... [2018-01-30 00:12:06,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4091693d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06, skipping insertion in model container [2018-01-30 00:12:06,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:12:06" (1/1) ... [2018-01-30 00:12:06,221 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:12:06,232 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:12:06,303 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:12:06,312 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:12:06,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06 WrapperNode [2018-01-30 00:12:06,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:12:06,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:12:06,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:12:06,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:12:06,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06" (1/1) ... [2018-01-30 00:12:06,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06" (1/1) ... [2018-01-30 00:12:06,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06" (1/1) ... [2018-01-30 00:12:06,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06" (1/1) ... [2018-01-30 00:12:06,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06" (1/1) ... [2018-01-30 00:12:06,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06" (1/1) ... [2018-01-30 00:12:06,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06" (1/1) ... [2018-01-30 00:12:06,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:12:06,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:12:06,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:12:06,333 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:12:06,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:12:06,378 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:12:06,378 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:12:06,378 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 00:12:06,378 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:12:06,379 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:12:06,379 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 00:12:06,379 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:12:06,379 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:12:06,379 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:12:06,379 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:12:06,648 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:12:06,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:12:06 BoogieIcfgContainer [2018-01-30 00:12:06,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:12:06,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:12:06,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:12:06,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:12:06,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:12:06" (1/3) ... [2018-01-30 00:12:06,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc9f6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:12:06, skipping insertion in model container [2018-01-30 00:12:06,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:06" (2/3) ... [2018-01-30 00:12:06,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc9f6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:12:06, skipping insertion in model container [2018-01-30 00:12:06,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:12:06" (3/3) ... [2018-01-30 00:12:06,653 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_two_index_06_true-unreach-call.i [2018-01-30 00:12:06,658 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:12:06,663 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 00:12:06,686 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:12:06,687 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:12:06,687 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:12:06,687 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:12:06,687 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:12:06,687 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:12:06,687 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:12:06,687 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:12:06,688 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:12:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-30 00:12:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 00:12:06,700 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:06,700 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:06,701 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:06,703 INFO L82 PathProgramCache]: Analyzing trace with hash 956793125, now seen corresponding path program 1 times [2018-01-30 00:12:06,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:06,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:06,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:06,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:06,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:06,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:06,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:12:06,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:12:06,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:12:06,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:12:06,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:12:06,779 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-01-30 00:12:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:06,792 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-01-30 00:12:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:12:06,793 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-30 00:12:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:06,798 INFO L225 Difference]: With dead ends: 62 [2018-01-30 00:12:06,798 INFO L226 Difference]: Without dead ends: 33 [2018-01-30 00:12:06,800 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:12:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-30 00:12:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-30 00:12:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-30 00:12:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-30 00:12:06,821 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-01-30 00:12:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:06,822 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-30 00:12:06,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:12:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-30 00:12:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:12:06,822 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:06,823 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] [2018-01-30 00:12:06,823 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1648000248, now seen corresponding path program 1 times [2018-01-30 00:12:06,823 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:06,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:06,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:06,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:06,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:06,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:06,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:12:06,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:12:06,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:12:06,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:12:06,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:12:06,872 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-01-30 00:12:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:06,943 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-30 00:12:06,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:12:06,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-30 00:12:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:06,944 INFO L225 Difference]: With dead ends: 58 [2018-01-30 00:12:06,944 INFO L226 Difference]: Without dead ends: 39 [2018-01-30 00:12:06,944 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 00:12:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-30 00:12:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-01-30 00:12:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-30 00:12:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-30 00:12:06,947 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2018-01-30 00:12:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:06,947 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-30 00:12:06,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:12:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-30 00:12:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:12:06,948 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:06,948 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:06,948 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash -549443760, now seen corresponding path program 1 times [2018-01-30 00:12:06,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:06,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:06,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:06,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:06,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:06,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:07,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:07,004 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:07,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:07,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:12:07,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:12:07,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-01-30 00:12:07,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:12:07,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:12:07,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:12:07,108 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-01-30 00:12:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:07,266 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-01-30 00:12:07,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:12:07,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-30 00:12:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:07,268 INFO L225 Difference]: With dead ends: 72 [2018-01-30 00:12:07,268 INFO L226 Difference]: Without dead ends: 53 [2018-01-30 00:12:07,269 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:12:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-30 00:12:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-01-30 00:12:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 00:12:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-30 00:12:07,274 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 27 [2018-01-30 00:12:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:07,274 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-30 00:12:07,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:12:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-30 00:12:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:12:07,275 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:07,275 INFO L350 BasicCegarLoop]: trace histogram [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 00:12:07,275 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:07,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1872906445, now seen corresponding path program 1 times [2018-01-30 00:12:07,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:07,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:07,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:07,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:07,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:07,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-30 00:12:07,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:07,344 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:07,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:07,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:12:07,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:07,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2018-01-30 00:12:07,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:12:07,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:12:07,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:12:07,499 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-30 00:12:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:07,563 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-01-30 00:12:07,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:12:07,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-30 00:12:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:07,564 INFO L225 Difference]: With dead ends: 96 [2018-01-30 00:12:07,564 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 00:12:07,564 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:12:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 00:12:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2018-01-30 00:12:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-30 00:12:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-30 00:12:07,568 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 38 [2018-01-30 00:12:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:07,568 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-30 00:12:07,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:12:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-30 00:12:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 00:12:07,569 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:07,569 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:07,569 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash 936426808, now seen corresponding path program 2 times [2018-01-30 00:12:07,569 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:07,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:07,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:07,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:07,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:07,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-30 00:12:07,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:07,742 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 00:12:07,769 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:12:07,776 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:07,783 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:07,783 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:07,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-30 00:12:07,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:07,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 00:12:07,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:12:07,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:12:07,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:12:07,823 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 7 states. [2018-01-30 00:12:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:07,916 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-01-30 00:12:07,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:12:07,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-01-30 00:12:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:07,918 INFO L225 Difference]: With dead ends: 100 [2018-01-30 00:12:07,918 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 00:12:07,919 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:12:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 00:12:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-01-30 00:12:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 00:12:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-01-30 00:12:07,922 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 55 [2018-01-30 00:12:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:07,922 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-01-30 00:12:07,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:12:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-01-30 00:12:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 00:12:07,923 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:07,923 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:07,923 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2104349072, now seen corresponding path program 3 times [2018-01-30 00:12:07,924 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:07,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:07,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:07,924 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:07,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:07,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-30 00:12:08,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:08,059 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:08,070 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:12:08,078 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:08,086 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:08,096 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:08,105 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:08,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-30 00:12:08,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:08,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-01-30 00:12:08,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:12:08,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:12:08,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:12:08,267 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 10 states. [2018-01-30 00:12:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:08,450 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2018-01-30 00:12:08,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:12:08,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-01-30 00:12:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:08,451 INFO L225 Difference]: With dead ends: 135 [2018-01-30 00:12:08,451 INFO L226 Difference]: Without dead ends: 109 [2018-01-30 00:12:08,452 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:12:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-30 00:12:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2018-01-30 00:12:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 00:12:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-01-30 00:12:08,455 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 61 [2018-01-30 00:12:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:08,456 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-01-30 00:12:08,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:12:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-01-30 00:12:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 00:12:08,456 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:08,457 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:08,457 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash 371948099, now seen corresponding path program 4 times [2018-01-30 00:12:08,457 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:08,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:08,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:08,457 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:08,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:08,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-30 00:12:08,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:08,647 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:08,652 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:12:08,666 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:08,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:08,706 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 00:12:08,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:08,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:12:08,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:12:08,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:08,732 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 00:12:08,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:08,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:08,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:12:08,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:08,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:08,808 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 00:12:08,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:08,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:08,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:25 [2018-01-30 00:12:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-01-30 00:12:09,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:09,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-30 00:12:09,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:12:09,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:12:09,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:12:09,079 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 21 states. [2018-01-30 00:12:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:09,597 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-30 00:12:09,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:12:09,597 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-01-30 00:12:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:09,598 INFO L225 Difference]: With dead ends: 145 [2018-01-30 00:12:09,598 INFO L226 Difference]: Without dead ends: 114 [2018-01-30 00:12:09,598 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=1322, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:12:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-30 00:12:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-01-30 00:12:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-30 00:12:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-01-30 00:12:09,605 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 84 [2018-01-30 00:12:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:09,605 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-01-30 00:12:09,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:12:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-01-30 00:12:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 00:12:09,606 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:09,606 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 4, 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] [2018-01-30 00:12:09,606 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash -23451747, now seen corresponding path program 1 times [2018-01-30 00:12:09,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:09,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:09,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:09,607 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:09,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:09,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 2 proven. 234 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:12:09,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:09,747 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:09,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:09,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-30 00:12:09,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:09,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-01-30 00:12:09,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:12:09,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:12:09,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:12:09,796 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 12 states. [2018-01-30 00:12:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:09,964 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-01-30 00:12:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:12:09,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-01-30 00:12:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:09,965 INFO L225 Difference]: With dead ends: 156 [2018-01-30 00:12:09,965 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 00:12:09,966 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:12:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 00:12:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-01-30 00:12:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-30 00:12:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-01-30 00:12:09,982 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 99 [2018-01-30 00:12:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:09,983 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-01-30 00:12:09,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:12:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-01-30 00:12:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 00:12:09,984 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:09,984 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 4, 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] [2018-01-30 00:12:09,984 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:09,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1020520459, now seen corresponding path program 2 times [2018-01-30 00:12:09,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:09,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:09,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:09,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:09,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:09,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 2 proven. 290 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:12:10,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:10,349 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:10,355 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:12:10,359 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:10,371 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:10,382 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:10,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-30 00:12:10,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:10,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-01-30 00:12:10,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:12:10,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:12:10,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:12:10,417 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 13 states. [2018-01-30 00:12:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:10,747 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-01-30 00:12:10,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:12:10,747 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2018-01-30 00:12:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:10,748 INFO L225 Difference]: With dead ends: 162 [2018-01-30 00:12:10,748 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 00:12:10,749 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:12:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 00:12:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-01-30 00:12:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 00:12:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-01-30 00:12:10,753 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 105 [2018-01-30 00:12:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:10,754 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-01-30 00:12:10,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:12:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-01-30 00:12:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 00:12:10,754 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:10,755 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 4, 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] [2018-01-30 00:12:10,755 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash 497968717, now seen corresponding path program 3 times [2018-01-30 00:12:10,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:10,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:10,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:10,755 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:10,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:10,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 2 proven. 352 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:12:10,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:10,877 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:10,890 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:12:10,899 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:10,917 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:10,919 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:10,920 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:10,921 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:10,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-01-30 00:12:10,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:10,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 16 [2018-01-30 00:12:10,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:12:10,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:12:10,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:12:10,966 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 16 states. [2018-01-30 00:12:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:11,109 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-01-30 00:12:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:12:11,110 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 111 [2018-01-30 00:12:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:11,111 INFO L225 Difference]: With dead ends: 197 [2018-01-30 00:12:11,111 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 00:12:11,111 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:12:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 00:12:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2018-01-30 00:12:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-30 00:12:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2018-01-30 00:12:11,117 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 111 [2018-01-30 00:12:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:11,117 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2018-01-30 00:12:11,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:12:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2018-01-30 00:12:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-30 00:12:11,118 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:11,118 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 5, 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] [2018-01-30 00:12:11,118 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:11,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1289805920, now seen corresponding path program 4 times [2018-01-30 00:12:11,119 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:11,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:11,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:11,119 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:11,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:11,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 2 proven. 574 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-30 00:12:11,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:11,325 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:11,330 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:12:11,342 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:11,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:11,615 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 00:12:11,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:11,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:12:11,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:12:11,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:11,643 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 00:12:11,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:11,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:11,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:12:11,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:11,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:11,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:11,712 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 34 [2018-01-30 00:12:11,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:11,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:11,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:30 [2018-01-30 00:12:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 4 proven. 473 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-01-30 00:12:12,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:12,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 40 [2018-01-30 00:12:12,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 00:12:12,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 00:12:12,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 00:12:12,046 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 40 states. [2018-01-30 00:12:15,251 WARN L143 SmtUtils]: Spent 1327ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-30 00:12:17,322 WARN L143 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 28 [2018-01-30 00:12:18,489 WARN L143 SmtUtils]: Spent 547ms on a formula simplification that was a NOOP. DAG size: 26 [2018-01-30 00:12:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:19,927 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2018-01-30 00:12:19,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 00:12:19,928 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 134 [2018-01-30 00:12:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:19,929 INFO L225 Difference]: With dead ends: 218 [2018-01-30 00:12:19,929 INFO L226 Difference]: Without dead ends: 175 [2018-01-30 00:12:19,930 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=650, Invalid=3507, Unknown=3, NotChecked=0, Total=4160 [2018-01-30 00:12:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-30 00:12:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2018-01-30 00:12:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-30 00:12:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2018-01-30 00:12:19,940 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 134 [2018-01-30 00:12:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:19,940 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2018-01-30 00:12:19,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 00:12:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2018-01-30 00:12:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-30 00:12:19,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:19,942 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:19,942 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash -792202016, now seen corresponding path program 5 times [2018-01-30 00:12:19,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:19,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:19,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:19,943 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:19,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:19,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 4 proven. 660 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 00:12:20,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:20,107 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:20,116 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:12:20,120 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,121 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,122 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,123 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,124 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,125 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,126 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,127 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,128 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,130 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,131 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,134 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,136 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,139 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,143 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,151 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:20,152 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:20,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-01-30 00:12:20,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:20,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-01-30 00:12:20,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 00:12:20,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 00:12:20,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:12:20,192 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 18 states. [2018-01-30 00:12:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:20,320 INFO L93 Difference]: Finished difference Result 220 states and 227 transitions. [2018-01-30 00:12:20,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:12:20,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2018-01-30 00:12:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:20,321 INFO L225 Difference]: With dead ends: 220 [2018-01-30 00:12:20,321 INFO L226 Difference]: Without dead ends: 168 [2018-01-30 00:12:20,321 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:12:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-30 00:12:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2018-01-30 00:12:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-30 00:12:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2018-01-30 00:12:20,326 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 149 [2018-01-30 00:12:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:20,327 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2018-01-30 00:12:20,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 00:12:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2018-01-30 00:12:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-01-30 00:12:20,328 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:20,328 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:20,328 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash 315629368, now seen corresponding path program 6 times [2018-01-30 00:12:20,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:20,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:20,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:20,328 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:20,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:20,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 4 proven. 752 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 00:12:20,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:20,520 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:20,527 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:12:20,532 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:20,533 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:20,535 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:20,537 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:20,539 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:20,540 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:20,542 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:20,544 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:20,546 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:20,546 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:20,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-01-30 00:12:20,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:20,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 21 [2018-01-30 00:12:20,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:12:20,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:12:20,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:12:20,653 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 21 states. [2018-01-30 00:12:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:20,760 INFO L93 Difference]: Finished difference Result 255 states and 267 transitions. [2018-01-30 00:12:20,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:12:20,760 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 155 [2018-01-30 00:12:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:20,761 INFO L225 Difference]: With dead ends: 255 [2018-01-30 00:12:20,761 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 00:12:20,762 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:12:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 00:12:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 181. [2018-01-30 00:12:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-30 00:12:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 184 transitions. [2018-01-30 00:12:20,767 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 184 transitions. Word has length 155 [2018-01-30 00:12:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:20,767 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 184 transitions. [2018-01-30 00:12:20,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:12:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 184 transitions. [2018-01-30 00:12:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-30 00:12:20,768 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:20,768 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:20,768 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1346571483, now seen corresponding path program 7 times [2018-01-30 00:12:20,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:20,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:20,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:20,769 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:20,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:20,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 4 proven. 1064 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-01-30 00:12:21,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:21,185 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:21,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:21,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-30 00:12:21,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:21,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-01-30 00:12:21,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:12:21,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:12:21,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:12:21,241 INFO L87 Difference]: Start difference. First operand 181 states and 184 transitions. Second operand 22 states. [2018-01-30 00:12:21,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:21,339 INFO L93 Difference]: Finished difference Result 259 states and 267 transitions. [2018-01-30 00:12:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:12:21,339 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2018-01-30 00:12:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:21,340 INFO L225 Difference]: With dead ends: 259 [2018-01-30 00:12:21,340 INFO L226 Difference]: Without dead ends: 202 [2018-01-30 00:12:21,341 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:12:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-30 00:12:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 187. [2018-01-30 00:12:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:12:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 190 transitions. [2018-01-30 00:12:21,346 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 190 transitions. Word has length 178 [2018-01-30 00:12:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:21,346 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 190 transitions. [2018-01-30 00:12:21,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:12:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 190 transitions. [2018-01-30 00:12:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 00:12:21,347 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:21,347 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:21,347 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:21,347 INFO L82 PathProgramCache]: Analyzing trace with hash 985538947, now seen corresponding path program 8 times [2018-01-30 00:12:21,347 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:21,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:21,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:21,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:21,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:21,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 4 proven. 1180 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-01-30 00:12:21,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:21,571 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:21,575 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:12:21,580 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:21,590 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:21,592 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:21,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-30 00:12:21,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:21,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-01-30 00:12:21,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 00:12:21,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 00:12:21,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:12:21,633 INFO L87 Difference]: Start difference. First operand 187 states and 190 transitions. Second operand 23 states. [2018-01-30 00:12:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:21,797 INFO L93 Difference]: Finished difference Result 265 states and 273 transitions. [2018-01-30 00:12:21,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:12:21,797 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 184 [2018-01-30 00:12:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:21,798 INFO L225 Difference]: With dead ends: 265 [2018-01-30 00:12:21,798 INFO L226 Difference]: Without dead ends: 208 [2018-01-30 00:12:21,798 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:12:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-30 00:12:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 193. [2018-01-30 00:12:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-30 00:12:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 196 transitions. [2018-01-30 00:12:21,803 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 196 transitions. Word has length 184 [2018-01-30 00:12:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:21,803 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 196 transitions. [2018-01-30 00:12:21,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 00:12:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 196 transitions. [2018-01-30 00:12:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-30 00:12:21,804 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:21,804 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:21,804 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:21,804 INFO L82 PathProgramCache]: Analyzing trace with hash -793700309, now seen corresponding path program 9 times [2018-01-30 00:12:21,804 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:21,804 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:21,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:21,805 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:21,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:21,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 4 proven. 1302 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-01-30 00:12:22,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:22,045 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:22,050 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:12:22,056 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:22,058 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:22,060 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:22,063 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:22,065 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:22,067 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:22,068 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:22,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2018-01-30 00:12:22,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:22,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 26 [2018-01-30 00:12:22,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 00:12:22,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 00:12:22,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-01-30 00:12:22,127 INFO L87 Difference]: Start difference. First operand 193 states and 196 transitions. Second operand 26 states. [2018-01-30 00:12:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:22,313 INFO L93 Difference]: Finished difference Result 300 states and 313 transitions. [2018-01-30 00:12:22,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:12:22,313 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 190 [2018-01-30 00:12:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:22,314 INFO L225 Difference]: With dead ends: 300 [2018-01-30 00:12:22,314 INFO L226 Difference]: Without dead ends: 243 [2018-01-30 00:12:22,315 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-01-30 00:12:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-30 00:12:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 216. [2018-01-30 00:12:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-30 00:12:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 219 transitions. [2018-01-30 00:12:22,320 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 219 transitions. Word has length 190 [2018-01-30 00:12:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:22,320 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 219 transitions. [2018-01-30 00:12:22,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 00:12:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 219 transitions. [2018-01-30 00:12:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-01-30 00:12:22,321 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:22,321 INFO L350 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 7, 6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:22,321 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1246874840, now seen corresponding path program 10 times [2018-01-30 00:12:22,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:22,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:22,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:22,322 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:22,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:22,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 4 proven. 1704 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-01-30 00:12:23,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:23,083 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:23,087 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:12:23,104 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:23,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:23,456 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 00:12:23,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:23,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:12:23,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:12:23,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,491 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 00:12:23,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:23,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:23,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:12:23,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,552 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 34 [2018-01-30 00:12:23,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:23,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:23,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:30 [2018-01-30 00:12:23,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:23,656 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 53 [2018-01-30 00:12:23,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:23,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:23,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:42 [2018-01-30 00:12:26,115 WARN L143 SmtUtils]: Spent 1470ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-30 00:12:28,263 WARN L143 SmtUtils]: Spent 2075ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-30 00:12:28,710 WARN L143 SmtUtils]: Spent 163ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-30 00:12:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 14 proven. 1443 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2018-01-30 00:12:28,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:28,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 35] total 60 [2018-01-30 00:12:28,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-30 00:12:28,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-30 00:12:28,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=2777, Unknown=2, NotChecked=0, Total=3540 [2018-01-30 00:12:28,917 INFO L87 Difference]: Start difference. First operand 216 states and 219 transitions. Second operand 60 states. [2018-01-30 00:12:36,649 WARN L143 SmtUtils]: Spent 1329ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 00:12:38,551 WARN L143 SmtUtils]: Spent 1512ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-30 00:12:40,683 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-30 00:12:42,407 WARN L143 SmtUtils]: Spent 1002ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-30 00:12:44,575 WARN L143 SmtUtils]: Spent 2048ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-30 00:12:46,743 WARN L143 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-30 00:12:49,001 WARN L143 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-30 00:12:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:49,809 INFO L93 Difference]: Finished difference Result 323 states and 337 transitions. [2018-01-30 00:12:49,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-01-30 00:12:49,809 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 213 [2018-01-30 00:12:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:49,810 INFO L225 Difference]: With dead ends: 323 [2018-01-30 00:12:49,810 INFO L226 Difference]: Without dead ends: 261 [2018-01-30 00:12:49,811 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=1455, Invalid=7282, Unknown=5, NotChecked=0, Total=8742 [2018-01-30 00:12:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-30 00:12:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 231. [2018-01-30 00:12:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-30 00:12:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 234 transitions. [2018-01-30 00:12:49,818 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 234 transitions. Word has length 213 [2018-01-30 00:12:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:49,818 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 234 transitions. [2018-01-30 00:12:49,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-30 00:12:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 234 transitions. [2018-01-30 00:12:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-30 00:12:49,819 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:49,819 INFO L350 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 7, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:49,819 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:49,819 INFO L82 PathProgramCache]: Analyzing trace with hash -581397768, now seen corresponding path program 11 times [2018-01-30 00:12:49,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:49,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:49,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:49,820 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:49,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:49,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 6 proven. 1850 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-01-30 00:12:50,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:50,373 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:50,377 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:12:50,383 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,384 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,384 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,385 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,386 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,387 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,388 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,390 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,391 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,392 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,394 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,396 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,398 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,400 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,402 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,405 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,408 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,411 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,415 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,419 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,424 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,429 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,436 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,444 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,452 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,469 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:50,470 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:50,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-01-30 00:12:50,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:50,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-01-30 00:12:50,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 00:12:50,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 00:12:50,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:12:50,515 INFO L87 Difference]: Start difference. First operand 231 states and 234 transitions. Second operand 28 states. [2018-01-30 00:12:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:51,001 INFO L93 Difference]: Finished difference Result 323 states and 331 transitions. [2018-01-30 00:12:51,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:12:51,001 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 228 [2018-01-30 00:12:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:51,002 INFO L225 Difference]: With dead ends: 323 [2018-01-30 00:12:51,002 INFO L226 Difference]: Without dead ends: 252 [2018-01-30 00:12:51,002 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:12:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-30 00:12:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 237. [2018-01-30 00:12:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-30 00:12:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 240 transitions. [2018-01-30 00:12:51,009 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 240 transitions. Word has length 228 [2018-01-30 00:12:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:51,010 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 240 transitions. [2018-01-30 00:12:51,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 00:12:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 240 transitions. [2018-01-30 00:12:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-01-30 00:12:51,010 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:51,011 INFO L350 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 7, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:51,011 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash -994955872, now seen corresponding path program 12 times [2018-01-30 00:12:51,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:51,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:51,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,011 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:51,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:51,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 6 proven. 2002 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-01-30 00:12:51,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:51,337 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:51,342 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:12:51,348 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,350 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,352 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,353 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,355 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,357 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,360 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,362 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,364 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,366 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,368 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,371 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,375 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:12:51,375 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:51,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2044 trivial. 0 not checked. [2018-01-30 00:12:51,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:51,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9] total 31 [2018-01-30 00:12:51,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 00:12:51,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 00:12:51,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-01-30 00:12:51,441 INFO L87 Difference]: Start difference. First operand 237 states and 240 transitions. Second operand 31 states. [2018-01-30 00:12:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:51,766 INFO L93 Difference]: Finished difference Result 358 states and 371 transitions. [2018-01-30 00:12:51,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 00:12:51,776 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 234 [2018-01-30 00:12:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:51,777 INFO L225 Difference]: With dead ends: 358 [2018-01-30 00:12:51,777 INFO L226 Difference]: Without dead ends: 287 [2018-01-30 00:12:51,778 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-01-30 00:12:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-30 00:12:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 260. [2018-01-30 00:12:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-01-30 00:12:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 263 transitions. [2018-01-30 00:12:51,795 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 263 transitions. Word has length 234 [2018-01-30 00:12:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:51,795 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 263 transitions. [2018-01-30 00:12:51,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 00:12:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 263 transitions. [2018-01-30 00:12:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-01-30 00:12:51,796 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:51,796 INFO L350 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 8, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:51,796 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1397269507, now seen corresponding path program 13 times [2018-01-30 00:12:51,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:51,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:51,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,797 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:51,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:51,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2655 backedges. 6 proven. 2494 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-01-30 00:12:52,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:52,247 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:52,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:52,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2655 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 00:12:52,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:52,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-01-30 00:12:52,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-30 00:12:52,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-30 00:12:52,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-01-30 00:12:52,325 INFO L87 Difference]: Start difference. First operand 260 states and 263 transitions. Second operand 32 states. [2018-01-30 00:12:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:53,450 INFO L93 Difference]: Finished difference Result 357 states and 365 transitions. [2018-01-30 00:12:53,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 00:12:53,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 257 [2018-01-30 00:12:53,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:53,451 INFO L225 Difference]: With dead ends: 357 [2018-01-30 00:12:53,451 INFO L226 Difference]: Without dead ends: 281 [2018-01-30 00:12:53,452 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-01-30 00:12:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-01-30 00:12:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 266. [2018-01-30 00:12:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-01-30 00:12:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2018-01-30 00:12:53,459 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 257 [2018-01-30 00:12:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:53,459 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2018-01-30 00:12:53,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-30 00:12:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2018-01-30 00:12:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-01-30 00:12:53,460 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:53,460 INFO L350 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 8, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:53,460 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash 546087509, now seen corresponding path program 14 times [2018-01-30 00:12:53,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:53,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:53,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:53,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:53,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:53,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 6 proven. 2670 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-01-30 00:12:54,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:54,520 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:54,528 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:12:54,539 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:54,553 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:54,556 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:54,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 00:12:54,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:54,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-01-30 00:12:54,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:12:54,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:12:54,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:12:54,609 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand 33 states. [2018-01-30 00:12:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:54,850 INFO L93 Difference]: Finished difference Result 363 states and 371 transitions. [2018-01-30 00:12:54,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 00:12:54,851 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 263 [2018-01-30 00:12:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:54,852 INFO L225 Difference]: With dead ends: 363 [2018-01-30 00:12:54,852 INFO L226 Difference]: Without dead ends: 287 [2018-01-30 00:12:54,852 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:12:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-30 00:12:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 272. [2018-01-30 00:12:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-30 00:12:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2018-01-30 00:12:54,863 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 263 [2018-01-30 00:12:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:54,863 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2018-01-30 00:12:54,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:12:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2018-01-30 00:12:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-01-30 00:12:54,864 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:54,864 INFO L350 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 8, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:54,864 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1007040851, now seen corresponding path program 15 times [2018-01-30 00:12:54,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:54,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:54,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:54,865 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:54,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:54,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3013 backedges. 6 proven. 2852 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-01-30 00:12:55,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:55,525 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:55,530 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:12:55,537 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:55,539 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:55,541 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:55,544 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:55,546 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:55,548 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:55,551 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:55,555 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:55,555 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:55,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3013 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2894 trivial. 0 not checked. [2018-01-30 00:12:55,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:55,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 10] total 36 [2018-01-30 00:12:55,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 00:12:55,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 00:12:55,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:12:55,628 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand 36 states. [2018-01-30 00:12:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:55,888 INFO L93 Difference]: Finished difference Result 403 states and 417 transitions. [2018-01-30 00:12:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 00:12:55,899 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 269 [2018-01-30 00:12:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:55,900 INFO L225 Difference]: With dead ends: 403 [2018-01-30 00:12:55,900 INFO L226 Difference]: Without dead ends: 327 [2018-01-30 00:12:55,900 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:12:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-01-30 00:12:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 295. [2018-01-30 00:12:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-01-30 00:12:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 298 transitions. [2018-01-30 00:12:55,910 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 298 transitions. Word has length 269 [2018-01-30 00:12:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:55,910 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 298 transitions. [2018-01-30 00:12:55,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 00:12:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 298 transitions. [2018-01-30 00:12:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-01-30 00:12:55,911 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:55,911 INFO L350 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 9, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:55,911 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:12:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash -355170304, now seen corresponding path program 16 times [2018-01-30 00:12:55,912 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:55,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:55,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:55,912 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:55,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:55,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3632 backedges. 6 proven. 3434 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-01-30 00:12:56,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:56,713 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:56,718 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:12:56,745 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:56,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:57,163 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 00:12:57,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:57,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:12:57,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:12:57,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:57,206 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 00:12:57,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:57,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:57,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:12:57,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:57,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:57,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:57,496 INFO L303 Elim1Store]: Index analysis took 151 ms [2018-01-30 00:12:57,496 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 34 [2018-01-30 00:12:57,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:57,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:57,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:30 [2018-01-30 00:12:58,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,244 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 53 [2018-01-30 00:12:58,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:58,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:58,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:42 [2018-01-30 00:12:58,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:12:58,448 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 76 [2018-01-30 00:12:58,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:58,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:58,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:55, output treesize:54 [2018-01-30 00:13:10,181 WARN L143 SmtUtils]: Spent 220ms on a formula simplification that was a NOOP. DAG size: 48 [2018-01-30 00:13:12,912 WARN L143 SmtUtils]: Spent 235ms on a formula simplification that was a NOOP. DAG size: 45 [2018-01-30 00:13:17,491 WARN L143 SmtUtils]: Spent 2066ms on a formula simplification that was a NOOP. DAG size: 46 [2018-01-30 00:13:21,000 WARN L143 SmtUtils]: Spent 981ms on a formula simplification that was a NOOP. DAG size: 45 [2018-01-30 00:13:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3632 backedges. 29 proven. 2937 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-01-30 00:13:21,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:21,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 46] total 81 [2018-01-30 00:13:21,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-01-30 00:13:21,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-01-30 00:13:21,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1429, Invalid=5039, Unknown=12, NotChecked=0, Total=6480 [2018-01-30 00:13:21,197 INFO L87 Difference]: Start difference. First operand 295 states and 298 transitions. Second operand 81 states. Received shutdown request... [2018-01-30 00:13:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:13:21,683 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:13:21,687 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:13:21,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:13:21 BoogieIcfgContainer [2018-01-30 00:13:21,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:13:21,688 INFO L168 Benchmark]: Toolchain (without parser) took 75485.50 ms. Allocated memory was 148.4 MB in the beginning and 487.6 MB in the end (delta: 339.2 MB). Free memory was 112.0 MB in the beginning and 99.3 MB in the end (delta: 12.7 MB). Peak memory consumption was 351.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:13:21,688 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 148.4 MB. Free memory is still 116.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:13:21,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 111.40 ms. Allocated memory is still 148.4 MB. Free memory was 112.0 MB in the beginning and 103.5 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:13:21,689 INFO L168 Benchmark]: Boogie Preprocessor took 18.10 ms. Allocated memory is still 148.4 MB. Free memory was 103.5 MB in the beginning and 102.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:13:21,689 INFO L168 Benchmark]: RCFGBuilder took 315.28 ms. Allocated memory is still 148.4 MB. Free memory was 102.1 MB in the beginning and 89.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:13:21,689 INFO L168 Benchmark]: TraceAbstraction took 75038.12 ms. Allocated memory was 148.4 MB in the beginning and 487.6 MB in the end (delta: 339.2 MB). Free memory was 89.7 MB in the beginning and 99.3 MB in the end (delta: -9.5 MB). Peak memory consumption was 329.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:13:21,690 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.12 ms. Allocated memory is still 148.4 MB. Free memory is still 116.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 111.40 ms. Allocated memory is still 148.4 MB. Free memory was 112.0 MB in the beginning and 103.5 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.10 ms. Allocated memory is still 148.4 MB. Free memory was 103.5 MB in the beginning and 102.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 315.28 ms. Allocated memory is still 148.4 MB. Free memory was 102.1 MB in the beginning and 89.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 75038.12 ms. Allocated memory was 148.4 MB in the beginning and 487.6 MB in the end (delta: 339.2 MB). Free memory was 89.7 MB in the beginning and 99.3 MB in the end (delta: -9.5 MB). Peak memory consumption was 329.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (295states) and interpolant automaton (currently 18 states, 81 states before enhancement), while ReachableStatesComputation was computing reachable states (96 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. TIMEOUT Result, 75.0s OverallTime, 23 OverallIterations, 35 TraceHistogramMax, 34.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 851 SDtfs, 2821 SDslu, 10415 SDs, 0 SdLazy, 10419 SolverSat, 555 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3805 GetRequests, 3227 SyntacticMatches, 0 SemanticMatches, 578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7424 ImplicationChecksByTransitivity, 59.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 357 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 6692 NumberOfCodeBlocks, 6055 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 6648 ConstructedInterpolants, 101 QuantifiedInterpolants, 4134032 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3893 ConjunctsInSsa, 434 ConjunctsInUnsatCore, 44 InterpolantComputations, 3 PerfectInterpolantSequences, 11144/50564 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_two_index_06_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-13-21-694.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_two_index_06_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-13-21-694.csv Completed graceful shutdown