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-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:18:01,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:18:01,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:18:01,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:18:01,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:18:01,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:18:01,979 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:18:01,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:18:01,982 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:18:01,983 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:18:01,984 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:18:01,985 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:18:01,986 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:18:01,987 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:18:01,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:18:01,991 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:18:01,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:18:01,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:18:01,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:18:01,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:18:01,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:18:02,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:18:02,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:18:02,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:18:02,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:18:02,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:18:02,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:18:02,004 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:18:02,004 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:18:02,004 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:18:02,005 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:18:02,005 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:18:02,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:18:02,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:18:02,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:18:02,053 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:18:02,053 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:18:02,053 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:18:02,053 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:18:02,054 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:18:02,054 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:18:02,054 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:18:02,054 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:18:02,055 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:18:02,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:18:02,055 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:18:02,055 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:18:02,055 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:18:02,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:18:02,056 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:18:02,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:18:02,056 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:18:02,056 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:18:02,056 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:18:02,057 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:18:02,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:18:02,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:18:02,057 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:18:02,057 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:18:02,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:18:02,058 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:18:02,058 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:18:02,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:18:02,058 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:18:02,059 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:18:02,059 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:18:02,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:18:02,190 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:18:02,195 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:18:02,197 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:18:02,198 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:18:02,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:18:02,403 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:18:02,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:18:02,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:18:02,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:18:02,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:18:02,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:18:02" (1/1) ... [2018-01-31 08:18:02,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e711b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02, skipping insertion in model container [2018-01-31 08:18:02,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:18:02" (1/1) ... [2018-01-31 08:18:02,447 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:18:02,500 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:18:02,627 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:18:02,646 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:18:02,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02 WrapperNode [2018-01-31 08:18:02,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:18:02,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:18:02,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:18:02,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:18:02,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02" (1/1) ... [2018-01-31 08:18:02,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02" (1/1) ... [2018-01-31 08:18:02,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02" (1/1) ... [2018-01-31 08:18:02,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02" (1/1) ... [2018-01-31 08:18:02,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02" (1/1) ... [2018-01-31 08:18:02,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02" (1/1) ... [2018-01-31 08:18:02,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02" (1/1) ... [2018-01-31 08:18:02,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:18:02,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:18:02,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:18:02,720 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:18:02,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02" (1/1) ... No working directory specified, using /storage/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-31 08:18:02,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:18:02,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:18:02,819 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:18:02,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:18:02,819 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:18:02,819 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:18:02,823 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:18:02,823 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:18:02,823 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:18:02,823 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:18:02,823 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:18:02,823 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:18:03,313 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:18:03,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:18:03 BoogieIcfgContainer [2018-01-31 08:18:03,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:18:03,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:18:03,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:18:03,318 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:18:03,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:18:02" (1/3) ... [2018-01-31 08:18:03,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f788bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:18:03, skipping insertion in model container [2018-01-31 08:18:03,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:02" (2/3) ... [2018-01-31 08:18:03,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f788bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:18:03, skipping insertion in model container [2018-01-31 08:18:03,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:18:03" (3/3) ... [2018-01-31 08:18:03,322 INFO L107 eAbstractionObserver]: Analyzing ICFG add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:18:03,330 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:18:03,359 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-31 08:18:03,395 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:18:03,395 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:18:03,395 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:18:03,396 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:18:03,396 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:18:03,396 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:18:03,396 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:18:03,396 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:18:03,397 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:18:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-31 08:18:03,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 08:18:03,422 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:03,425 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:03,425 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1917879530, now seen corresponding path program 1 times [2018-01-31 08:18:03,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:03,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:03,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:03,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:03,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:03,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:03,885 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-31 08:18:03,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:03,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:18:03,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:18:03,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:18:03,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:18:03,908 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-01-31 08:18:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:04,328 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-31 08:18:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:18:04,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-31 08:18:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:04,432 INFO L225 Difference]: With dead ends: 66 [2018-01-31 08:18:04,433 INFO L226 Difference]: Without dead ends: 50 [2018-01-31 08:18:04,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:18:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-31 08:18:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-31 08:18:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-31 08:18:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-31 08:18:04,483 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2018-01-31 08:18:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:04,483 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-31 08:18:04,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:18:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-31 08:18:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 08:18:04,484 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:04,484 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:04,484 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1917879531, now seen corresponding path program 1 times [2018-01-31 08:18:04,485 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:04,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:04,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:04,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:04,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:04,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:04,666 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-31 08:18:04,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:04,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:18:04,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:18:04,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:18:04,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:18:04,668 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-31 08:18:05,000 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 22 [2018-01-31 08:18:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:05,203 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-01-31 08:18:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:18:05,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-31 08:18:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:05,205 INFO L225 Difference]: With dead ends: 72 [2018-01-31 08:18:05,205 INFO L226 Difference]: Without dead ends: 69 [2018-01-31 08:18:05,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:18:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-31 08:18:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2018-01-31 08:18:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 08:18:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-31 08:18:05,216 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2018-01-31 08:18:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:05,217 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-31 08:18:05,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:18:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-31 08:18:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:18:05,217 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:05,218 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:05,218 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash -679096899, now seen corresponding path program 1 times [2018-01-31 08:18:05,218 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:05,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:05,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:05,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:05,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:05,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:05,332 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-31 08:18:05,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:05,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:18:05,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:05,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:05,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:05,334 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 4 states. [2018-01-31 08:18:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:05,409 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-31 08:18:05,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:18:05,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-31 08:18:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:05,411 INFO L225 Difference]: With dead ends: 58 [2018-01-31 08:18:05,411 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 08:18:05,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:18:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 08:18:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-31 08:18:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-31 08:18:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-31 08:18:05,419 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 19 [2018-01-31 08:18:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:05,419 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-31 08:18:05,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-31 08:18:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:18:05,420 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:05,420 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:05,420 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash -675276707, now seen corresponding path program 1 times [2018-01-31 08:18:05,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:05,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:05,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:05,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:05,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:05,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:05,854 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 26 DAG size of output 16 [2018-01-31 08:18:05,865 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-31 08:18:05,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:05,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:18:05,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:18:05,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:18:05,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:18:05,866 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2018-01-31 08:18:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:05,968 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-01-31 08:18:05,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:18:05,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-31 08:18:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:05,969 INFO L225 Difference]: With dead ends: 64 [2018-01-31 08:18:05,969 INFO L226 Difference]: Without dead ends: 62 [2018-01-31 08:18:05,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:18:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-31 08:18:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2018-01-31 08:18:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-31 08:18:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-01-31 08:18:05,977 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 19 [2018-01-31 08:18:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:05,977 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-01-31 08:18:05,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:18:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-01-31 08:18:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 08:18:05,978 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:05,978 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:05,979 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1131978318, now seen corresponding path program 1 times [2018-01-31 08:18:05,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:05,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:05,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:05,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:05,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:06,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:06,084 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-31 08:18:06,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:06,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:18:06,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:06,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:06,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:06,085 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 4 states. [2018-01-31 08:18:06,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:06,123 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-31 08:18:06,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:18:06,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-31 08:18:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:06,124 INFO L225 Difference]: With dead ends: 51 [2018-01-31 08:18:06,125 INFO L226 Difference]: Without dead ends: 44 [2018-01-31 08:18:06,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:18:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-31 08:18:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-31 08:18:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-31 08:18:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-01-31 08:18:06,131 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 26 [2018-01-31 08:18:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:06,132 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-01-31 08:18:06,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-01-31 08:18:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 08:18:06,133 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:06,133 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:06,133 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:06,134 INFO L82 PathProgramCache]: Analyzing trace with hash -395515362, now seen corresponding path program 1 times [2018-01-31 08:18:06,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:06,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:06,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:06,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:06,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:06,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:06,243 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-31 08:18:06,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:06,243 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-31 08:18:06,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:06,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:06,325 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-31 08:18:06,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:06,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-01-31 08:18:06,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:18:06,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:18:06,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:18:06,351 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 6 states. [2018-01-31 08:18:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:06,412 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-31 08:18:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:18:06,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-31 08:18:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:06,413 INFO L225 Difference]: With dead ends: 48 [2018-01-31 08:18:06,413 INFO L226 Difference]: Without dead ends: 47 [2018-01-31 08:18:06,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:18:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-31 08:18:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-01-31 08:18:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-31 08:18:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-01-31 08:18:06,418 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 32 [2018-01-31 08:18:06,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:06,419 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-01-31 08:18:06,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:18:06,419 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-01-31 08:18:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 08:18:06,420 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:06,420 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:06,420 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash -395515361, now seen corresponding path program 1 times [2018-01-31 08:18:06,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:06,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:06,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:06,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:06,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:06,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:06,779 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 28 DAG size of output 14 [2018-01-31 08:18:07,176 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 33 DAG size of output 28 [2018-01-31 08:18:07,375 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-31 08:18:07,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:07,375 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:18:07,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:07,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:07,485 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-31 08:18:07,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:07,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:07,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-31 08:18:07,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:18:07,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:18:07,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:18:07,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:18:07,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:18:07,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:40 [2018-01-31 08:18:07,951 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-31 08:18:07,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:07,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-01-31 08:18:07,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:18:07,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:18:07,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:18:07,987 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 18 states. [2018-01-31 08:18:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:08,755 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-01-31 08:18:08,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:18:08,756 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-01-31 08:18:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:08,757 INFO L225 Difference]: With dead ends: 64 [2018-01-31 08:18:08,757 INFO L226 Difference]: Without dead ends: 61 [2018-01-31 08:18:08,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:18:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-31 08:18:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-01-31 08:18:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 08:18:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-31 08:18:08,764 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2018-01-31 08:18:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:08,765 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-31 08:18:08,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:18:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-31 08:18:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 08:18:08,766 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:08,766 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:08,766 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:08,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1325802579, now seen corresponding path program 2 times [2018-01-31 08:18:08,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:08,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:08,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:08,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:08,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:08,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:09,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:09,495 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:18:09,508 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:18:09,522 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:09,534 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:09,536 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:18:09,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:09,553 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-31 08:18:09,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:09,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:09,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:18:09,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:09,580 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 10 treesize of output 9 [2018-01-31 08:18:09,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:09,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:09,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:09,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-31 08:18:09,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:18:09,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:18:09,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:18:09,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:18:09,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:18:09,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-31 08:18:10,009 WARN L143 SmtUtils]: Spent 217ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-31 08:18:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:10,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:10,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2018-01-31 08:18:10,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:18:10,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:18:10,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:18:10,145 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-01-31 08:18:11,448 WARN L143 SmtUtils]: Spent 244ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-31 08:18:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:11,602 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-01-31 08:18:11,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:18:11,603 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-01-31 08:18:11,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:11,604 INFO L225 Difference]: With dead ends: 78 [2018-01-31 08:18:11,604 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 08:18:11,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:18:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 08:18:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-01-31 08:18:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 08:18:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-01-31 08:18:11,615 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 46 [2018-01-31 08:18:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:11,616 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-01-31 08:18:11,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:18:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-01-31 08:18:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:18:11,622 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:11,622 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:11,622 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1400671353, now seen corresponding path program 3 times [2018-01-31 08:18:11,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:11,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:11,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:11,626 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:18:11,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:11,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:12,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:12,315 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-31 08:18:12,327 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:18:12,340 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:18:12,357 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:18:12,363 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:18:12,368 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:18:12,370 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:18:12,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:12,392 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-31 08:18:12,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:18:12,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:12,498 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 10 treesize of output 9 [2018-01-31 08:18:12,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-31 08:18:12,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:12,539 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 10 treesize of output 9 [2018-01-31 08:18:12,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-31 08:18:12,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-31 08:18:12,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-31 08:18:12,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:12,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:18:12,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-31 08:18:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:12,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:12,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-01-31 08:18:12,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:18:12,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:18:12,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:18:12,888 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 24 states. [2018-01-31 08:18:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:13,769 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-01-31 08:18:13,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:18:13,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-01-31 08:18:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:13,774 INFO L225 Difference]: With dead ends: 92 [2018-01-31 08:18:13,774 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 08:18:13,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 08:18:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 08:18:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-01-31 08:18:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:18:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-01-31 08:18:13,793 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 60 [2018-01-31 08:18:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:13,794 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-01-31 08:18:13,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:18:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-01-31 08:18:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-31 08:18:13,796 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:13,796 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:13,796 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash 563877819, now seen corresponding path program 4 times [2018-01-31 08:18:13,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:13,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:13,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:13,798 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:18:13,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:13,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:14,263 WARN L146 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 14 DAG size of output 11 [2018-01-31 08:18:14,500 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 16 DAG size of output 11 [2018-01-31 08:18:15,040 WARN L146 SmtUtils]: Spent 401ms on a formula simplification. DAG size of input: 18 DAG size of output 18 [2018-01-31 08:18:15,301 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 18 DAG size of output 18 [2018-01-31 08:18:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:15,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:15,830 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-31 08:18:15,835 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:18:15,936 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:18:15,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:15,960 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-31 08:18:15,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:15,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:15,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:18:16,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:18:16,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:18:16,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:18:16,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:18:16,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:18:16,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-31 08:18:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:16,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:16,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-01-31 08:18:16,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:18:16,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:18:16,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:18:16,563 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 29 states. [2018-01-31 08:18:18,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:18,076 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2018-01-31 08:18:18,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:18:18,076 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-01-31 08:18:18,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:18,077 INFO L225 Difference]: With dead ends: 106 [2018-01-31 08:18:18,077 INFO L226 Difference]: Without dead ends: 103 [2018-01-31 08:18:18,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2018-01-31 08:18:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-31 08:18:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-01-31 08:18:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:18:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-01-31 08:18:18,091 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 74 [2018-01-31 08:18:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:18,092 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-01-31 08:18:18,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:18:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-01-31 08:18:18,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-31 08:18:18,093 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:18,093 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:18,093 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1655222033, now seen corresponding path program 5 times [2018-01-31 08:18:18,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:18,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:18,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:18,095 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:18:18,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:18,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:18,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:18,963 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-31 08:18:18,971 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:18:18,982 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:18,987 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:18,992 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:18,996 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:19,001 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:19,007 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:19,010 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:18:19,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:19,022 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-31 08:18:19,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:18:19,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:19,060 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 10 treesize of output 9 [2018-01-31 08:18:19,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-31 08:18:19,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:19,125 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 10 treesize of output 9 [2018-01-31 08:18:19,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:19,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:19,216 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 10 treesize of output 9 [2018-01-31 08:18:19,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:19,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:19,307 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 10 treesize of output 11 [2018-01-31 08:18:19,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:19,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-31 08:18:19,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:18:19,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:18:19,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:18:19,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:18:19,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:18:19,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-31 08:18:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:19,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:19,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-31 08:18:19,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-31 08:18:19,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-31 08:18:19,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:18:19,705 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 34 states. [2018-01-31 08:18:21,367 WARN L143 SmtUtils]: Spent 286ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-31 08:18:21,717 WARN L143 SmtUtils]: Spent 226ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 08:18:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:21,849 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-01-31 08:18:21,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-31 08:18:21,850 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 88 [2018-01-31 08:18:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:21,851 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:18:21,851 INFO L226 Difference]: Without dead ends: 117 [2018-01-31 08:18:21,852 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=353, Invalid=2953, Unknown=0, NotChecked=0, Total=3306 [2018-01-31 08:18:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-31 08:18:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-31 08:18:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:18:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-01-31 08:18:21,860 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 88 [2018-01-31 08:18:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:21,861 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-01-31 08:18:21,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-31 08:18:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-01-31 08:18:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-31 08:18:21,863 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:21,863 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:21,863 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1861460189, now seen corresponding path program 6 times [2018-01-31 08:18:21,863 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:21,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:21,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:21,864 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:18:21,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:21,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:22,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:22,855 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-31 08:18:22,861 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:18:22,874 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:18:22,878 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:18:22,891 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:18:22,896 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:18:22,902 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:18:22,907 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:18:22,928 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:18:22,942 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:18:22,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:22,972 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-31 08:18:22,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:22,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:22,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:18:23,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:23,083 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 10 treesize of output 9 [2018-01-31 08:18:23,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:23,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:23,166 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 10 treesize of output 9 [2018-01-31 08:18:23,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-31 08:18:23,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:23,238 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 10 treesize of output 11 [2018-01-31 08:18:23,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-31 08:18:23,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:23,315 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 10 treesize of output 9 [2018-01-31 08:18:23,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:23,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-31 08:18:23,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-31 08:18:24,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-31 08:18:24,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:24,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:24,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:18:24,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-31 08:18:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:24,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:24,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-01-31 08:18:24,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:18:24,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:18:24,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1303, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:18:24,172 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 39 states. [2018-01-31 08:18:26,833 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 102 DAG size of output 43 [2018-01-31 08:18:27,449 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 78 DAG size of output 64 [2018-01-31 08:18:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:29,067 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-01-31 08:18:29,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-31 08:18:29,068 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-01-31 08:18:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:29,069 INFO L225 Difference]: With dead ends: 190 [2018-01-31 08:18:29,069 INFO L226 Difference]: Without dead ends: 187 [2018-01-31 08:18:29,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3349 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1667, Invalid=8839, Unknown=0, NotChecked=0, Total=10506 [2018-01-31 08:18:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-31 08:18:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-01-31 08:18:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-31 08:18:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-01-31 08:18:29,085 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 102 [2018-01-31 08:18:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:29,085 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-01-31 08:18:29,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:18:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-01-31 08:18:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-01-31 08:18:29,088 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:29,088 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:29,088 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:29,088 INFO L82 PathProgramCache]: Analyzing trace with hash 335995175, now seen corresponding path program 7 times [2018-01-31 08:18:29,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:29,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:29,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:29,090 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:18:29,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:29,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:29,859 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 08:18:30,110 WARN L146 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-01-31 08:18:30,423 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 19 DAG size of output 19 [2018-01-31 08:18:31,250 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 25 DAG size of output 25 [2018-01-31 08:18:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:31,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:31,953 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-31 08:18:31,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:32,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:32,032 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-31 08:18:32,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:18:32,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:32,167 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 10 treesize of output 9 [2018-01-31 08:18:32,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-31 08:18:32,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:32,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:18:32,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:32,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:32,453 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 10 treesize of output 9 [2018-01-31 08:18:32,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:32,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:32,568 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 10 treesize of output 11 [2018-01-31 08:18:32,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:32,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:32,663 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 10 treesize of output 9 [2018-01-31 08:18:32,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:32,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:32,813 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 10 treesize of output 9 [2018-01-31 08:18:32,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:32,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:32,941 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 10 treesize of output 11 [2018-01-31 08:18:32,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:32,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:33,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:33,050 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 10 treesize of output 11 [2018-01-31 08:18:33,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:33,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:33,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:33,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:33,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:33,161 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 10 treesize of output 11 [2018-01-31 08:18:33,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:33,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:33,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:33,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:33,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:33,267 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 10 treesize of output 11 [2018-01-31 08:18:33,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:33,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:33,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:33,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:33,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:18:33,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:18:33,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:18:33,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:18:33,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:18:33,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-31 08:18:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:34,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:34,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2018-01-31 08:18:34,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-31 08:18:34,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-31 08:18:34,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3131, Unknown=0, NotChecked=0, Total=3306 [2018-01-31 08:18:34,169 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 58 states. [2018-01-31 08:18:37,005 WARN L146 SmtUtils]: Spent 399ms on a formula simplification. DAG size of input: 27 DAG size of output 25 [2018-01-31 08:18:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:38,503 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2018-01-31 08:18:38,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-31 08:18:38,504 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 172 [2018-01-31 08:18:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:38,505 INFO L225 Difference]: With dead ends: 204 [2018-01-31 08:18:38,505 INFO L226 Difference]: Without dead ends: 201 [2018-01-31 08:18:38,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2611 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=620, Invalid=9886, Unknown=0, NotChecked=0, Total=10506 [2018-01-31 08:18:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-31 08:18:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-01-31 08:18:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-31 08:18:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-01-31 08:18:38,514 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 172 [2018-01-31 08:18:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:38,515 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-01-31 08:18:38,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-01-31 08:18:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-01-31 08:18:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-01-31 08:18:38,517 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:38,517 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:38,517 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1027550555, now seen corresponding path program 8 times [2018-01-31 08:18:38,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:38,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:38,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:38,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:38,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:38,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:39,350 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-01-31 08:18:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:40,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:40,525 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-31 08:18:40,530 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:18:40,554 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:40,610 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:40,627 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:18:40,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:40,655 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-31 08:18:40,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:40,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:40,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:18:41,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,054 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 10 treesize of output 9 [2018-01-31 08:18:41,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-31 08:18:41,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,120 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 10 treesize of output 9 [2018-01-31 08:18:41,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:41,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,192 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 10 treesize of output 9 [2018-01-31 08:18:41,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:41,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,278 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 10 treesize of output 11 [2018-01-31 08:18:41,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:41,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,371 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 10 treesize of output 9 [2018-01-31 08:18:41,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:41,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,453 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 10 treesize of output 9 [2018-01-31 08:18:41,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:41,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,536 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 10 treesize of output 11 [2018-01-31 08:18:41,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:41,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,644 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 10 treesize of output 11 [2018-01-31 08:18:41,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:41,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,766 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 10 treesize of output 11 [2018-01-31 08:18:41,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:41,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,859 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 10 treesize of output 11 [2018-01-31 08:18:41,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:41,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:18:41,955 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 10 treesize of output 11 [2018-01-31 08:18:41,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:41,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:18:42,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:18:42,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:18:42,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:18:42,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:18:42,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:18:42,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-31 08:18:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:43,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:43,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 61 [2018-01-31 08:18:43,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-01-31 08:18:43,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-01-31 08:18:43,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=3332, Unknown=0, NotChecked=0, Total=3782 [2018-01-31 08:18:43,460 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 62 states. [2018-01-31 08:18:49,631 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 143 DAG size of output 83 [2018-01-31 08:18:49,971 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 141 DAG size of output 116 [2018-01-31 08:18:50,137 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-01-31 08:18:50,295 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 88 DAG size of output 76 [2018-01-31 08:18:50,460 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 92 DAG size of output 80 [2018-01-31 08:18:50,881 WARN L146 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 127 DAG size of output 107 [2018-01-31 08:18:51,193 WARN L146 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 130 DAG size of output 107 [2018-01-31 08:18:51,500 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 82 DAG size of output 71 [2018-01-31 08:18:51,656 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 86 DAG size of output 75 [2018-01-31 08:18:52,046 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 116 DAG size of output 98 [2018-01-31 08:18:52,323 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 119 DAG size of output 98 [2018-01-31 08:18:53,117 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 105 DAG size of output 89 [2018-01-31 08:18:53,385 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-01-31 08:18:54,130 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-01-31 08:18:54,364 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-01-31 08:18:55,031 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-01-31 08:18:55,237 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-01-31 08:18:55,854 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-01-31 08:18:56,038 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 75 DAG size of output 62 [2018-01-31 08:18:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:57,960 INFO L93 Difference]: Finished difference Result 358 states and 389 transitions. [2018-01-31 08:18:57,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-01-31 08:18:57,961 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 186 [2018-01-31 08:18:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:57,962 INFO L225 Difference]: With dead ends: 358 [2018-01-31 08:18:57,963 INFO L226 Difference]: Without dead ends: 355 [2018-01-31 08:18:57,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13557 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=6022, Invalid=31420, Unknown=0, NotChecked=0, Total=37442 [2018-01-31 08:18:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-31 08:18:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-01-31 08:18:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-01-31 08:18:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-01-31 08:18:57,987 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 186 [2018-01-31 08:18:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:57,987 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-01-31 08:18:57,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-01-31 08:18:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-01-31 08:18:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-01-31 08:18:57,993 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:57,993 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:57,993 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:18:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1615602281, now seen corresponding path program 9 times [2018-01-31 08:18:57,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:57,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:57,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:57,994 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:18:57,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:58,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:00,228 WARN L146 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-01-31 08:19:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3588 backedges. 0 proven. 3588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:19:02,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:02,882 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-31 08:19:02,897 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:19:02,925 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:02,938 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:02,943 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:02,947 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:02,952 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:02,960 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:02,966 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:02,972 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:02,981 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:02,989 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,003 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,035 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,046 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,082 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,222 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,394 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,475 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,595 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,622 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,663 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,713 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,738 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,798 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,836 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:03,853 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:19:03,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:03,881 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-31 08:19:03,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:03,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:03,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:19:06,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:19:06,335 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 10 treesize of output 11 [2018-01-31 08:19:06,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:06,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:06,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:06,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:19:06,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:19:06,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:19:06,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:19:06,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:19:06,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:19:06,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-31 08:19:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3588 backedges. 0 proven. 3588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:19:07,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:07,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 53] total 105 [2018-01-31 08:19:07,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-01-31 08:19:07,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-01-31 08:19:07,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1330, Invalid=9800, Unknown=0, NotChecked=0, Total=11130 [2018-01-31 08:19:07,360 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 106 states. [2018-01-31 08:19:21,655 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 284 DAG size of output 43 [2018-01-31 08:19:22,668 WARN L146 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 264 DAG size of output 138 [2018-01-31 08:19:23,504 WARN L146 SmtUtils]: Spent 605ms on a formula simplification. DAG size of input: 262 DAG size of output 215 [2018-01-31 08:19:23,939 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 152 DAG size of output 125 [2018-01-31 08:19:24,317 WARN L146 SmtUtils]: Spent 265ms on a formula simplification. DAG size of input: 154 DAG size of output 131 [2018-01-31 08:19:24,673 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 158 DAG size of output 135 [2018-01-31 08:19:24,996 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 144 DAG size of output 121 [2018-01-31 08:19:25,701 WARN L146 SmtUtils]: Spent 567ms on a formula simplification. DAG size of input: 248 DAG size of output 206 [2018-01-31 08:19:26,491 WARN L146 SmtUtils]: Spent 563ms on a formula simplification. DAG size of input: 251 DAG size of output 206 [2018-01-31 08:19:26,861 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 146 DAG size of output 120 [2018-01-31 08:19:27,199 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 148 DAG size of output 126 [2018-01-31 08:19:27,546 WARN L146 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 152 DAG size of output 130 [2018-01-31 08:19:27,859 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 138 DAG size of output 116 [2018-01-31 08:19:28,550 WARN L146 SmtUtils]: Spent 549ms on a formula simplification. DAG size of input: 237 DAG size of output 197 [2018-01-31 08:19:29,305 WARN L146 SmtUtils]: Spent 528ms on a formula simplification. DAG size of input: 240 DAG size of output 197 [2018-01-31 08:19:29,663 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 140 DAG size of output 115 [2018-01-31 08:19:29,986 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 142 DAG size of output 121 [2018-01-31 08:19:30,320 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 146 DAG size of output 125 [2018-01-31 08:19:30,620 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 132 DAG size of output 111 [2018-01-31 08:19:31,253 WARN L146 SmtUtils]: Spent 489ms on a formula simplification. DAG size of input: 226 DAG size of output 188 [2018-01-31 08:19:31,971 WARN L146 SmtUtils]: Spent 490ms on a formula simplification. DAG size of input: 229 DAG size of output 188 [2018-01-31 08:19:32,343 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 134 DAG size of output 110 [2018-01-31 08:19:32,652 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 136 DAG size of output 116 [2018-01-31 08:19:32,969 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 140 DAG size of output 120 [2018-01-31 08:19:33,253 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 126 DAG size of output 106 [2018-01-31 08:19:33,850 WARN L146 SmtUtils]: Spent 455ms on a formula simplification. DAG size of input: 215 DAG size of output 179 [2018-01-31 08:19:34,541 WARN L146 SmtUtils]: Spent 458ms on a formula simplification. DAG size of input: 218 DAG size of output 179 [2018-01-31 08:19:34,880 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 128 DAG size of output 105 [2018-01-31 08:19:35,182 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 130 DAG size of output 111 [2018-01-31 08:19:35,490 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 134 DAG size of output 115 [2018-01-31 08:19:35,765 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 120 DAG size of output 101 [2018-01-31 08:19:36,364 WARN L146 SmtUtils]: Spent 449ms on a formula simplification. DAG size of input: 204 DAG size of output 170 [2018-01-31 08:19:37,015 WARN L146 SmtUtils]: Spent 422ms on a formula simplification. DAG size of input: 207 DAG size of output 170 [2018-01-31 08:19:37,340 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 122 DAG size of output 100 [2018-01-31 08:19:37,628 WARN L146 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 124 DAG size of output 106 [2018-01-31 08:19:37,927 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 128 DAG size of output 110 [2018-01-31 08:19:38,192 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 114 DAG size of output 96 [2018-01-31 08:19:38,732 WARN L146 SmtUtils]: Spent 390ms on a formula simplification. DAG size of input: 193 DAG size of output 161 [2018-01-31 08:19:39,349 WARN L146 SmtUtils]: Spent 389ms on a formula simplification. DAG size of input: 196 DAG size of output 161 [2018-01-31 08:19:39,666 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 116 DAG size of output 95 [2018-01-31 08:19:39,948 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 118 DAG size of output 101 [2018-01-31 08:19:40,238 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 122 DAG size of output 105 [2018-01-31 08:19:40,495 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 108 DAG size of output 91 [2018-01-31 08:19:41,039 WARN L146 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 182 DAG size of output 152 [2018-01-31 08:19:41,636 WARN L146 SmtUtils]: Spent 364ms on a formula simplification. DAG size of input: 185 DAG size of output 152 [2018-01-31 08:19:41,942 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 110 DAG size of output 90 [2018-01-31 08:19:42,208 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 112 DAG size of output 96 [2018-01-31 08:19:42,493 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 116 DAG size of output 100 [2018-01-31 08:19:42,734 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 102 DAG size of output 86 [2018-01-31 08:19:43,219 WARN L146 SmtUtils]: Spent 336ms on a formula simplification. DAG size of input: 171 DAG size of output 143 [2018-01-31 08:19:43,781 WARN L146 SmtUtils]: Spent 332ms on a formula simplification. DAG size of input: 174 DAG size of output 143 [2018-01-31 08:19:44,076 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 104 DAG size of output 85 [2018-01-31 08:19:44,329 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 106 DAG size of output 91 [2018-01-31 08:19:44,592 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 110 DAG size of output 95 [2018-01-31 08:19:44,822 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 96 DAG size of output 81 [2018-01-31 08:19:45,297 WARN L146 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 160 DAG size of output 134 [2018-01-31 08:19:45,835 WARN L146 SmtUtils]: Spent 308ms on a formula simplification. DAG size of input: 163 DAG size of output 134 [2018-01-31 08:19:46,121 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 98 DAG size of output 80 [2018-01-31 08:19:46,365 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 100 DAG size of output 86 [2018-01-31 08:19:46,616 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-01-31 08:19:46,835 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 90 DAG size of output 76 [2018-01-31 08:19:47,263 WARN L146 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 149 DAG size of output 125 [2018-01-31 08:19:47,765 WARN L146 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 152 DAG size of output 125 [2018-01-31 08:19:48,035 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 92 DAG size of output 75 [2018-01-31 08:19:48,265 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 94 DAG size of output 81 [2018-01-31 08:19:48,503 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 98 DAG size of output 85 [2018-01-31 08:19:48,710 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 84 DAG size of output 71 [2018-01-31 08:19:49,115 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 138 DAG size of output 116 [2018-01-31 08:19:49,583 WARN L146 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 141 DAG size of output 116 [2018-01-31 08:19:49,843 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-01-31 08:19:50,088 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 88 DAG size of output 76 [2018-01-31 08:19:50,313 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 92 DAG size of output 80 [2018-01-31 08:19:50,871 WARN L146 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 127 DAG size of output 107 [2018-01-31 08:19:51,312 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 130 DAG size of output 107 [2018-01-31 08:19:51,562 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 80 DAG size of output 65 [2018-01-31 08:19:51,770 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 82 DAG size of output 71 [2018-01-31 08:19:51,985 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 86 DAG size of output 75 [2018-01-31 08:19:52,508 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 116 DAG size of output 98 [2018-01-31 08:19:52,914 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 119 DAG size of output 98 [2018-01-31 08:19:54,029 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 105 DAG size of output 89 [2018-01-31 08:19:54,405 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-01-31 08:19:55,475 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-01-31 08:19:55,820 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-01-31 08:19:56,780 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-01-31 08:19:57,093 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-01-31 08:19:57,978 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-01-31 08:19:58,260 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 75 DAG size of output 62 [2018-01-31 08:20:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:01,209 INFO L93 Difference]: Finished difference Result 666 states and 730 transitions. [2018-01-31 08:20:01,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2018-01-31 08:20:01,209 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 340 [2018-01-31 08:20:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:01,212 INFO L225 Difference]: With dead ends: 666 [2018-01-31 08:20:01,212 INFO L226 Difference]: Without dead ends: 663 [2018-01-31 08:20:01,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 289 SyntacticMatches, 4 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53388 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=21895, Invalid=114635, Unknown=0, NotChecked=0, Total=136530 [2018-01-31 08:20:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-01-31 08:20:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 659. [2018-01-31 08:20:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-01-31 08:20:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 660 transitions. [2018-01-31 08:20:01,266 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 660 transitions. Word has length 340 [2018-01-31 08:20:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:01,267 INFO L432 AbstractCegarLoop]: Abstraction has 659 states and 660 transitions. [2018-01-31 08:20:01,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-01-31 08:20:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 660 transitions. [2018-01-31 08:20:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-01-31 08:20:01,271 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:01,271 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:01,271 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 08:20:01,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1575254769, now seen corresponding path program 10 times [2018-01-31 08:20:01,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:01,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:01,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:01,273 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:20:01,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:02,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:09,266 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-01-31 08:20:09,587 WARN L146 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 21 DAG size of output 11 [2018-01-31 08:20:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13950 backedges. 0 proven. 13950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:20:18,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:18,174 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-31 08:20:18,180 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:20:18,456 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:20:18,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:18,503 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-31 08:20:18,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:18,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:18,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:20:18,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:20:18,786 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 10 treesize of output 9 [2018-01-31 08:20:18,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:18,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:18,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:18,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-31 08:20:19,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:20:19,021 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 10 treesize of output 9 [2018-01-31 08:20:19,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:19,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:19,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:19,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:20:19,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:20:19,262 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 10 treesize of output 9 [2018-01-31 08:20:19,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:19,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:19,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:19,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-31 08:20:19,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:20:19,508 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 10 treesize of output 11 [2018-01-31 08:20:19,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:19,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:19,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:19,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 Received shutdown request... [2018-01-31 08:20:19,932 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 08:20:19,932 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:20:19,937 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:20:19,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:20:19 BoogieIcfgContainer [2018-01-31 08:20:19,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:20:19,939 INFO L168 Benchmark]: Toolchain (without parser) took 137534.75 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 264.5 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 670.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:19,940 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:20:19,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.41 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:19,942 INFO L168 Benchmark]: Boogie Preprocessor took 60.94 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 252.5 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-01-31 08:20:19,943 INFO L168 Benchmark]: RCFGBuilder took 594.37 ms. Allocated memory is still 304.6 MB. Free memory was 252.5 MB in the beginning and 234.3 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:19,943 INFO L168 Benchmark]: TraceAbstraction took 136623.23 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 234.3 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 639.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:19,944 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.15 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.41 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 60.94 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 252.5 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 594.37 ms. Allocated memory is still 304.6 MB. Free memory was 252.5 MB in the beginning and 234.3 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 136623.23 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 234.3 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 639.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 106 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 11 error locations. TIMEOUT Result, 136.5s OverallTime, 16 OverallIterations, 46 TraceHistogramMax, 85.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 805 SDtfs, 9441 SDslu, 16765 SDs, 0 SdLazy, 23185 SolverSat, 1376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1982 GetRequests, 954 SyntacticMatches, 38 SemanticMatches, 990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74827 ImplicationChecksByTransitivity, 91.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=659occurred in iteration=15, 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, 15 MinimizatonAttempts, 65 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 2364 NumberOfCodeBlocks, 2362 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2339 ConstructedInterpolants, 117 QuantifiedInterpolants, 9496084 SizeOfPredicates, 418 NumberOfNonLiveVariables, 3528 ConjunctsInSsa, 763 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 0/11724 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-20-19-955.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-20-19-955.csv Completed graceful shutdown