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_07_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 00:13:23,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:13:23,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:13:23,724 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:13:23,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:13:23,724 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:13:23,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:13:23,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:13:23,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:13:23,728 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:13:23,729 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:13:23,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:13:23,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:13:23,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:13:23,731 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:13:23,732 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:13:23,734 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:13:23,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:13:23,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:13:23,742 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:13:23,743 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:13:23,743 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:13:23,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:13:23,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:13:23,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:13:23,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:13:23,747 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:13:23,747 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:13:23,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:13:23,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:13:23,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:13:23,748 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:13:23,759 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:13:23,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:13:23,760 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:13:23,760 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:13:23,760 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:13:23,760 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:13:23,760 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:13:23,761 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:13:23,761 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:13:23,761 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:13:23,761 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:13:23,761 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:13:23,761 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 00:13:23,761 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:13:23,761 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 00:13:23,761 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:13:23,761 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 00:13:23,762 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:13:23,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:13:23,762 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:13:23,763 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:13:23,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:13:23,763 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:13:23,763 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:13:23,763 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:13:23,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:13:23,788 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:13:23,792 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:13:23,792 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:13:23,793 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:13:23,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_07_true-unreach-call.i [2018-01-30 00:13:23,858 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:13:23,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:13:23,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:13:23,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:13:23,863 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:13:23,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:13:23" (1/1) ... [2018-01-30 00:13:23,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d376cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23, skipping insertion in model container [2018-01-30 00:13:23,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:13:23" (1/1) ... [2018-01-30 00:13:23,874 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:13:23,888 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:13:23,957 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:13:23,966 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:13:23,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23 WrapperNode [2018-01-30 00:13:23,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:13:23,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:13:23,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:13:23,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:13:23,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23" (1/1) ... [2018-01-30 00:13:23,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23" (1/1) ... [2018-01-30 00:13:23,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23" (1/1) ... [2018-01-30 00:13:23,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23" (1/1) ... [2018-01-30 00:13:23,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23" (1/1) ... [2018-01-30 00:13:23,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23" (1/1) ... [2018-01-30 00:13:23,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23" (1/1) ... [2018-01-30 00:13:23,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:13:23,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:13:23,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:13:23,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:13:23,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23" (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:13:24,027 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:13:24,027 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:13:24,028 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 00:13:24,028 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:13:24,028 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:13:24,028 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 00:13:24,028 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:13:24,028 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:13:24,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:13:24,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:13:24,281 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:13:24,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:13:24 BoogieIcfgContainer [2018-01-30 00:13:24,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:13:24,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:13:24,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:13:24,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:13:24,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:13:23" (1/3) ... [2018-01-30 00:13:24,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e2c416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:13:24, skipping insertion in model container [2018-01-30 00:13:24,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:23" (2/3) ... [2018-01-30 00:13:24,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e2c416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:13:24, skipping insertion in model container [2018-01-30 00:13:24,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:13:24" (3/3) ... [2018-01-30 00:13:24,286 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_two_index_07_true-unreach-call.i [2018-01-30 00:13:24,291 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:13:24,296 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 00:13:24,320 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:13:24,320 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:13:24,320 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:13:24,320 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:13:24,320 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:13:24,320 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:13:24,320 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:13:24,320 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:13:24,321 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:13:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-30 00:13:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 00:13:24,333 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:24,333 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:13:24,333 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 956793125, now seen corresponding path program 1 times [2018-01-30 00:13:24,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:24,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:24,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:24,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:24,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:24,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:24,400 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:13:24,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:24,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:13:24,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:13:24,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:13:24,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:13:24,411 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-01-30 00:13:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:24,426 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-01-30 00:13:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:13:24,426 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-30 00:13:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:24,432 INFO L225 Difference]: With dead ends: 62 [2018-01-30 00:13:24,432 INFO L226 Difference]: Without dead ends: 33 [2018-01-30 00:13:24,434 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:13:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-30 00:13:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-30 00:13:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-30 00:13:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-30 00:13:24,454 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-01-30 00:13:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:24,454 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-30 00:13:24,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:13:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-30 00:13:24,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:13:24,455 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:24,455 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:13:24,455 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:24,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1648000248, now seen corresponding path program 1 times [2018-01-30 00:13:24,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:24,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:24,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:24,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:24,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:24,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:24,494 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:13:24,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:24,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:13:24,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:13:24,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:13:24,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:13:24,495 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-01-30 00:13:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:24,573 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-30 00:13:24,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:13:24,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-30 00:13:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:24,574 INFO L225 Difference]: With dead ends: 58 [2018-01-30 00:13:24,574 INFO L226 Difference]: Without dead ends: 39 [2018-01-30 00:13:24,574 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:13:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-30 00:13:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-01-30 00:13:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-30 00:13:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-30 00:13:24,577 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2018-01-30 00:13:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:24,578 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-30 00:13:24,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:13:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-30 00:13:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:13:24,578 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:24,578 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:13:24,578 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash -549443760, now seen corresponding path program 1 times [2018-01-30 00:13:24,579 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:24,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:24,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:24,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:24,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:24,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:24,684 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:13:24,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:24,685 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:13:24,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:24,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:24,731 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:13:24,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:13:24,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-01-30 00:13:24,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:13:24,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:13:24,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:13:24,748 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-01-30 00:13:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:24,886 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-01-30 00:13:24,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:13:24,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-30 00:13:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:24,888 INFO L225 Difference]: With dead ends: 72 [2018-01-30 00:13:24,888 INFO L226 Difference]: Without dead ends: 53 [2018-01-30 00:13:24,889 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:13:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-30 00:13:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-01-30 00:13:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 00:13:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-30 00:13:24,894 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 27 [2018-01-30 00:13:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:24,894 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-30 00:13:24,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:13:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-30 00:13:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:13:24,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:24,895 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:13:24,895 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:24,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1872906445, now seen corresponding path program 1 times [2018-01-30 00:13:24,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:24,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:24,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:24,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:24,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:24,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:25,001 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:13:25,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:25,002 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:13:25,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:25,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:25,048 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:13:25,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:25,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2018-01-30 00:13:25,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:13:25,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:13:25,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:13:25,066 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-30 00:13:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:25,245 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-01-30 00:13:25,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:13:25,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-30 00:13:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:25,246 INFO L225 Difference]: With dead ends: 96 [2018-01-30 00:13:25,246 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 00:13:25,246 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:13:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 00:13:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2018-01-30 00:13:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-30 00:13:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-30 00:13:25,251 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 38 [2018-01-30 00:13:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:25,251 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-30 00:13:25,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:13:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-30 00:13:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 00:13:25,252 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:25,252 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:13:25,252 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash 936426808, now seen corresponding path program 2 times [2018-01-30 00:13:25,253 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:25,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:25,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:25,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:25,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:25,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:25,397 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:13:25,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:25,397 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:13:25,409 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:13:25,415 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:25,423 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:25,424 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:25,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:25,431 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:13:25,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:25,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 00:13:25,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:13:25,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:13:25,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:13:25,448 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 7 states. [2018-01-30 00:13:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:25,556 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-01-30 00:13:25,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:13:25,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-01-30 00:13:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:25,557 INFO L225 Difference]: With dead ends: 100 [2018-01-30 00:13:25,557 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 00:13:25,557 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:13:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 00:13:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-01-30 00:13:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 00:13:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-01-30 00:13:25,561 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 55 [2018-01-30 00:13:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:25,562 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-01-30 00:13:25,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:13:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-01-30 00:13:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 00:13:25,563 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:25,563 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:13:25,563 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2104349072, now seen corresponding path program 3 times [2018-01-30 00:13:25,563 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:25,563 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:25,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:25,564 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:25,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:25,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:25,694 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:13:25,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:25,695 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:13:25,705 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:13:25,710 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:25,724 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:25,737 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:25,749 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:25,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:25,871 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:13:25,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:25,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-01-30 00:13:25,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:13:25,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:13:25,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:13:25,890 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 10 states. [2018-01-30 00:13:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:26,168 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2018-01-30 00:13:26,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:13:26,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-01-30 00:13:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:26,169 INFO L225 Difference]: With dead ends: 135 [2018-01-30 00:13:26,169 INFO L226 Difference]: Without dead ends: 109 [2018-01-30 00:13:26,169 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:13:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-30 00:13:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2018-01-30 00:13:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 00:13:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-01-30 00:13:26,173 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 61 [2018-01-30 00:13:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:26,173 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-01-30 00:13:26,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:13:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-01-30 00:13:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 00:13:26,174 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:26,174 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:13:26,174 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash 371948099, now seen corresponding path program 4 times [2018-01-30 00:13:26,174 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:26,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:26,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:26,175 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:26,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:26,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:26,375 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:13:26,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:26,375 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:13:26,380 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:13:26,400 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:26,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:26,452 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:13:26,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:26,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:13:26,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:13:26,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:26,489 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:13:26,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:26,505 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:13:26,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:13:26,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:26,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:26,572 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:13:26,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:26,587 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:13:26,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:25 [2018-01-30 00:13:26,723 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:13:26,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:26,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-30 00:13:26,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:13:26,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:13:26,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:13:26,741 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 21 states. [2018-01-30 00:13:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:27,287 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-30 00:13:27,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:13:27,287 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-01-30 00:13:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:27,288 INFO L225 Difference]: With dead ends: 145 [2018-01-30 00:13:27,288 INFO L226 Difference]: Without dead ends: 114 [2018-01-30 00:13:27,289 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:13:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-30 00:13:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-01-30 00:13:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-30 00:13:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-01-30 00:13:27,294 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 84 [2018-01-30 00:13:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:27,295 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-01-30 00:13:27,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:13:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-01-30 00:13:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 00:13:27,296 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:27,296 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:13:27,296 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash -23451747, now seen corresponding path program 1 times [2018-01-30 00:13:27,296 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:27,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:27,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:27,297 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:27,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:27,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:27,424 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:13:27,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:27,424 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:13:27,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:27,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:27,463 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:13:27,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:27,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-01-30 00:13:27,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:13:27,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:13:27,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:13:27,481 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 12 states. [2018-01-30 00:13:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:27,675 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-01-30 00:13:27,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:13:27,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-01-30 00:13:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:27,676 INFO L225 Difference]: With dead ends: 156 [2018-01-30 00:13:27,676 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 00:13:27,676 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:13:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 00:13:27,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-01-30 00:13:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-30 00:13:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-01-30 00:13:27,682 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 99 [2018-01-30 00:13:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:27,683 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-01-30 00:13:27,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:13:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-01-30 00:13:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 00:13:27,684 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:27,684 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:13:27,684 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:27,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1020520459, now seen corresponding path program 2 times [2018-01-30 00:13:27,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:27,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:27,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:27,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:27,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:27,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:27,848 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:13:27,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:27,848 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:13:27,853 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:13:27,861 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:27,873 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:27,880 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:27,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:27,895 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:13:27,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:27,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-01-30 00:13:27,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:13:27,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:13:27,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:13:27,913 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 13 states. [2018-01-30 00:13:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:28,057 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-01-30 00:13:28,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:13:28,057 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2018-01-30 00:13:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:28,058 INFO L225 Difference]: With dead ends: 162 [2018-01-30 00:13:28,058 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 00:13:28,058 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:13:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 00:13:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-01-30 00:13:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 00:13:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-01-30 00:13:28,066 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 105 [2018-01-30 00:13:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:28,066 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-01-30 00:13:28,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:13:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-01-30 00:13:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 00:13:28,067 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:28,067 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:13:28,067 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash 497968717, now seen corresponding path program 3 times [2018-01-30 00:13:28,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:28,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:28,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:28,068 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:28,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:28,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:28,277 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:13:28,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:28,277 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:13:28,283 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:13:28,287 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:28,307 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:28,320 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:28,333 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:28,346 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:28,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:28,452 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:13:28,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:28,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 16 [2018-01-30 00:13:28,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:13:28,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:13:28,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:13:28,470 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 16 states. [2018-01-30 00:13:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:28,574 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-01-30 00:13:28,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:13:28,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 111 [2018-01-30 00:13:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:28,575 INFO L225 Difference]: With dead ends: 197 [2018-01-30 00:13:28,575 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 00:13:28,575 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:13:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 00:13:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2018-01-30 00:13:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-30 00:13:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2018-01-30 00:13:28,589 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 111 [2018-01-30 00:13:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:28,589 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2018-01-30 00:13:28,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:13:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2018-01-30 00:13:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-30 00:13:28,590 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:28,591 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:13:28,591 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1289805920, now seen corresponding path program 4 times [2018-01-30 00:13:28,591 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:28,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:28,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:28,591 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:28,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:28,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:28,773 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:13:28,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:28,773 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:13:28,777 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:13:28,788 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:28,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:29,023 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:13:29,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:29,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:13:29,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:13:29,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:29,057 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:13:29,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:29,061 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:13:29,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:13:29,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:29,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:29,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:29,111 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:13:29,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:29,123 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:13:29,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:30 [2018-01-30 00:13:33,413 WARN L143 SmtUtils]: Spent 2063ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-30 00:13:35,480 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 30 [2018-01-30 00:13:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 4 proven. 511 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-01-30 00:13:35,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:35,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 41 [2018-01-30 00:13:35,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 00:13:35,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 00:13:35,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1314, Unknown=1, NotChecked=0, Total=1640 [2018-01-30 00:13:35,591 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 41 states. [2018-01-30 00:13:38,779 WARN L143 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-30 00:13:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:39,126 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-01-30 00:13:39,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 00:13:39,126 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 134 [2018-01-30 00:13:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:39,127 INFO L225 Difference]: With dead ends: 213 [2018-01-30 00:13:39,127 INFO L226 Difference]: Without dead ends: 170 [2018-01-30 00:13:39,128 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=585, Invalid=2836, Unknown=1, NotChecked=0, Total=3422 [2018-01-30 00:13:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-30 00:13:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 152. [2018-01-30 00:13:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-30 00:13:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2018-01-30 00:13:39,136 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 134 [2018-01-30 00:13:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:39,137 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2018-01-30 00:13:39,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 00:13:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2018-01-30 00:13:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-30 00:13:39,138 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:39,138 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:13:39,138 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:39,138 INFO L82 PathProgramCache]: Analyzing trace with hash -792202016, now seen corresponding path program 5 times [2018-01-30 00:13:39,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:39,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:39,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:39,139 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:39,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:39,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:39,288 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:13:39,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:39,288 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:13:39,293 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:13:39,297 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,298 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,299 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,300 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,300 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,301 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,303 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,304 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,305 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,307 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,308 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,310 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,313 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,316 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,320 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,328 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:39,328 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:39,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:39,343 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:13:39,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:39,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-01-30 00:13:39,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 00:13:39,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 00:13:39,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:13:39,361 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 18 states. [2018-01-30 00:13:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:39,468 INFO L93 Difference]: Finished difference Result 220 states and 227 transitions. [2018-01-30 00:13:39,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:13:39,468 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2018-01-30 00:13:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:39,469 INFO L225 Difference]: With dead ends: 220 [2018-01-30 00:13:39,469 INFO L226 Difference]: Without dead ends: 168 [2018-01-30 00:13:39,470 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:13:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-30 00:13:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2018-01-30 00:13:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-30 00:13:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2018-01-30 00:13:39,474 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 149 [2018-01-30 00:13:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:39,474 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2018-01-30 00:13:39,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 00:13:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2018-01-30 00:13:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-01-30 00:13:39,475 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:39,475 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:13:39,475 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:39,476 INFO L82 PathProgramCache]: Analyzing trace with hash 315629368, now seen corresponding path program 6 times [2018-01-30 00:13:39,476 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:39,476 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:39,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:39,476 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:39,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:39,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:39,622 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:13:39,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:39,623 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:13:39,628 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:13:39,633 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:13:39,634 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:13:39,636 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:13:39,637 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:13:39,639 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:13:39,640 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:13:39,642 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:13:39,644 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:13:39,646 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:13:39,646 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:39,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:39,717 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:13:39,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:39,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 21 [2018-01-30 00:13:39,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:13:39,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:13:39,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:13:39,735 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 21 states. [2018-01-30 00:13:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:39,883 INFO L93 Difference]: Finished difference Result 255 states and 267 transitions. [2018-01-30 00:13:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:13:39,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 155 [2018-01-30 00:13:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:39,884 INFO L225 Difference]: With dead ends: 255 [2018-01-30 00:13:39,884 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 00:13:39,884 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:13:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 00:13:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 181. [2018-01-30 00:13:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-30 00:13:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 184 transitions. [2018-01-30 00:13:39,889 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 184 transitions. Word has length 155 [2018-01-30 00:13:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:39,889 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 184 transitions. [2018-01-30 00:13:39,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:13:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 184 transitions. [2018-01-30 00:13:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-30 00:13:39,890 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:39,891 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:13:39,891 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1346571483, now seen corresponding path program 7 times [2018-01-30 00:13:39,891 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:39,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:39,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:39,891 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:39,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:39,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:40,097 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:13:40,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:40,098 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:13:40,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:40,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:40,135 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:13:40,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:40,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-01-30 00:13:40,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:13:40,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:13:40,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:13:40,153 INFO L87 Difference]: Start difference. First operand 181 states and 184 transitions. Second operand 22 states. [2018-01-30 00:13:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:40,262 INFO L93 Difference]: Finished difference Result 254 states and 261 transitions. [2018-01-30 00:13:40,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:13:40,262 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2018-01-30 00:13:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:40,263 INFO L225 Difference]: With dead ends: 254 [2018-01-30 00:13:40,263 INFO L226 Difference]: Without dead ends: 197 [2018-01-30 00:13:40,263 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:13:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-30 00:13:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2018-01-30 00:13:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:13:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 190 transitions. [2018-01-30 00:13:40,268 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 190 transitions. Word has length 178 [2018-01-30 00:13:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:40,268 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 190 transitions. [2018-01-30 00:13:40,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:13:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 190 transitions. [2018-01-30 00:13:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 00:13:40,269 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:40,269 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:13:40,269 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 985538947, now seen corresponding path program 8 times [2018-01-30 00:13:40,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:40,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:40,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:40,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:40,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:40,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:40,743 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:13:40,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:40,744 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:13:40,748 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:13:40,753 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:40,763 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:13:40,765 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:40,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:40,784 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:13:40,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:40,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-01-30 00:13:40,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 00:13:40,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 00:13:40,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:13:40,802 INFO L87 Difference]: Start difference. First operand 187 states and 190 transitions. Second operand 23 states. [2018-01-30 00:13:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:40,912 INFO L93 Difference]: Finished difference Result 260 states and 267 transitions. [2018-01-30 00:13:40,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:13:40,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 184 [2018-01-30 00:13:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:40,913 INFO L225 Difference]: With dead ends: 260 [2018-01-30 00:13:40,913 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 00:13:40,914 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:13:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 00:13:40,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 193. [2018-01-30 00:13:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-30 00:13:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 196 transitions. [2018-01-30 00:13:40,918 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 196 transitions. Word has length 184 [2018-01-30 00:13:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:40,919 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 196 transitions. [2018-01-30 00:13:40,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 00:13:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 196 transitions. [2018-01-30 00:13:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-30 00:13:40,919 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:40,919 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:13:40,919 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash -793700309, now seen corresponding path program 9 times [2018-01-30 00:13:40,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:40,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:40,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:40,920 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:40,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:40,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:41,185 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:13:41,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:41,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 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:13:41,190 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:13:41,195 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:41,197 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:41,200 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:41,202 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:41,204 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:41,206 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:13:41,206 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:41,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:41,253 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:13:41,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:41,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 27 [2018-01-30 00:13:41,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:13:41,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:13:41,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:13:41,270 INFO L87 Difference]: Start difference. First operand 193 states and 196 transitions. Second operand 27 states. [2018-01-30 00:13:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:41,487 INFO L93 Difference]: Finished difference Result 306 states and 320 transitions. [2018-01-30 00:13:41,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 00:13:41,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 190 [2018-01-30 00:13:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:41,489 INFO L225 Difference]: With dead ends: 306 [2018-01-30 00:13:41,489 INFO L226 Difference]: Without dead ends: 249 [2018-01-30 00:13:41,490 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:13:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-30 00:13:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 222. [2018-01-30 00:13:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-30 00:13:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 225 transitions. [2018-01-30 00:13:41,495 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 225 transitions. Word has length 190 [2018-01-30 00:13:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:41,496 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 225 transitions. [2018-01-30 00:13:41,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:13:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 225 transitions. [2018-01-30 00:13:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-01-30 00:13:41,496 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:41,496 INFO L350 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 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:13:41,496 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:13:41,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1876637488, now seen corresponding path program 10 times [2018-01-30 00:13:41,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:41,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:41,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:41,497 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:13:41,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:41,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 4 proven. 1850 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-01-30 00:13:42,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:42,063 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:13:42,068 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:13:42,084 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:13:42,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:42,344 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:13:42,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:42,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:13:42,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:13:42,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,385 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:13:42,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:42,391 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:13:42,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:13:42,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,450 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:13:42,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:42,458 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:13:42,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:30 [2018-01-30 00:13:42,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:42,545 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:13:42,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:42,557 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:13:42,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:42 [2018-01-30 00:13:44,780 WARN L143 SmtUtils]: Spent 2044ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-30 00:13:45,932 WARN L143 SmtUtils]: Spent 960ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-30 00:13:48,054 WARN L143 SmtUtils]: Spent 2045ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-30 00:13:48,809 WARN L143 SmtUtils]: Spent 619ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-30 00:13:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 14 proven. 1651 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-01-30 00:13:48,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:48,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 37] total 63 [2018-01-30 00:13:48,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-01-30 00:13:48,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-01-30 00:13:48,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=3073, Unknown=2, NotChecked=0, Total=3906 [2018-01-30 00:13:48,932 INFO L87 Difference]: Start difference. First operand 222 states and 225 transitions. Second operand 63 states. [2018-01-30 00:13:57,375 WARN L143 SmtUtils]: Spent 2087ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-30 00:13:58,297 WARN L143 SmtUtils]: Spent 278ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-30 00:14:00,790 WARN L143 SmtUtils]: Spent 2077ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-30 00:14:03,049 WARN L143 SmtUtils]: Spent 2071ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-30 00:14:03,775 WARN L143 SmtUtils]: Spent 197ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-30 00:14:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:04,628 INFO L93 Difference]: Finished difference Result 329 states and 343 transitions. [2018-01-30 00:14:04,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-30 00:14:04,628 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 219 [2018-01-30 00:14:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:04,629 INFO L225 Difference]: With dead ends: 329 [2018-01-30 00:14:04,629 INFO L226 Difference]: Without dead ends: 267 [2018-01-30 00:14:04,631 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3045 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1493, Invalid=7623, Unknown=4, NotChecked=0, Total=9120 [2018-01-30 00:14:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-01-30 00:14:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 237. [2018-01-30 00:14:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-30 00:14:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 240 transitions. [2018-01-30 00:14:04,638 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 240 transitions. Word has length 219 [2018-01-30 00:14:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:04,638 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 240 transitions. [2018-01-30 00:14:04,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-01-30 00:14:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 240 transitions. [2018-01-30 00:14:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-01-30 00:14:04,639 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:04,639 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:14:04,639 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash -994955872, now seen corresponding path program 11 times [2018-01-30 00:14:04,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:04,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:04,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:04,639 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:04,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:04,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:05,130 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:14:05,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:05,131 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:14:05,135 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:14:05,140 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,141 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,142 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,142 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,143 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,144 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,145 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,147 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,148 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,149 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,151 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,153 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,155 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,157 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,159 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,162 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,165 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,168 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,172 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,176 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,181 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,186 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,192 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,199 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,207 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,216 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,238 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:05,239 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:05,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-01-30 00:14:05,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:05,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-01-30 00:14:05,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 00:14:05,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 00:14:05,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:14:05,286 INFO L87 Difference]: Start difference. First operand 237 states and 240 transitions. Second operand 29 states. [2018-01-30 00:14:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:05,660 INFO L93 Difference]: Finished difference Result 324 states and 331 transitions. [2018-01-30 00:14:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 00:14:05,661 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2018-01-30 00:14:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:05,661 INFO L225 Difference]: With dead ends: 324 [2018-01-30 00:14:05,661 INFO L226 Difference]: Without dead ends: 253 [2018-01-30 00:14:05,662 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:14:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-01-30 00:14:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2018-01-30 00:14:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-30 00:14:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 246 transitions. [2018-01-30 00:14:05,671 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 246 transitions. Word has length 234 [2018-01-30 00:14:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:05,671 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 246 transitions. [2018-01-30 00:14:05,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 00:14:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 246 transitions. [2018-01-30 00:14:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-30 00:14:05,672 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:05,672 INFO L350 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 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:14:05,679 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1007102536, now seen corresponding path program 12 times [2018-01-30 00:14:05,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:05,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:05,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:05,680 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:05,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:05,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2289 backedges. 6 proven. 2160 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-01-30 00:14:06,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:06,209 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:14:06,213 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:14:06,220 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,221 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,222 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,224 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,226 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,227 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,230 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,232 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,233 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,237 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,239 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,241 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,244 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:06,245 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:06,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2289 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2202 trivial. 0 not checked. [2018-01-30 00:14:06,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:06,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 9] total 33 [2018-01-30 00:14:06,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:14:06,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:14:06,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:14:06,355 INFO L87 Difference]: Start difference. First operand 243 states and 246 transitions. Second operand 33 states. [2018-01-30 00:14:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:06,634 INFO L93 Difference]: Finished difference Result 370 states and 384 transitions. [2018-01-30 00:14:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 00:14:06,634 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 240 [2018-01-30 00:14:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:06,635 INFO L225 Difference]: With dead ends: 370 [2018-01-30 00:14:06,635 INFO L226 Difference]: Without dead ends: 299 [2018-01-30 00:14:06,636 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:14:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-01-30 00:14:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 272. [2018-01-30 00:14:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-30 00:14:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2018-01-30 00:14:06,643 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 240 [2018-01-30 00:14:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:06,643 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2018-01-30 00:14:06,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:14:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2018-01-30 00:14:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-01-30 00:14:06,644 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:06,644 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:14:06,644 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1007040851, now seen corresponding path program 13 times [2018-01-30 00:14:06,644 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:06,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:06,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:06,645 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:06,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:06,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:07,380 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:14:07,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:07,381 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:07,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:07,409 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3013 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 00:14:07,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:07,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-01-30 00:14:07,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 00:14:07,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 00:14:07,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 00:14:07,466 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand 34 states. [2018-01-30 00:14:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:08,413 INFO L93 Difference]: Finished difference Result 369 states and 377 transitions. [2018-01-30 00:14:08,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 00:14:08,413 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 269 [2018-01-30 00:14:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:08,414 INFO L225 Difference]: With dead ends: 369 [2018-01-30 00:14:08,414 INFO L226 Difference]: Without dead ends: 293 [2018-01-30 00:14:08,415 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 00:14:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-01-30 00:14:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 278. [2018-01-30 00:14:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-01-30 00:14:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2018-01-30 00:14:08,421 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 269 [2018-01-30 00:14:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:08,422 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2018-01-30 00:14:08,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 00:14:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2018-01-30 00:14:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-30 00:14:08,422 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:08,423 INFO L350 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 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:14:08,423 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:08,423 INFO L82 PathProgramCache]: Analyzing trace with hash -249542395, now seen corresponding path program 14 times [2018-01-30 00:14:08,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:08,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:08,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:08,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:08,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:08,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 6 proven. 3040 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-01-30 00:14:09,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:09,042 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:14:09,047 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:14:09,055 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:09,074 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:09,076 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:09,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 00:14:09,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:09,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-01-30 00:14:09,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-30 00:14:09,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-30 00:14:09,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 00:14:09,135 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 35 states. [2018-01-30 00:14:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:09,341 INFO L93 Difference]: Finished difference Result 375 states and 383 transitions. [2018-01-30 00:14:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 00:14:09,342 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 275 [2018-01-30 00:14:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:09,343 INFO L225 Difference]: With dead ends: 375 [2018-01-30 00:14:09,343 INFO L226 Difference]: Without dead ends: 299 [2018-01-30 00:14:09,343 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 00:14:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-01-30 00:14:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 284. [2018-01-30 00:14:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-30 00:14:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 287 transitions. [2018-01-30 00:14:09,350 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 287 transitions. Word has length 275 [2018-01-30 00:14:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:09,350 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 287 transitions. [2018-01-30 00:14:09,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-30 00:14:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 287 transitions. [2018-01-30 00:14:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-01-30 00:14:09,351 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:09,351 INFO L350 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 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:14:09,351 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:09,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1124182365, now seen corresponding path program 15 times [2018-01-30 00:14:09,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:09,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:09,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:09,352 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:09,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:09,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3395 backedges. 6 proven. 3234 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-01-30 00:14:09,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:09,837 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:14:09,842 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:14:09,848 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:09,856 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:09,859 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:09,862 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:09,864 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:09,866 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:09,868 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:09,871 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:09,872 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:09,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3395 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 3276 trivial. 0 not checked. [2018-01-30 00:14:09,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:09,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 10] total 39 [2018-01-30 00:14:09,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:14:09,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:14:09,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:14:09,980 INFO L87 Difference]: Start difference. First operand 284 states and 287 transitions. Second operand 39 states. [2018-01-30 00:14:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:10,196 INFO L93 Difference]: Finished difference Result 421 states and 436 transitions. [2018-01-30 00:14:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 00:14:10,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 281 [2018-01-30 00:14:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:10,200 INFO L225 Difference]: With dead ends: 421 [2018-01-30 00:14:10,200 INFO L226 Difference]: Without dead ends: 345 [2018-01-30 00:14:10,200 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:14:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-30 00:14:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 313. [2018-01-30 00:14:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-01-30 00:14:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 316 transitions. [2018-01-30 00:14:10,210 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 316 transitions. Word has length 281 [2018-01-30 00:14:10,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:10,210 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 316 transitions. [2018-01-30 00:14:10,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:14:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 316 transitions. [2018-01-30 00:14:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-01-30 00:14:10,211 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:10,211 INFO L350 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 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:14:10,211 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash 915815928, now seen corresponding path program 16 times [2018-01-30 00:14:10,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:10,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:10,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:10,212 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:10,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:10,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4268 backedges. 6 proven. 4070 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-01-30 00:14:10,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:10,812 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:10,817 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:14:10,846 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:10,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:11,257 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:14:11,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:11,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:14:11,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:14:11,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:11,303 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:14:11,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:11,307 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:14:11,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:14:11,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:11,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:11,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:11,530 INFO L303 Elim1Store]: Index analysis took 159 ms [2018-01-30 00:14:11,530 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:14:11,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:11,695 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:14:11,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:30 [2018-01-30 00:14:12,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:12,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:12,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:12,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:12,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:12,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:12,392 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:14:12,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:12,406 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:14:12,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:42 [2018-01-30 00:14:13,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:13,416 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:14:13,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:13,461 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:14:13,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:55, output treesize:54 [2018-01-30 00:14:26,398 WARN L143 SmtUtils]: Spent 2119ms on a formula simplification that was a NOOP. DAG size: 48 [2018-01-30 00:14:30,967 WARN L143 SmtUtils]: Spent 2038ms on a formula simplification that was a NOOP. DAG size: 45 [2018-01-30 00:14:33,793 WARN L143 SmtUtils]: Spent 291ms on a formula simplification that was a NOOP. DAG size: 46 [2018-01-30 00:14:36,631 WARN L143 SmtUtils]: Spent 326ms on a formula simplification that was a NOOP. DAG size: 45 [2018-01-30 00:14:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4268 backedges. 29 proven. 3573 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-01-30 00:14:36,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:36,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 49] total 87 [2018-01-30 00:14:36,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-01-30 00:14:36,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-01-30 00:14:36,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1670, Invalid=5801, Unknown=11, NotChecked=0, Total=7482 [2018-01-30 00:14:36,847 INFO L87 Difference]: Start difference. First operand 313 states and 316 transitions. Second operand 87 states. Received shutdown request... [2018-01-30 00:14:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-30 00:14:40,880 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:14:40,883 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:14:40,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:14:40 BoogieIcfgContainer [2018-01-30 00:14:40,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:14:40,884 INFO L168 Benchmark]: Toolchain (without parser) took 77025.22 ms. Allocated memory was 151.5 MB in the beginning and 537.9 MB in the end (delta: 386.4 MB). Free memory was 116.7 MB in the beginning and 341.7 MB in the end (delta: -225.1 MB). Peak memory consumption was 161.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:14:40,884 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 151.5 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:14:40,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 109.49 ms. Allocated memory is still 151.5 MB. Free memory was 116.5 MB in the beginning and 108.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:14:40,885 INFO L168 Benchmark]: Boogie Preprocessor took 17.22 ms. Allocated memory is still 151.5 MB. Free memory was 108.2 MB in the beginning and 106.9 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:14:40,885 INFO L168 Benchmark]: RCFGBuilder took 295.51 ms. Allocated memory is still 151.5 MB. Free memory was 106.6 MB in the beginning and 94.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:14:40,885 INFO L168 Benchmark]: TraceAbstraction took 76600.91 ms. Allocated memory was 151.5 MB in the beginning and 537.9 MB in the end (delta: 386.4 MB). Free memory was 94.7 MB in the beginning and 341.7 MB in the end (delta: -247.0 MB). Peak memory consumption was 139.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:14:40,886 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 151.5 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 109.49 ms. Allocated memory is still 151.5 MB. Free memory was 116.5 MB in the beginning and 108.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.22 ms. Allocated memory is still 151.5 MB. Free memory was 108.2 MB in the beginning and 106.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 295.51 ms. Allocated memory is still 151.5 MB. Free memory was 106.6 MB in the beginning and 94.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76600.91 ms. Allocated memory was 151.5 MB in the beginning and 537.9 MB in the end (delta: 386.4 MB). Free memory was 94.7 MB in the beginning and 341.7 MB in the end (delta: -247.0 MB). Peak memory consumption was 139.4 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 (313states) and interpolant automaton (currently 51 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 107 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. TIMEOUT Result, 76.5s OverallTime, 23 OverallIterations, 38 TraceHistogramMax, 27.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 890 SDtfs, 2883 SDslu, 12074 SDs, 0 SdLazy, 12235 SolverSat, 574 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3902 GetRequests, 3290 SyntacticMatches, 0 SemanticMatches, 611 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 57.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred 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, 337 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 46.8s InterpolantComputationTime, 6836 NumberOfCodeBlocks, 6173 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 6792 ConstructedInterpolants, 101 QuantifiedInterpolants, 4419542 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3953 ConjunctsInSsa, 451 ConjunctsInUnsatCore, 44 InterpolantComputations, 3 PerfectInterpolantSequences, 11584/54968 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_07_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-14-40-890.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_two_index_07_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-14-40-890.csv Completed graceful shutdown