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_08_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 00:14:42,903 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:14:42,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:14:42,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:14:42,917 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:14:42,917 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:14:42,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:14:42,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:14:42,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:14:42,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:14:42,921 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:14:42,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:14:42,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:14:42,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:14:42,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:14:42,924 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:14:42,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:14:42,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:14:42,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:14:42,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:14:42,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:14:42,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:14:42,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:14:42,929 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:14:42,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:14:42,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:14:42,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:14:42,931 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:14:42,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:14:42,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:14:42,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:14:42,931 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:14:42,936 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:14:42,936 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:14:42,937 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:14:42,937 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:14:42,937 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:14:42,937 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:14:42,937 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:14:42,937 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:14:42,937 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:14:42,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:14:42,938 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:14:42,938 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:14:42,938 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 00:14:42,938 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:14:42,938 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 00:14:42,938 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:14:42,938 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 00:14:42,938 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 00:14:42,938 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:14:42,939 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:14:42,939 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:14:42,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:14:42,940 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:14:42,940 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:14:42,940 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:14:42,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:14:42,965 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:14:42,967 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:14:42,968 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:14:42,968 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:14:42,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_08_true-unreach-call.i [2018-01-30 00:14:43,031 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:14:43,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:14:43,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:14:43,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:14:43,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:14:43,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:14:43" (1/1) ... [2018-01-30 00:14:43,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1b5fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43, skipping insertion in model container [2018-01-30 00:14:43,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:14:43" (1/1) ... [2018-01-30 00:14:43,048 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:14:43,057 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:14:43,131 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:14:43,139 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:14:43,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43 WrapperNode [2018-01-30 00:14:43,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:14:43,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:14:43,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:14:43,143 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:14:43,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43" (1/1) ... [2018-01-30 00:14:43,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43" (1/1) ... [2018-01-30 00:14:43,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43" (1/1) ... [2018-01-30 00:14:43,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43" (1/1) ... [2018-01-30 00:14:43,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43" (1/1) ... [2018-01-30 00:14:43,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43" (1/1) ... [2018-01-30 00:14:43,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43" (1/1) ... [2018-01-30 00:14:43,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:14:43,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:14:43,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:14:43,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:14:43,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43" (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:14:43,201 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:14:43,201 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:14:43,201 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 00:14:43,201 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:14:43,201 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:14:43,201 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 00:14:43,201 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:14:43,201 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:14:43,201 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:14:43,202 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:14:43,461 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:14:43,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:14:43 BoogieIcfgContainer [2018-01-30 00:14:43,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:14:43,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:14:43,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:14:43,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:14:43,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:14:43" (1/3) ... [2018-01-30 00:14:43,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2079cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:14:43, skipping insertion in model container [2018-01-30 00:14:43,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:14:43" (2/3) ... [2018-01-30 00:14:43,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2079cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:14:43, skipping insertion in model container [2018-01-30 00:14:43,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:14:43" (3/3) ... [2018-01-30 00:14:43,466 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_two_index_08_true-unreach-call.i [2018-01-30 00:14:43,471 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:14:43,475 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 00:14:43,499 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:14:43,499 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:14:43,499 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:14:43,499 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:14:43,499 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:14:43,499 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:14:43,499 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:14:43,499 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:14:43,500 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:14:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-30 00:14:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 00:14:43,514 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:43,515 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:14:43,515 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:43,518 INFO L82 PathProgramCache]: Analyzing trace with hash 956793125, now seen corresponding path program 1 times [2018-01-30 00:14:43,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:43,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:43,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:43,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:43,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:43,568 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:43,583 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:14:43,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:14:43,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:14:43,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:14:43,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:14:43,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:14:43,595 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-01-30 00:14:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:43,607 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-01-30 00:14:43,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:14:43,608 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-30 00:14:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:43,614 INFO L225 Difference]: With dead ends: 62 [2018-01-30 00:14:43,614 INFO L226 Difference]: Without dead ends: 33 [2018-01-30 00:14:43,616 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:14:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-30 00:14:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-30 00:14:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-30 00:14:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-30 00:14:43,636 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-01-30 00:14:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:43,637 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-30 00:14:43,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:14:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-30 00:14:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:14:43,637 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:43,637 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:14:43,637 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1648000248, now seen corresponding path program 1 times [2018-01-30 00:14:43,638 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:43,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:43,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:43,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:43,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:43,644 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:43,671 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:14:43,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:14:43,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:14:43,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:14:43,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:14:43,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:14:43,683 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-01-30 00:14:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:43,766 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-30 00:14:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:14:43,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-30 00:14:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:43,780 INFO L225 Difference]: With dead ends: 58 [2018-01-30 00:14:43,780 INFO L226 Difference]: Without dead ends: 39 [2018-01-30 00:14:43,781 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:14:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-30 00:14:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-01-30 00:14:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-30 00:14:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-30 00:14:43,789 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2018-01-30 00:14:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:43,790 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-30 00:14:43,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:14:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-30 00:14:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:14:43,790 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:43,790 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:14:43,790 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:43,790 INFO L82 PathProgramCache]: Analyzing trace with hash -549443760, now seen corresponding path program 1 times [2018-01-30 00:14:43,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:43,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:43,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:43,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:43,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:43,802 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:43,863 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:14:43,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:43,863 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:14:43,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:43,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:43,958 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:14:43,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:14:43,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-01-30 00:14:43,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:14:43,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:14:43,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:14:43,976 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-01-30 00:14:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:44,133 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-01-30 00:14:44,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:14:44,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-30 00:14:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:44,135 INFO L225 Difference]: With dead ends: 72 [2018-01-30 00:14:44,135 INFO L226 Difference]: Without dead ends: 53 [2018-01-30 00:14:44,135 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:14:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-30 00:14:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-01-30 00:14:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 00:14:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-30 00:14:44,140 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 27 [2018-01-30 00:14:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:44,141 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-30 00:14:44,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:14:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-30 00:14:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:14:44,141 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:44,141 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:14:44,142 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1872906445, now seen corresponding path program 1 times [2018-01-30 00:14:44,142 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:44,142 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:44,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:44,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:44,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:44,150 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:44,192 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:14:44,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:44,192 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) [2018-01-30 00:14:44,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:14:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:44,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:44,234 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:14:44,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:44,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2018-01-30 00:14:44,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:14:44,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:14:44,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:14:44,251 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-30 00:14:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:44,425 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-01-30 00:14:44,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:14:44,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-30 00:14:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:44,426 INFO L225 Difference]: With dead ends: 96 [2018-01-30 00:14:44,426 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 00:14:44,426 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:14:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 00:14:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2018-01-30 00:14:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-30 00:14:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-30 00:14:44,430 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 38 [2018-01-30 00:14:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:44,430 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-30 00:14:44,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:14:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-30 00:14:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 00:14:44,431 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:44,431 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:14:44,431 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash 936426808, now seen corresponding path program 2 times [2018-01-30 00:14:44,431 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:44,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:44,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:44,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:44,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:44,444 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:44,576 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:14:44,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:44,576 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:14:44,590 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:14:44,596 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:44,600 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:44,601 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:44,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:44,608 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:14:44,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:44,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 00:14:44,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:14:44,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:14:44,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:14:44,626 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 7 states. [2018-01-30 00:14:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:44,775 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-01-30 00:14:44,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:14:44,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-01-30 00:14:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:44,776 INFO L225 Difference]: With dead ends: 100 [2018-01-30 00:14:44,776 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 00:14:44,777 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:14:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 00:14:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-01-30 00:14:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 00:14:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-01-30 00:14:44,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 55 [2018-01-30 00:14:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:44,781 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-01-30 00:14:44,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:14:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-01-30 00:14:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 00:14:44,782 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:44,782 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:14:44,782 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2104349072, now seen corresponding path program 3 times [2018-01-30 00:14:44,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:44,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:44,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:44,784 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:44,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:44,801 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:44,956 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:14:44,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:44,956 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:14:44,966 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:14:44,971 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:44,979 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:44,989 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:44,997 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:44,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:45,148 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:14:45,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:45,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-01-30 00:14:45,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:14:45,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:14:45,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:14:45,167 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 10 states. [2018-01-30 00:14:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:45,347 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2018-01-30 00:14:45,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:14:45,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-01-30 00:14:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:45,347 INFO L225 Difference]: With dead ends: 135 [2018-01-30 00:14:45,348 INFO L226 Difference]: Without dead ends: 109 [2018-01-30 00:14:45,348 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:14:45,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-30 00:14:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2018-01-30 00:14:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 00:14:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-01-30 00:14:45,352 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 61 [2018-01-30 00:14:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:45,352 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-01-30 00:14:45,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:14:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-01-30 00:14:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 00:14:45,353 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:45,353 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:14:45,353 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash 371948099, now seen corresponding path program 4 times [2018-01-30 00:14:45,353 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:45,353 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:45,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:45,354 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:45,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:45,366 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:45,559 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:14:45,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:45,559 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:14:45,564 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:14:45,592 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:45,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:45,639 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:45,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:45,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:14:45,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:14:45,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:45,672 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:45,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:45,690 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:45,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:14:45,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:45,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:45,754 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:14:45,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:45,763 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:45,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:25 [2018-01-30 00:14:45,968 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:14:45,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:45,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-30 00:14:45,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:14:45,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:14:45,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:14:45,986 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 21 states. [2018-01-30 00:14:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:46,418 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-30 00:14:46,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:14:46,418 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-01-30 00:14:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:46,419 INFO L225 Difference]: With dead ends: 145 [2018-01-30 00:14:46,419 INFO L226 Difference]: Without dead ends: 114 [2018-01-30 00:14:46,420 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:14:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-30 00:14:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-01-30 00:14:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-30 00:14:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-01-30 00:14:46,425 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 84 [2018-01-30 00:14:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:46,425 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-01-30 00:14:46,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:14:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-01-30 00:14:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 00:14:46,426 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:46,426 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:14:46,426 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash -23451747, now seen corresponding path program 1 times [2018-01-30 00:14:46,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:46,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:46,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:46,427 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:46,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:46,440 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:46,593 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:14:46,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:46,593 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:14:46,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:46,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:46,620 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:14:46,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:46,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-01-30 00:14:46,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:14:46,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:14:46,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:14:46,638 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 12 states. [2018-01-30 00:14:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:46,710 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-01-30 00:14:46,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:14:46,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-01-30 00:14:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:46,727 INFO L225 Difference]: With dead ends: 156 [2018-01-30 00:14:46,727 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 00:14:46,727 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:14:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 00:14:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-01-30 00:14:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-30 00:14:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-01-30 00:14:46,748 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 99 [2018-01-30 00:14:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:46,748 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-01-30 00:14:46,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:14:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-01-30 00:14:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 00:14:46,749 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:46,749 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:14:46,749 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:46,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1020520459, now seen corresponding path program 2 times [2018-01-30 00:14:46,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:46,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:46,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:46,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:46,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:46,759 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:46,888 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:14:46,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:46,889 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:14:46,894 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:14:46,899 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:46,918 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:46,925 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:46,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:46,937 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:14:46,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:46,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-01-30 00:14:46,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:14:46,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:14:46,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:14:46,964 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 13 states. [2018-01-30 00:14:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:47,269 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-01-30 00:14:47,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:14:47,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2018-01-30 00:14:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:47,270 INFO L225 Difference]: With dead ends: 162 [2018-01-30 00:14:47,270 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 00:14:47,271 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:14:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 00:14:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-01-30 00:14:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 00:14:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-01-30 00:14:47,282 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 105 [2018-01-30 00:14:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:47,282 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-01-30 00:14:47,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:14:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-01-30 00:14:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 00:14:47,283 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:47,283 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:14:47,283 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash 497968717, now seen corresponding path program 3 times [2018-01-30 00:14:47,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:47,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:47,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:47,284 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:47,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:47,298 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:47,462 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:14:47,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:47,464 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:47,469 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:14:47,482 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:47,485 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:47,486 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:47,503 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:47,505 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:47,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:47,536 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:14:47,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:47,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 16 [2018-01-30 00:14:47,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:14:47,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:14:47,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:14:47,554 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 16 states. [2018-01-30 00:14:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:48,071 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-01-30 00:14:48,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:14:48,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 111 [2018-01-30 00:14:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:48,072 INFO L225 Difference]: With dead ends: 197 [2018-01-30 00:14:48,072 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 00:14:48,073 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:14:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 00:14:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2018-01-30 00:14:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-30 00:14:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2018-01-30 00:14:48,084 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 111 [2018-01-30 00:14:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:48,085 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2018-01-30 00:14:48,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:14:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2018-01-30 00:14:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-30 00:14:48,086 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:48,086 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:14:48,086 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1289805920, now seen corresponding path program 4 times [2018-01-30 00:14:48,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:48,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:48,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:48,087 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:48,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:48,096 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:48,265 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:14:48,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:48,265 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:14:48,270 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:14:48,285 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:48,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:48,397 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:48,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:48,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:14:48,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:14:48,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:48,447 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:48,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:48,452 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:48,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:14:48,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:48,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:48,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:14:48,519 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:48,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:48,532 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:14:48,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:30 [2018-01-30 00:14:51,452 WARN L143 SmtUtils]: Spent 2049ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-30 00:14:53,603 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-30 00:14:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 4 proven. 543 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-30 00:14:53,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:53,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 42 [2018-01-30 00:14:53,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-30 00:14:53,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-30 00:14:53,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1389, Unknown=0, NotChecked=0, Total=1722 [2018-01-30 00:14:53,780 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 42 states. [2018-01-30 00:14:55,138 WARN L143 SmtUtils]: Spent 538ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-30 00:14:57,335 WARN L143 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-30 00:14:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:57,655 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-01-30 00:14:57,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 00:14:57,655 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 134 [2018-01-30 00:14:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:57,656 INFO L225 Difference]: With dead ends: 213 [2018-01-30 00:14:57,656 INFO L226 Difference]: Without dead ends: 170 [2018-01-30 00:14:57,657 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=569, Invalid=2853, Unknown=0, NotChecked=0, Total=3422 [2018-01-30 00:14:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-30 00:14:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 152. [2018-01-30 00:14:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-30 00:14:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2018-01-30 00:14:57,663 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 134 [2018-01-30 00:14:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:57,663 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2018-01-30 00:14:57,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-30 00:14:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2018-01-30 00:14:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-30 00:14:57,664 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:57,664 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:14:57,665 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:57,665 INFO L82 PathProgramCache]: Analyzing trace with hash -792202016, now seen corresponding path program 5 times [2018-01-30 00:14:57,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:57,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:57,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:57,665 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:57,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:57,674 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:57,856 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:14:57,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:57,856 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:14:57,861 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:14:57,885 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,886 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,899 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,900 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,901 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,902 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,903 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,906 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,907 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,909 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,910 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,912 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,915 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,918 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,922 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,930 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:57,931 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:57,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:57,944 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:14:57,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:57,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-01-30 00:14:57,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 00:14:57,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 00:14:57,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:14:57,962 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 18 states. [2018-01-30 00:14:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:58,056 INFO L93 Difference]: Finished difference Result 215 states and 221 transitions. [2018-01-30 00:14:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:14:58,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2018-01-30 00:14:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:58,057 INFO L225 Difference]: With dead ends: 215 [2018-01-30 00:14:58,057 INFO L226 Difference]: Without dead ends: 163 [2018-01-30 00:14:58,057 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:14:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-30 00:14:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-01-30 00:14:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-30 00:14:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2018-01-30 00:14:58,062 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 149 [2018-01-30 00:14:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:58,062 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2018-01-30 00:14:58,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 00:14:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2018-01-30 00:14:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-01-30 00:14:58,063 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:58,063 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:14:58,063 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash 315629368, now seen corresponding path program 6 times [2018-01-30 00:14:58,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:58,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:58,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:58,064 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:58,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:58,072 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:58,228 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:14:58,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:58,229 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:58,235 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:14:58,240 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:58,241 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:58,244 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:58,246 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:58,249 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:58,251 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:58,253 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:58,255 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:58,257 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:14:58,257 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:58,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:58,309 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:14:58,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:58,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 22 [2018-01-30 00:14:58,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:14:58,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:14:58,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:14:58,326 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 22 states. [2018-01-30 00:14:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:58,463 INFO L93 Difference]: Finished difference Result 261 states and 274 transitions. [2018-01-30 00:14:58,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:14:58,463 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 155 [2018-01-30 00:14:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:58,464 INFO L225 Difference]: With dead ends: 261 [2018-01-30 00:14:58,464 INFO L226 Difference]: Without dead ends: 209 [2018-01-30 00:14:58,464 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 153 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:14:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-30 00:14:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 187. [2018-01-30 00:14:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:14:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 190 transitions. [2018-01-30 00:14:58,469 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 190 transitions. Word has length 155 [2018-01-30 00:14:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:58,469 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 190 transitions. [2018-01-30 00:14:58,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:14:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 190 transitions. [2018-01-30 00:14:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 00:14:58,470 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:58,470 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:14:58,470 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash 985538947, now seen corresponding path program 7 times [2018-01-30 00:14:58,470 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:58,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:58,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:58,471 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:58,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:58,480 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:58,994 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:14:58,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:58,994 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:14:59,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:59,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:59,050 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:14:59,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:59,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-01-30 00:14:59,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 00:14:59,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 00:14:59,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:14:59,069 INFO L87 Difference]: Start difference. First operand 187 states and 190 transitions. Second operand 23 states. [2018-01-30 00:14:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:59,194 INFO L93 Difference]: Finished difference Result 260 states and 267 transitions. [2018-01-30 00:14:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:14:59,194 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 184 [2018-01-30 00:14:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:59,195 INFO L225 Difference]: With dead ends: 260 [2018-01-30 00:14:59,195 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 00:14:59,195 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:14:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 00:14:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 193. [2018-01-30 00:14:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-30 00:14:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 196 transitions. [2018-01-30 00:14:59,201 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 196 transitions. Word has length 184 [2018-01-30 00:14:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:59,201 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 196 transitions. [2018-01-30 00:14:59,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 00:14:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 196 transitions. [2018-01-30 00:14:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-30 00:14:59,202 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:59,202 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:14:59,202 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:59,202 INFO L82 PathProgramCache]: Analyzing trace with hash -793700309, now seen corresponding path program 8 times [2018-01-30 00:14:59,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:59,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:59,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:59,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:59,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:59,212 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:59,443 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:14:59,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:59,443 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:14:59,447 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:14:59,457 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:59,483 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:14:59,484 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:59,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-30 00:14:59,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:59,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-01-30 00:14:59,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 00:14:59,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 00:14:59,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:14:59,528 INFO L87 Difference]: Start difference. First operand 193 states and 196 transitions. Second operand 24 states. [2018-01-30 00:14:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:59,659 INFO L93 Difference]: Finished difference Result 266 states and 273 transitions. [2018-01-30 00:14:59,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 00:14:59,659 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 190 [2018-01-30 00:14:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:59,660 INFO L225 Difference]: With dead ends: 266 [2018-01-30 00:14:59,660 INFO L226 Difference]: Without dead ends: 209 [2018-01-30 00:14:59,660 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:14:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-30 00:14:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2018-01-30 00:14:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-30 00:14:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 202 transitions. [2018-01-30 00:14:59,665 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 202 transitions. Word has length 190 [2018-01-30 00:14:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:59,665 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 202 transitions. [2018-01-30 00:14:59,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 00:14:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 202 transitions. [2018-01-30 00:14:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-01-30 00:14:59,666 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:59,666 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 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:14:59,666 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:14:59,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1658162989, now seen corresponding path program 9 times [2018-01-30 00:14:59,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:59,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:59,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:59,667 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:59,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:59,674 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:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1509 backedges. 4 proven. 1430 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-01-30 00:14:59,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:59,948 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:14:59,952 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:14:59,957 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:59,959 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:59,962 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:59,964 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:59,966 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:59,968 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:14:59,968 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:14:59,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1509 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1449 trivial. 0 not checked. [2018-01-30 00:15:00,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:00,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 28 [2018-01-30 00:15:00,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 00:15:00,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 00:15:00,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:15:00,111 INFO L87 Difference]: Start difference. First operand 199 states and 202 transitions. Second operand 28 states. [2018-01-30 00:15:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:00,331 INFO L93 Difference]: Finished difference Result 312 states and 326 transitions. [2018-01-30 00:15:00,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:15:00,331 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 196 [2018-01-30 00:15:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:00,332 INFO L225 Difference]: With dead ends: 312 [2018-01-30 00:15:00,332 INFO L226 Difference]: Without dead ends: 255 [2018-01-30 00:15:00,332 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:15:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-30 00:15:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 228. [2018-01-30 00:15:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-30 00:15:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 231 transitions. [2018-01-30 00:15:00,338 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 231 transitions. Word has length 196 [2018-01-30 00:15:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:00,338 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 231 transitions. [2018-01-30 00:15:00,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 00:15:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 231 transitions. [2018-01-30 00:15:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-01-30 00:15:00,338 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:00,339 INFO L350 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 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:15:00,339 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:15:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash 240222088, now seen corresponding path program 10 times [2018-01-30 00:15:00,339 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:00,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:00,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:00,339 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:15:00,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:00,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2108 backedges. 4 proven. 2002 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-01-30 00:15:01,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:01,079 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:15:01,084 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:15:01,112 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:15:01,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:01,574 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:15:01,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:01,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:01,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:15:02,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,089 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:15:02,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:02,094 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:15:02,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:15:02,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,152 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:15:02,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:02,166 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:15:02,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:30 [2018-01-30 00:15:02,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:02,253 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:15:02,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:02,265 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:15:02,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:42 [2018-01-30 00:15:06,570 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 00:15:08,711 WARN L143 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-30 00:15:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2108 backedges. 14 proven. 1859 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-01-30 00:15:09,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:09,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2018-01-30 00:15:09,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-01-30 00:15:09,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-01-30 00:15:09,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=3386, Unknown=2, NotChecked=0, Total=4290 [2018-01-30 00:15:09,118 INFO L87 Difference]: Start difference. First operand 228 states and 231 transitions. Second operand 66 states. [2018-01-30 00:15:18,959 WARN L143 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 00:15:19,834 WARN L143 SmtUtils]: Spent 836ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-30 00:15:20,779 WARN L143 SmtUtils]: Spent 799ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-30 00:15:23,317 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-30 00:15:23,702 WARN L143 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-30 00:15:24,614 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-30 00:15:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:25,456 INFO L93 Difference]: Finished difference Result 335 states and 349 transitions. [2018-01-30 00:15:25,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-30 00:15:25,457 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 225 [2018-01-30 00:15:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:25,457 INFO L225 Difference]: With dead ends: 335 [2018-01-30 00:15:25,458 INFO L226 Difference]: Without dead ends: 273 [2018-01-30 00:15:25,459 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3230 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1530, Invalid=7967, Unknown=9, NotChecked=0, Total=9506 [2018-01-30 00:15:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-30 00:15:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 243. [2018-01-30 00:15:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-30 00:15:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 246 transitions. [2018-01-30 00:15:25,467 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 246 transitions. Word has length 225 [2018-01-30 00:15:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:25,468 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 246 transitions. [2018-01-30 00:15:25,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-01-30 00:15:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 246 transitions. [2018-01-30 00:15:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-30 00:15:25,468 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:25,469 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:15:25,469 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:15:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1007102536, now seen corresponding path program 11 times [2018-01-30 00:15:25,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:25,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:25,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:25,469 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:15:25,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:25,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:25,818 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:15:25,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:25,819 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:15:25,823 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:15:25,829 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,829 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,830 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,831 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,832 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,833 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,834 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,835 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,837 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,838 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,840 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,841 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,843 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,846 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,848 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,851 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,854 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,857 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,863 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,867 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,872 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,877 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,883 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,889 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,897 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,906 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,917 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,932 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:25,933 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:15:25,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2289 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-01-30 00:15:25,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:25,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-01-30 00:15:25,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 00:15:25,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 00:15:25,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-01-30 00:15:25,982 INFO L87 Difference]: Start difference. First operand 243 states and 246 transitions. Second operand 30 states. [2018-01-30 00:15:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:26,774 INFO L93 Difference]: Finished difference Result 330 states and 337 transitions. [2018-01-30 00:15:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-30 00:15:26,776 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 240 [2018-01-30 00:15:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:26,777 INFO L225 Difference]: With dead ends: 330 [2018-01-30 00:15:26,777 INFO L226 Difference]: Without dead ends: 259 [2018-01-30 00:15:26,777 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-01-30 00:15:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-30 00:15:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 249. [2018-01-30 00:15:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-01-30 00:15:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 252 transitions. [2018-01-30 00:15:26,785 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 252 transitions. Word has length 240 [2018-01-30 00:15:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:26,785 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 252 transitions. [2018-01-30 00:15:26,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 00:15:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 252 transitions. [2018-01-30 00:15:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-01-30 00:15:26,786 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:26,786 INFO L350 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 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:15:26,786 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:15:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1036388592, now seen corresponding path program 12 times [2018-01-30 00:15:26,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:26,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:26,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:26,787 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:15:26,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:26,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2453 backedges. 6 proven. 2324 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-01-30 00:15:27,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:27,410 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:15:27,414 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:15:27,421 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,428 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,439 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,448 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,458 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,470 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,477 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,490 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,497 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,510 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,517 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,526 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,536 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:15:27,545 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:15:27,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2453 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2366 trivial. 0 not checked. [2018-01-30 00:15:27,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:27,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 9] total 34 [2018-01-30 00:15:27,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 00:15:27,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 00:15:27,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 00:15:27,637 INFO L87 Difference]: Start difference. First operand 249 states and 252 transitions. Second operand 34 states. [2018-01-30 00:15:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:27,933 INFO L93 Difference]: Finished difference Result 376 states and 390 transitions. [2018-01-30 00:15:27,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 00:15:27,938 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 246 [2018-01-30 00:15:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:27,940 INFO L225 Difference]: With dead ends: 376 [2018-01-30 00:15:27,940 INFO L226 Difference]: Without dead ends: 305 [2018-01-30 00:15:27,940 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 244 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:15:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-30 00:15:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 278. [2018-01-30 00:15:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-01-30 00:15:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2018-01-30 00:15:27,950 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 246 [2018-01-30 00:15:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:27,950 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2018-01-30 00:15:27,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 00:15:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2018-01-30 00:15:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-30 00:15:27,951 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:27,951 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:15:27,951 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:15:27,951 INFO L82 PathProgramCache]: Analyzing trace with hash -249542395, now seen corresponding path program 13 times [2018-01-30 00:15:27,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:27,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:27,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:27,951 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:15:27,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:27,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:28,667 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:15:28,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:28,667 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:28,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:28,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:28,737 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:15:28,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:28,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-01-30 00:15:28,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-30 00:15:28,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-30 00:15:28,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 00:15:28,760 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 35 states. [2018-01-30 00:15:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:29,012 INFO L93 Difference]: Finished difference Result 370 states and 377 transitions. [2018-01-30 00:15:29,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 00:15:29,023 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 275 [2018-01-30 00:15:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:29,023 INFO L225 Difference]: With dead ends: 370 [2018-01-30 00:15:29,023 INFO L226 Difference]: Without dead ends: 294 [2018-01-30 00:15:29,024 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 00:15:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-30 00:15:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 284. [2018-01-30 00:15:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-30 00:15:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 287 transitions. [2018-01-30 00:15:29,031 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 287 transitions. Word has length 275 [2018-01-30 00:15:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:29,031 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 287 transitions. [2018-01-30 00:15:29,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-30 00:15:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 287 transitions. [2018-01-30 00:15:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-01-30 00:15:29,032 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:29,032 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:15:29,032 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:15:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1124182365, now seen corresponding path program 14 times [2018-01-30 00:15:29,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:29,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:29,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:29,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:29,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:29,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:30,207 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:15:30,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:30,207 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:15:30,212 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:15:30,220 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:30,247 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:30,259 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:15:30,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3395 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 00:15:30,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:30,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-01-30 00:15:30,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 00:15:30,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 00:15:30,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:15:30,321 INFO L87 Difference]: Start difference. First operand 284 states and 287 transitions. Second operand 36 states. [2018-01-30 00:15:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:31,002 INFO L93 Difference]: Finished difference Result 381 states and 389 transitions. [2018-01-30 00:15:31,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 00:15:31,002 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 281 [2018-01-30 00:15:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:31,003 INFO L225 Difference]: With dead ends: 381 [2018-01-30 00:15:31,003 INFO L226 Difference]: Without dead ends: 305 [2018-01-30 00:15:31,004 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:15:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-30 00:15:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2018-01-30 00:15:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-01-30 00:15:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2018-01-30 00:15:31,011 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 281 [2018-01-30 00:15:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:31,011 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2018-01-30 00:15:31,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 00:15:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2018-01-30 00:15:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-01-30 00:15:31,012 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:31,012 INFO L350 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 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:15:31,012 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:15:31,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1837066165, now seen corresponding path program 15 times [2018-01-30 00:15:31,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:31,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:31,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:31,013 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:15:31,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:31,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3595 backedges. 6 proven. 3434 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-01-30 00:15:32,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:32,124 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:15:32,129 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:15:32,136 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:15:32,147 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:15:32,160 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:15:32,174 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:15:32,176 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:15:32,179 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:15:32,182 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:15:32,184 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:15:32,185 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:15:32,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3595 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 3476 trivial. 0 not checked. [2018-01-30 00:15:32,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:32,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 10] total 40 [2018-01-30 00:15:32,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 00:15:32,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 00:15:32,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 00:15:32,305 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 40 states. [2018-01-30 00:15:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:32,566 INFO L93 Difference]: Finished difference Result 427 states and 442 transitions. [2018-01-30 00:15:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-30 00:15:32,568 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 287 [2018-01-30 00:15:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:32,569 INFO L225 Difference]: With dead ends: 427 [2018-01-30 00:15:32,569 INFO L226 Difference]: Without dead ends: 351 [2018-01-30 00:15:32,569 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 00:15:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-01-30 00:15:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 319. [2018-01-30 00:15:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-01-30 00:15:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 322 transitions. [2018-01-30 00:15:32,577 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 322 transitions. Word has length 287 [2018-01-30 00:15:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:32,577 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 322 transitions. [2018-01-30 00:15:32,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 00:15:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 322 transitions. [2018-01-30 00:15:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-01-30 00:15:32,578 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:32,578 INFO L350 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 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:15:32,578 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:15:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2079604384, now seen corresponding path program 16 times [2018-01-30 00:15:32,579 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:32,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:32,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:32,579 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:15:32,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:32,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:15:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4492 backedges. 6 proven. 4294 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-01-30 00:15:33,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:33,723 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:33,731 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:15:33,753 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:15:33,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:35,674 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:15:35,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:35,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:35,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:15:35,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:35,774 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:15:35,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:35,778 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:15:35,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 00:15:35,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:35,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:35,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:35,854 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:15:35,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:35,862 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:15:35,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:30 [2018-01-30 00:15:36,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,072 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:15:36,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:36,086 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:15:36,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:42 [2018-01-30 00:15:36,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:36,292 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:15:36,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:36,313 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:15:36,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:55, output treesize:54 [2018-01-30 00:15:51,131 WARN L143 SmtUtils]: Spent 293ms on a formula simplification that was a NOOP. DAG size: 48 [2018-01-30 00:15:53,988 WARN L143 SmtUtils]: Spent 295ms on a formula simplification that was a NOOP. DAG size: 45 [2018-01-30 00:15:56,762 WARN L143 SmtUtils]: Spent 211ms on a formula simplification that was a NOOP. DAG size: 46 Received shutdown request... [2018-01-30 00:15:59,336 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 00:15:59,336 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:15:59,339 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:15:59,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:15:59 BoogieIcfgContainer [2018-01-30 00:15:59,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:15:59,339 INFO L168 Benchmark]: Toolchain (without parser) took 76307.65 ms. Allocated memory was 148.9 MB in the beginning and 516.4 MB in the end (delta: 367.5 MB). Free memory was 112.7 MB in the beginning and 466.8 MB in the end (delta: -354.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:59,340 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 148.9 MB. Free memory is still 117.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:15:59,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 109.76 ms. Allocated memory is still 148.9 MB. Free memory was 112.5 MB in the beginning and 104.3 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:15:59,340 INFO L168 Benchmark]: Boogie Preprocessor took 17.45 ms. Allocated memory is still 148.9 MB. Free memory was 104.3 MB in the beginning and 102.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:15:59,340 INFO L168 Benchmark]: RCFGBuilder took 301.16 ms. Allocated memory is still 148.9 MB. Free memory was 102.7 MB in the beginning and 90.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:59,341 INFO L168 Benchmark]: TraceAbstraction took 75876.87 ms. Allocated memory was 148.9 MB in the beginning and 516.4 MB in the end (delta: 367.5 MB). Free memory was 90.3 MB in the beginning and 466.8 MB in the end (delta: -376.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:15:59,341 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.10 ms. Allocated memory is still 148.9 MB. Free memory is still 117.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 109.76 ms. Allocated memory is still 148.9 MB. Free memory was 112.5 MB in the beginning and 104.3 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.45 ms. Allocated memory is still 148.9 MB. Free memory was 104.3 MB in the beginning and 102.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 301.16 ms. Allocated memory is still 148.9 MB. Free memory was 102.7 MB in the beginning and 90.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 75876.87 ms. Allocated memory was 148.9 MB in the beginning and 516.4 MB in the end (delta: 367.5 MB). Free memory was 90.3 MB in the beginning and 466.8 MB in the end (delta: -376.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 317 with TraceHistMax 39, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 88 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. TIMEOUT Result, 75.8s OverallTime, 23 OverallIterations, 39 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 820 SDtfs, 2867 SDslu, 9183 SDs, 0 SdLazy, 8949 SolverSat, 590 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3588 GetRequests, 3076 SyntacticMatches, 0 SemanticMatches, 512 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4589 ImplicationChecksByTransitivity, 29.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred 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, 327 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 6324 NumberOfCodeBlocks, 5729 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 6282 ConstructedInterpolants, 62 QuantifiedInterpolants, 3262445 SizeOfPredicates, 40 NumberOfNonLiveVariables, 3689 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 42 InterpolantComputations, 3 PerfectInterpolantSequences, 11095/49276 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_08_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-15-59-345.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_two_index_08_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-15-59-345.csv Completed graceful shutdown