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/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:51:34,006 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:51:34,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:51:34,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:51:34,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:51:34,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:51:34,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:51:34,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:51:34,025 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:51:34,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:51:34,026 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:51:34,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:51:34,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:51:34,029 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:51:34,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:51:34,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:51:34,034 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:51:34,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:51:34,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:51:34,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:51:34,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:51:34,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:51:34,041 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:51:34,042 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:51:34,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:51:34,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:51:34,044 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:51:34,045 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:51:34,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:51:34,045 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:51:34,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:51:34,046 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-28 21:51:34,056 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:51:34,056 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:51:34,057 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:51:34,057 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:51:34,057 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:51:34,058 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:51:34,058 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:51:34,058 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:51:34,059 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:51:34,059 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:51:34,059 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:51:34,059 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:51:34,059 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:51:34,060 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:51:34,060 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:51:34,060 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:51:34,060 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:51:34,060 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:51:34,061 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:51:34,061 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:51:34,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:51:34,061 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:51:34,061 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:51:34,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:51:34,062 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:51:34,062 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:51:34,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:51:34,062 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:51:34,063 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:51:34,063 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:51:34,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:51:34,063 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:51:34,064 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:51:34,064 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:51:34,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:51:34,110 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:51:34,114 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:51:34,115 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:51:34,116 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:51:34,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i [2018-01-28 21:51:34,289 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:51:34,295 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:51:34,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:51:34,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:51:34,300 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:51:34,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:51:34" (1/1) ... [2018-01-28 21:51:34,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d356b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34, skipping insertion in model container [2018-01-28 21:51:34,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:51:34" (1/1) ... [2018-01-28 21:51:34,316 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:51:34,352 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:51:34,473 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:51:34,495 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:51:34,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34 WrapperNode [2018-01-28 21:51:34,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:51:34,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:51:34,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:51:34,507 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:51:34,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34" (1/1) ... [2018-01-28 21:51:34,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34" (1/1) ... [2018-01-28 21:51:34,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34" (1/1) ... [2018-01-28 21:51:34,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34" (1/1) ... [2018-01-28 21:51:34,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34" (1/1) ... [2018-01-28 21:51:34,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34" (1/1) ... [2018-01-28 21:51:34,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34" (1/1) ... [2018-01-28 21:51:34,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:51:34,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:51:34,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:51:34,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:51:34,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34" (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-28 21:51:34,593 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:51:34,593 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:51:34,593 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:51:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:51:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:51:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:51:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:51:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:51:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:51:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:51:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:51:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:51:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:51:34,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:51:35,149 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:51:35,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:51:35 BoogieIcfgContainer [2018-01-28 21:51:35,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:51:35,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:51:35,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:51:35,155 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:51:35,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:51:34" (1/3) ... [2018-01-28 21:51:35,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0ae1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:51:35, skipping insertion in model container [2018-01-28 21:51:35,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:51:34" (2/3) ... [2018-01-28 21:51:35,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0ae1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:51:35, skipping insertion in model container [2018-01-28 21:51:35,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:51:35" (3/3) ... [2018-01-28 21:51:35,159 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_dsw_true-valid-memsafety_false-termination.i [2018-01-28 21:51:35,168 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:51:35,176 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-01-28 21:51:35,229 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:51:35,229 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:51:35,229 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:51:35,229 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:51:35,230 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:51:35,230 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:51:35,230 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:51:35,230 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:51:35,231 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:51:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2018-01-28 21:51:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-28 21:51:35,262 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:35,263 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:35,263 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:35,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1199355918, now seen corresponding path program 1 times [2018-01-28 21:51:35,270 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:35,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:35,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:35,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:35,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:35,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:35,430 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-28 21:51:35,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:35,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:51:35,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:51:35,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:51:35,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:51:35,562 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 4 states. [2018-01-28 21:51:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:35,825 INFO L93 Difference]: Finished difference Result 445 states and 481 transitions. [2018-01-28 21:51:35,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:51:35,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-28 21:51:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:35,839 INFO L225 Difference]: With dead ends: 445 [2018-01-28 21:51:35,839 INFO L226 Difference]: Without dead ends: 234 [2018-01-28 21:51:35,844 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-28 21:51:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-28 21:51:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2018-01-28 21:51:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-28 21:51:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 229 transitions. [2018-01-28 21:51:35,885 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 229 transitions. Word has length 10 [2018-01-28 21:51:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:35,886 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 229 transitions. [2018-01-28 21:51:35,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:51:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 229 transitions. [2018-01-28 21:51:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-28 21:51:35,886 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:35,886 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:35,887 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1199355919, now seen corresponding path program 1 times [2018-01-28 21:51:35,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:35,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:35,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:35,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:35,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:35,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:35,979 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-28 21:51:35,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:35,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:51:35,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:51:35,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:51:35,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:51:35,982 INFO L87 Difference]: Start difference. First operand 216 states and 229 transitions. Second operand 4 states. [2018-01-28 21:51:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:36,152 INFO L93 Difference]: Finished difference Result 216 states and 229 transitions. [2018-01-28 21:51:36,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:51:36,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-28 21:51:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:36,154 INFO L225 Difference]: With dead ends: 216 [2018-01-28 21:51:36,155 INFO L226 Difference]: Without dead ends: 214 [2018-01-28 21:51:36,156 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-28 21:51:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-01-28 21:51:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-01-28 21:51:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-28 21:51:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 227 transitions. [2018-01-28 21:51:36,171 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 227 transitions. Word has length 10 [2018-01-28 21:51:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:36,171 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 227 transitions. [2018-01-28 21:51:36,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:51:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 227 transitions. [2018-01-28 21:51:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 21:51:36,172 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:36,172 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:36,173 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2098766525, now seen corresponding path program 1 times [2018-01-28 21:51:36,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:36,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:36,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:36,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:36,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:36,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:36,220 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-28 21:51:36,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:36,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:51:36,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:51:36,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:51:36,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:51:36,221 INFO L87 Difference]: Start difference. First operand 214 states and 227 transitions. Second operand 4 states. [2018-01-28 21:51:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:36,434 INFO L93 Difference]: Finished difference Result 254 states and 271 transitions. [2018-01-28 21:51:36,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:51:36,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-28 21:51:36,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:36,437 INFO L225 Difference]: With dead ends: 254 [2018-01-28 21:51:36,437 INFO L226 Difference]: Without dead ends: 234 [2018-01-28 21:51:36,438 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-28 21:51:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-28 21:51:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 201. [2018-01-28 21:51:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-28 21:51:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 217 transitions. [2018-01-28 21:51:36,452 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 217 transitions. Word has length 18 [2018-01-28 21:51:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:36,453 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 217 transitions. [2018-01-28 21:51:36,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:51:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 217 transitions. [2018-01-28 21:51:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 21:51:36,454 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:36,454 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:36,454 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2098766526, now seen corresponding path program 1 times [2018-01-28 21:51:36,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:36,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:36,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:36,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:36,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:36,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:36,535 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-28 21:51:36,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:36,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:51:36,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:51:36,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:51:36,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:51:36,536 INFO L87 Difference]: Start difference. First operand 201 states and 217 transitions. Second operand 5 states. [2018-01-28 21:51:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:36,790 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2018-01-28 21:51:36,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:51:36,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-28 21:51:36,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:36,791 INFO L225 Difference]: With dead ends: 305 [2018-01-28 21:51:36,791 INFO L226 Difference]: Without dead ends: 289 [2018-01-28 21:51:36,792 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:51:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-01-28 21:51:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 259. [2018-01-28 21:51:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-01-28 21:51:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 286 transitions. [2018-01-28 21:51:36,804 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 286 transitions. Word has length 18 [2018-01-28 21:51:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:36,804 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 286 transitions. [2018-01-28 21:51:36,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:51:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 286 transitions. [2018-01-28 21:51:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 21:51:36,805 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:36,806 INFO L330 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] [2018-01-28 21:51:36,806 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash 441147690, now seen corresponding path program 1 times [2018-01-28 21:51:36,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:36,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:36,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:36,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:36,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:36,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:36,872 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-28 21:51:36,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:36,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:51:36,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:51:36,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:51:36,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:51:36,874 INFO L87 Difference]: Start difference. First operand 259 states and 286 transitions. Second operand 8 states. [2018-01-28 21:51:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:37,024 INFO L93 Difference]: Finished difference Result 402 states and 434 transitions. [2018-01-28 21:51:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:51:37,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-28 21:51:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:37,027 INFO L225 Difference]: With dead ends: 402 [2018-01-28 21:51:37,027 INFO L226 Difference]: Without dead ends: 331 [2018-01-28 21:51:37,028 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:51:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-28 21:51:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 260. [2018-01-28 21:51:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-01-28 21:51:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 287 transitions. [2018-01-28 21:51:37,041 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 287 transitions. Word has length 23 [2018-01-28 21:51:37,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:37,041 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 287 transitions. [2018-01-28 21:51:37,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:51:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 287 transitions. [2018-01-28 21:51:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-28 21:51:37,043 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:37,043 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:37,043 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1597556685, now seen corresponding path program 1 times [2018-01-28 21:51:37,044 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:37,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:37,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:37,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:37,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:37,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:37,095 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-28 21:51:37,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:37,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:51:37,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:51:37,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:51:37,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:51:37,097 INFO L87 Difference]: Start difference. First operand 260 states and 287 transitions. Second operand 5 states. [2018-01-28 21:51:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:37,292 INFO L93 Difference]: Finished difference Result 351 states and 380 transitions. [2018-01-28 21:51:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:51:37,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-28 21:51:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:37,294 INFO L225 Difference]: With dead ends: 351 [2018-01-28 21:51:37,294 INFO L226 Difference]: Without dead ends: 282 [2018-01-28 21:51:37,294 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:51:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-01-28 21:51:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 259. [2018-01-28 21:51:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-01-28 21:51:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 285 transitions. [2018-01-28 21:51:37,303 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 285 transitions. Word has length 27 [2018-01-28 21:51:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:37,304 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 285 transitions. [2018-01-28 21:51:37,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:51:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 285 transitions. [2018-01-28 21:51:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:51:37,305 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:37,305 INFO L330 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-28 21:51:37,305 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash 607708503, now seen corresponding path program 1 times [2018-01-28 21:51:37,305 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:37,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:37,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:37,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:37,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:37,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:37,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:37,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:51:37,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:51:37,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:51:37,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:51:37,339 INFO L87 Difference]: Start difference. First operand 259 states and 285 transitions. Second operand 3 states. [2018-01-28 21:51:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:37,360 INFO L93 Difference]: Finished difference Result 509 states and 563 transitions. [2018-01-28 21:51:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:51:37,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-28 21:51:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:37,362 INFO L225 Difference]: With dead ends: 509 [2018-01-28 21:51:37,362 INFO L226 Difference]: Without dead ends: 261 [2018-01-28 21:51:37,363 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:51:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-28 21:51:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-01-28 21:51:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-01-28 21:51:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 287 transitions. [2018-01-28 21:51:37,376 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 287 transitions. Word has length 32 [2018-01-28 21:51:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:37,376 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 287 transitions. [2018-01-28 21:51:37,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:51:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 287 transitions. [2018-01-28 21:51:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 21:51:37,384 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:37,384 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:37,385 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash 170560694, now seen corresponding path program 1 times [2018-01-28 21:51:37,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:37,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:37,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:37,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:37,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:37,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:37,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:37,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:51:37,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:51:37,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:51:37,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:51:37,542 INFO L87 Difference]: Start difference. First operand 261 states and 287 transitions. Second operand 7 states. [2018-01-28 21:51:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:37,868 INFO L93 Difference]: Finished difference Result 625 states and 678 transitions. [2018-01-28 21:51:37,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:51:37,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-28 21:51:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:37,872 INFO L225 Difference]: With dead ends: 625 [2018-01-28 21:51:37,872 INFO L226 Difference]: Without dead ends: 534 [2018-01-28 21:51:37,873 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:51:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-01-28 21:51:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 360. [2018-01-28 21:51:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-01-28 21:51:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 408 transitions. [2018-01-28 21:51:37,890 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 408 transitions. Word has length 34 [2018-01-28 21:51:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:37,890 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 408 transitions. [2018-01-28 21:51:37,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:51:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 408 transitions. [2018-01-28 21:51:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 21:51:37,892 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:37,892 INFO L330 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, 1, 1] [2018-01-28 21:51:37,892 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash -236704972, now seen corresponding path program 1 times [2018-01-28 21:51:37,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:37,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:37,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:37,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:37,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:37,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:38,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:38,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:51:38,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:51:38,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:51:38,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:51:38,015 INFO L87 Difference]: Start difference. First operand 360 states and 408 transitions. Second operand 6 states. [2018-01-28 21:51:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:38,259 INFO L93 Difference]: Finished difference Result 694 states and 776 transitions. [2018-01-28 21:51:38,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:51:38,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-28 21:51:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:38,261 INFO L225 Difference]: With dead ends: 694 [2018-01-28 21:51:38,262 INFO L226 Difference]: Without dead ends: 345 [2018-01-28 21:51:38,263 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:51:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-28 21:51:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 309. [2018-01-28 21:51:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-01-28 21:51:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 340 transitions. [2018-01-28 21:51:38,280 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 340 transitions. Word has length 34 [2018-01-28 21:51:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:38,281 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 340 transitions. [2018-01-28 21:51:38,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:51:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 340 transitions. [2018-01-28 21:51:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 21:51:38,282 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:38,282 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:38,283 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:38,283 INFO L82 PathProgramCache]: Analyzing trace with hash -803490408, now seen corresponding path program 1 times [2018-01-28 21:51:38,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:38,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:38,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:38,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:38,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:38,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:38,408 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-28 21:51:38,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:38,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:51:38,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:51:38,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:51:38,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:51:38,409 INFO L87 Difference]: Start difference. First operand 309 states and 340 transitions. Second operand 7 states. [2018-01-28 21:51:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:38,750 INFO L93 Difference]: Finished difference Result 702 states and 776 transitions. [2018-01-28 21:51:38,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:51:38,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-01-28 21:51:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:38,752 INFO L225 Difference]: With dead ends: 702 [2018-01-28 21:51:38,753 INFO L226 Difference]: Without dead ends: 404 [2018-01-28 21:51:38,754 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:51:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-01-28 21:51:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 321. [2018-01-28 21:51:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-01-28 21:51:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 352 transitions. [2018-01-28 21:51:38,769 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 352 transitions. Word has length 35 [2018-01-28 21:51:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:38,769 INFO L432 AbstractCegarLoop]: Abstraction has 321 states and 352 transitions. [2018-01-28 21:51:38,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:51:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 352 transitions. [2018-01-28 21:51:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:51:38,770 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:38,770 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:38,771 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash 611141657, now seen corresponding path program 1 times [2018-01-28 21:51:38,771 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:38,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:38,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:38,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:38,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:38,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:38,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:38,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:51:38,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:51:38,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:51:38,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:51:38,812 INFO L87 Difference]: Start difference. First operand 321 states and 352 transitions. Second operand 4 states. [2018-01-28 21:51:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:39,020 INFO L93 Difference]: Finished difference Result 376 states and 411 transitions. [2018-01-28 21:51:39,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:51:39,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-28 21:51:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:39,023 INFO L225 Difference]: With dead ends: 376 [2018-01-28 21:51:39,023 INFO L226 Difference]: Without dead ends: 375 [2018-01-28 21:51:39,023 INFO L533 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-28 21:51:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-28 21:51:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 324. [2018-01-28 21:51:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-01-28 21:51:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 357 transitions. [2018-01-28 21:51:39,037 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 357 transitions. Word has length 36 [2018-01-28 21:51:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:39,037 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 357 transitions. [2018-01-28 21:51:39,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:51:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 357 transitions. [2018-01-28 21:51:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:51:39,038 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:39,039 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:39,039 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash 611141658, now seen corresponding path program 1 times [2018-01-28 21:51:39,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:39,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:39,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:39,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:39,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:39,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-28 21:51:39,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:39,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:51:39,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:51:39,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:51:39,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:51:39,247 INFO L87 Difference]: Start difference. First operand 324 states and 357 transitions. Second operand 8 states. [2018-01-28 21:51:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:39,725 INFO L93 Difference]: Finished difference Result 466 states and 502 transitions. [2018-01-28 21:51:39,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:51:39,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-01-28 21:51:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:39,727 INFO L225 Difference]: With dead ends: 466 [2018-01-28 21:51:39,728 INFO L226 Difference]: Without dead ends: 462 [2018-01-28 21:51:39,728 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:51:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-01-28 21:51:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 331. [2018-01-28 21:51:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-01-28 21:51:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 366 transitions. [2018-01-28 21:51:39,744 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 366 transitions. Word has length 36 [2018-01-28 21:51:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:39,744 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 366 transitions. [2018-01-28 21:51:39,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:51:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 366 transitions. [2018-01-28 21:51:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:51:39,745 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:39,745 INFO L330 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, 1, 1, 1, 1, 1] [2018-01-28 21:51:39,745 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:39,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1765521374, now seen corresponding path program 1 times [2018-01-28 21:51:39,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:39,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:39,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:39,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:39,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:39,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:39,823 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-28 21:51:39,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:51:39,824 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-28 21:51:39,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:39,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:51:39,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:39,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:39,927 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:51:39,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:39,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:39,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-28 21:51:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 21:51:40,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:51:40,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-01-28 21:51:40,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:51:40,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:51:40,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:51:40,014 INFO L87 Difference]: Start difference. First operand 331 states and 366 transitions. Second operand 10 states. [2018-01-28 21:51:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:40,709 INFO L93 Difference]: Finished difference Result 537 states and 581 transitions. [2018-01-28 21:51:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:51:40,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-28 21:51:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:40,712 INFO L225 Difference]: With dead ends: 537 [2018-01-28 21:51:40,712 INFO L226 Difference]: Without dead ends: 465 [2018-01-28 21:51:40,713 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2018-01-28 21:51:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-01-28 21:51:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 329. [2018-01-28 21:51:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-01-28 21:51:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 363 transitions. [2018-01-28 21:51:40,733 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 363 transitions. Word has length 37 [2018-01-28 21:51:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:40,733 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 363 transitions. [2018-01-28 21:51:40,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:51:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 363 transitions. [2018-01-28 21:51:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:51:40,735 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:40,735 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:40,735 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash -344312747, now seen corresponding path program 1 times [2018-01-28 21:51:40,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:40,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:40,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:40,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:40,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:40,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:40,812 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-28 21:51:40,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:40,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:51:40,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:51:40,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:51:40,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:51:40,813 INFO L87 Difference]: Start difference. First operand 329 states and 363 transitions. Second operand 5 states. [2018-01-28 21:51:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:41,214 INFO L93 Difference]: Finished difference Result 538 states and 597 transitions. [2018-01-28 21:51:41,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:51:41,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-28 21:51:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:41,216 INFO L225 Difference]: With dead ends: 538 [2018-01-28 21:51:41,216 INFO L226 Difference]: Without dead ends: 537 [2018-01-28 21:51:41,216 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:51:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-01-28 21:51:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 328. [2018-01-28 21:51:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-01-28 21:51:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 361 transitions. [2018-01-28 21:51:41,225 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 361 transitions. Word has length 37 [2018-01-28 21:51:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:41,226 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 361 transitions. [2018-01-28 21:51:41,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:51:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 361 transitions. [2018-01-28 21:51:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:51:41,226 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:41,226 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:41,226 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:41,227 INFO L82 PathProgramCache]: Analyzing trace with hash -344312746, now seen corresponding path program 1 times [2018-01-28 21:51:41,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:41,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:41,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:41,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:41,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:41,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:41,346 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-28 21:51:41,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:41,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:51:41,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:51:41,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:51:41,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:51:41,347 INFO L87 Difference]: Start difference. First operand 328 states and 361 transitions. Second operand 5 states. [2018-01-28 21:51:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:41,681 INFO L93 Difference]: Finished difference Result 577 states and 636 transitions. [2018-01-28 21:51:41,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:51:41,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-28 21:51:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:41,683 INFO L225 Difference]: With dead ends: 577 [2018-01-28 21:51:41,684 INFO L226 Difference]: Without dead ends: 576 [2018-01-28 21:51:41,684 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:51:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-01-28 21:51:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 327. [2018-01-28 21:51:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-01-28 21:51:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 359 transitions. [2018-01-28 21:51:41,694 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 359 transitions. Word has length 37 [2018-01-28 21:51:41,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:41,694 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 359 transitions. [2018-01-28 21:51:41,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:51:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 359 transitions. [2018-01-28 21:51:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:51:41,695 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:41,695 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:41,695 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1039064547, now seen corresponding path program 1 times [2018-01-28 21:51:41,695 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:41,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:41,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:41,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:41,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:41,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:41,868 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-28 21:51:41,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:41,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:51:41,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:51:41,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:51:41,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:51:41,869 INFO L87 Difference]: Start difference. First operand 327 states and 359 transitions. Second operand 9 states. [2018-01-28 21:51:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:42,294 INFO L93 Difference]: Finished difference Result 407 states and 448 transitions. [2018-01-28 21:51:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:51:42,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-28 21:51:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:42,296 INFO L225 Difference]: With dead ends: 407 [2018-01-28 21:51:42,296 INFO L226 Difference]: Without dead ends: 406 [2018-01-28 21:51:42,297 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:51:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-01-28 21:51:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 326. [2018-01-28 21:51:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-01-28 21:51:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 357 transitions. [2018-01-28 21:51:42,310 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 357 transitions. Word has length 40 [2018-01-28 21:51:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:42,311 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 357 transitions. [2018-01-28 21:51:42,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:51:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 357 transitions. [2018-01-28 21:51:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:51:42,311 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:42,312 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:42,312 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1039064546, now seen corresponding path program 1 times [2018-01-28 21:51:42,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:42,312 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:42,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:42,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:42,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:42,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:42,429 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-28 21:51:42,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:42,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:51:42,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:51:42,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:51:42,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:51:42,430 INFO L87 Difference]: Start difference. First operand 326 states and 357 transitions. Second operand 9 states. [2018-01-28 21:51:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:42,777 INFO L93 Difference]: Finished difference Result 406 states and 446 transitions. [2018-01-28 21:51:42,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:51:42,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-28 21:51:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:42,778 INFO L225 Difference]: With dead ends: 406 [2018-01-28 21:51:42,778 INFO L226 Difference]: Without dead ends: 405 [2018-01-28 21:51:42,779 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:51:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-01-28 21:51:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 325. [2018-01-28 21:51:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-28 21:51:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 355 transitions. [2018-01-28 21:51:42,792 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 355 transitions. Word has length 40 [2018-01-28 21:51:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:42,793 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 355 transitions. [2018-01-28 21:51:42,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:51:42,793 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 355 transitions. [2018-01-28 21:51:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 21:51:42,793 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:42,794 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:42,794 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1726383815, now seen corresponding path program 1 times [2018-01-28 21:51:42,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:42,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:42,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:42,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:42,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:42,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:42,838 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-28 21:51:42,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:42,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:51:42,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:51:42,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:51:42,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:51:42,840 INFO L87 Difference]: Start difference. First operand 325 states and 355 transitions. Second operand 3 states. [2018-01-28 21:51:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:42,875 INFO L93 Difference]: Finished difference Result 594 states and 653 transitions. [2018-01-28 21:51:42,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:51:42,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-28 21:51:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:42,878 INFO L225 Difference]: With dead ends: 594 [2018-01-28 21:51:42,878 INFO L226 Difference]: Without dead ends: 328 [2018-01-28 21:51:42,879 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:51:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-01-28 21:51:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2018-01-28 21:51:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-01-28 21:51:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 357 transitions. [2018-01-28 21:51:42,892 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 357 transitions. Word has length 44 [2018-01-28 21:51:42,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:42,892 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 357 transitions. [2018-01-28 21:51:42,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:51:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 357 transitions. [2018-01-28 21:51:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 21:51:42,893 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:42,893 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:42,893 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:42,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1813354742, now seen corresponding path program 1 times [2018-01-28 21:51:42,893 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:42,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:42,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:42,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:42,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:42,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:42,959 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-28 21:51:42,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:42,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:51:42,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:51:42,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:51:42,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:51:42,961 INFO L87 Difference]: Start difference. First operand 327 states and 357 transitions. Second operand 5 states. [2018-01-28 21:51:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:43,212 INFO L93 Difference]: Finished difference Result 535 states and 588 transitions. [2018-01-28 21:51:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:51:43,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-28 21:51:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:43,214 INFO L225 Difference]: With dead ends: 535 [2018-01-28 21:51:43,214 INFO L226 Difference]: Without dead ends: 534 [2018-01-28 21:51:43,214 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:51:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-01-28 21:51:43,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 326. [2018-01-28 21:51:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-01-28 21:51:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 355 transitions. [2018-01-28 21:51:43,228 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 355 transitions. Word has length 46 [2018-01-28 21:51:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:43,228 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 355 transitions. [2018-01-28 21:51:43,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:51:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 355 transitions. [2018-01-28 21:51:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 21:51:43,229 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:43,229 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:43,229 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1813354743, now seen corresponding path program 1 times [2018-01-28 21:51:43,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:43,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:43,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:43,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:43,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:43,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:43,309 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-28 21:51:43,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:43,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:51:43,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:51:43,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:51:43,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:51:43,310 INFO L87 Difference]: Start difference. First operand 326 states and 355 transitions. Second operand 5 states. [2018-01-28 21:51:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:43,662 INFO L93 Difference]: Finished difference Result 574 states and 627 transitions. [2018-01-28 21:51:43,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:51:43,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-28 21:51:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:43,665 INFO L225 Difference]: With dead ends: 574 [2018-01-28 21:51:43,665 INFO L226 Difference]: Without dead ends: 573 [2018-01-28 21:51:43,665 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:51:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-01-28 21:51:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 325. [2018-01-28 21:51:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-28 21:51:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 353 transitions. [2018-01-28 21:51:43,680 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 353 transitions. Word has length 46 [2018-01-28 21:51:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:43,680 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 353 transitions. [2018-01-28 21:51:43,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:51:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 353 transitions. [2018-01-28 21:51:43,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 21:51:43,681 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:43,681 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:43,681 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:43,681 INFO L82 PathProgramCache]: Analyzing trace with hash 464567682, now seen corresponding path program 1 times [2018-01-28 21:51:43,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:43,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:43,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:43,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:43,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:43,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:43,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:51:43,900 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-28 21:51:43,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:43,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:51:43,960 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-28 21:51:43,964 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-28 21:51:43,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:43,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:43,973 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-28 21:51:43,975 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-28 21:51:43,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:43,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:43,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:43,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-28 21:51:44,035 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 27 treesize of output 20 [2018-01-28 21:51:44,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:44,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-01-28 21:51:44,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,061 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 27 treesize of output 20 [2018-01-28 21:51:44,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:44,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-01-28 21:51:44,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-01-28 21:51:44,124 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 36 treesize of output 27 [2018-01-28 21:51:44,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:44,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-28 21:51:44,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,155 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 36 treesize of output 27 [2018-01-28 21:51:44,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:44,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-28 21:51:44,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:15 [2018-01-28 21:51:44,268 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 20 treesize of output 16 [2018-01-28 21:51:44,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 21:51:44,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,302 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 20 treesize of output 16 [2018-01-28 21:51:44,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 21:51:44,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:44,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-01-28 21:51:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:44,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:51:44,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-01-28 21:51:44,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 21:51:44,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 21:51:44,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:51:44,357 INFO L87 Difference]: Start difference. First operand 325 states and 353 transitions. Second operand 12 states. [2018-01-28 21:51:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:44,801 INFO L93 Difference]: Finished difference Result 503 states and 543 transitions. [2018-01-28 21:51:44,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 21:51:44,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-01-28 21:51:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:44,803 INFO L225 Difference]: With dead ends: 503 [2018-01-28 21:51:44,804 INFO L226 Difference]: Without dead ends: 409 [2018-01-28 21:51:44,804 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 13 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-01-28 21:51:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-01-28 21:51:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 339. [2018-01-28 21:51:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-01-28 21:51:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 367 transitions. [2018-01-28 21:51:44,819 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 367 transitions. Word has length 48 [2018-01-28 21:51:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:44,820 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 367 transitions. [2018-01-28 21:51:44,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 21:51:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 367 transitions. [2018-01-28 21:51:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:51:44,820 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:44,821 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:44,821 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash -447409978, now seen corresponding path program 1 times [2018-01-28 21:51:44,821 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:44,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:44,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:44,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:44,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:44,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:44,998 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-28 21:51:44,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:44,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:51:44,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:51:44,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:51:44,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:51:44,999 INFO L87 Difference]: Start difference. First operand 339 states and 367 transitions. Second operand 9 states. [2018-01-28 21:51:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:45,408 INFO L93 Difference]: Finished difference Result 376 states and 407 transitions. [2018-01-28 21:51:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:51:45,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-28 21:51:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:45,410 INFO L225 Difference]: With dead ends: 376 [2018-01-28 21:51:45,410 INFO L226 Difference]: Without dead ends: 375 [2018-01-28 21:51:45,411 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:51:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-28 21:51:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 338. [2018-01-28 21:51:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-01-28 21:51:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 366 transitions. [2018-01-28 21:51:45,427 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 366 transitions. Word has length 49 [2018-01-28 21:51:45,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:45,427 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 366 transitions. [2018-01-28 21:51:45,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:51:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 366 transitions. [2018-01-28 21:51:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:51:45,428 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:45,428 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:45,428 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash -447409977, now seen corresponding path program 1 times [2018-01-28 21:51:45,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:45,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:45,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:45,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:45,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:45,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:45,618 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-28 21:51:45,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:45,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:51:45,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:51:45,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:51:45,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:51:45,621 INFO L87 Difference]: Start difference. First operand 338 states and 366 transitions. Second operand 9 states. [2018-01-28 21:51:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:46,191 INFO L93 Difference]: Finished difference Result 375 states and 406 transitions. [2018-01-28 21:51:46,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:51:46,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-28 21:51:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:46,228 INFO L225 Difference]: With dead ends: 375 [2018-01-28 21:51:46,228 INFO L226 Difference]: Without dead ends: 374 [2018-01-28 21:51:46,228 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:51:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-01-28 21:51:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 337. [2018-01-28 21:51:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-01-28 21:51:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 365 transitions. [2018-01-28 21:51:46,242 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 365 transitions. Word has length 49 [2018-01-28 21:51:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:46,242 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 365 transitions. [2018-01-28 21:51:46,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:51:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 365 transitions. [2018-01-28 21:51:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 21:51:46,243 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:46,243 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:46,244 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash -914646706, now seen corresponding path program 2 times [2018-01-28 21:51:46,244 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:46,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:46,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:46,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:46,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:46,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:46,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:51:46,616 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:51:46,621 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:51:46,632 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:51:46,645 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:51:46,648 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:51:46,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:51:46,675 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 6 treesize of output 5 [2018-01-28 21:51:46,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:46,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:46,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:51:46,728 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-28 21:51:46,729 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-28 21:51:46,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:46,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:46,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:46,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-28 21:51:46,855 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 29 treesize of output 22 [2018-01-28 21:51:46,858 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:51:46,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:46,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-01-28 21:51:46,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:46,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:46,903 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-28 21:51:46,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-01-28 21:51:46,967 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 38 treesize of output 29 [2018-01-28 21:51:46,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:46,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:46,973 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:51:46,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2018-01-28 21:51:46,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:46,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:46,994 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-28 21:51:46,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:16 [2018-01-28 21:51:47,055 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 17 treesize of output 13 [2018-01-28 21:51:47,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-28 21:51:47,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:47,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:47,087 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-28 21:51:47,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:5 [2018-01-28 21:51:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:47,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:51:47,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-01-28 21:51:47,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-28 21:51:47,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-28 21:51:47,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-01-28 21:51:47,172 INFO L87 Difference]: Start difference. First operand 337 states and 365 transitions. Second operand 32 states. [2018-01-28 21:51:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:49,015 INFO L93 Difference]: Finished difference Result 508 states and 548 transitions. [2018-01-28 21:51:49,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-28 21:51:49,015 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-01-28 21:51:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:49,017 INFO L225 Difference]: With dead ends: 508 [2018-01-28 21:51:49,017 INFO L226 Difference]: Without dead ends: 507 [2018-01-28 21:51:49,018 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=848, Invalid=4264, Unknown=0, NotChecked=0, Total=5112 [2018-01-28 21:51:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-01-28 21:51:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 377. [2018-01-28 21:51:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-01-28 21:51:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 408 transitions. [2018-01-28 21:51:49,035 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 408 transitions. Word has length 62 [2018-01-28 21:51:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:49,044 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 408 transitions. [2018-01-28 21:51:49,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-28 21:51:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 408 transitions. [2018-01-28 21:51:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 21:51:49,045 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:49,046 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:49,046 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash -914646705, now seen corresponding path program 1 times [2018-01-28 21:51:49,046 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:49,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:49,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:49,047 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:51:49,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:49,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:49,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:51:49,299 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-28 21:51:49,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:49,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:51:49,347 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-28 21:51:49,349 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-28 21:51:49,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,412 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-28 21:51:49,415 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-28 21:51:49,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-28 21:51:49,498 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 21 treesize of output 16 [2018-01-28 21:51:49,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:49,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:51:49,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,518 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 21 treesize of output 16 [2018-01-28 21:51:49,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:49,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:51:49,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:32 [2018-01-28 21:51:49,538 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:51:49,538 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 23 treesize of output 25 [2018-01-28 21:51:49,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-01-28 21:51:49,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:49,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-01-28 21:51:49,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-01-28 21:51:49,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:26 [2018-01-28 21:51:49,697 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 34 treesize of output 25 [2018-01-28 21:51:49,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:49,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-01-28 21:51:49,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,716 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 27 treesize of output 20 [2018-01-28 21:51:49,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:49,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-01-28 21:51:49,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:52 [2018-01-28 21:51:49,758 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 36 treesize of output 27 [2018-01-28 21:51:49,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:49,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-28 21:51:49,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,779 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 36 treesize of output 27 [2018-01-28 21:51:49,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:49,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-28 21:51:49,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:22 [2018-01-28 21:51:49,836 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 15 treesize of output 11 [2018-01-28 21:51:49,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 21:51:49,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,845 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 15 treesize of output 11 [2018-01-28 21:51:49,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 21:51:49,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:49,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:14 [2018-01-28 21:51:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:49,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:51:49,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-01-28 21:51:49,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 21:51:49,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 21:51:49,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-01-28 21:51:49,975 INFO L87 Difference]: Start difference. First operand 377 states and 408 transitions. Second operand 30 states. [2018-01-28 21:51:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:51,890 INFO L93 Difference]: Finished difference Result 937 states and 1016 transitions. [2018-01-28 21:51:51,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-28 21:51:51,916 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2018-01-28 21:51:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:51,919 INFO L225 Difference]: With dead ends: 937 [2018-01-28 21:51:51,919 INFO L226 Difference]: Without dead ends: 829 [2018-01-28 21:51:51,921 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2435 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=762, Invalid=7070, Unknown=0, NotChecked=0, Total=7832 [2018-01-28 21:51:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-01-28 21:51:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 530. [2018-01-28 21:51:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-01-28 21:51:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 586 transitions. [2018-01-28 21:51:51,950 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 586 transitions. Word has length 62 [2018-01-28 21:51:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:51,950 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 586 transitions. [2018-01-28 21:51:51,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-28 21:51:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 586 transitions. [2018-01-28 21:51:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-28 21:51:51,952 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:51,952 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:51,952 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1710722377, now seen corresponding path program 1 times [2018-01-28 21:51:51,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:51,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:51,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:51,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:51,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:51,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:52,070 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-28 21:51:52,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:51:52,070 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-28 21:51:52,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:52,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:51:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-28 21:51:52,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:51:52,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-28 21:51:52,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:51:52,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:51:52,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:51:52,188 INFO L87 Difference]: Start difference. First operand 530 states and 586 transitions. Second operand 4 states. [2018-01-28 21:51:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:52,442 INFO L93 Difference]: Finished difference Result 723 states and 788 transitions. [2018-01-28 21:51:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:51:52,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-01-28 21:51:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:52,444 INFO L225 Difference]: With dead ends: 723 [2018-01-28 21:51:52,444 INFO L226 Difference]: Without dead ends: 652 [2018-01-28 21:51:52,445 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:51:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-01-28 21:51:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 533. [2018-01-28 21:51:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-01-28 21:51:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 590 transitions. [2018-01-28 21:51:52,461 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 590 transitions. Word has length 63 [2018-01-28 21:51:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:52,462 INFO L432 AbstractCegarLoop]: Abstraction has 533 states and 590 transitions. [2018-01-28 21:51:52,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:51:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 590 transitions. [2018-01-28 21:51:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-28 21:51:52,462 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:52,462 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:52,463 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:52,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1654901868, now seen corresponding path program 1 times [2018-01-28 21:51:52,463 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:52,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:52,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:52,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:52,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:52,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-28 21:51:52,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:52,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:51:52,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:51:52,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:51:52,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:51:52,547 INFO L87 Difference]: Start difference. First operand 533 states and 590 transitions. Second operand 4 states. [2018-01-28 21:51:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:52,662 INFO L93 Difference]: Finished difference Result 551 states and 609 transitions. [2018-01-28 21:51:52,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:51:52,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-01-28 21:51:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:52,664 INFO L225 Difference]: With dead ends: 551 [2018-01-28 21:51:52,664 INFO L226 Difference]: Without dead ends: 548 [2018-01-28 21:51:52,664 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-28 21:51:52,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-01-28 21:51:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 535. [2018-01-28 21:51:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-01-28 21:51:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 594 transitions. [2018-01-28 21:51:52,681 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 594 transitions. Word has length 67 [2018-01-28 21:51:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:52,681 INFO L432 AbstractCegarLoop]: Abstraction has 535 states and 594 transitions. [2018-01-28 21:51:52,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:51:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 594 transitions. [2018-01-28 21:51:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-28 21:51:52,682 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:52,682 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:51:52,682 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1654901869, now seen corresponding path program 1 times [2018-01-28 21:51:52,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:52,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:52,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:52,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:52,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:52,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-28 21:51:52,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:51:52,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:51:52,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:51:52,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:51:52,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:51:52,766 INFO L87 Difference]: Start difference. First operand 535 states and 594 transitions. Second operand 4 states. [2018-01-28 21:51:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:52,881 INFO L93 Difference]: Finished difference Result 542 states and 599 transitions. [2018-01-28 21:51:52,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:51:52,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-01-28 21:51:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:52,883 INFO L225 Difference]: With dead ends: 542 [2018-01-28 21:51:52,883 INFO L226 Difference]: Without dead ends: 539 [2018-01-28 21:51:52,883 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-28 21:51:52,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-01-28 21:51:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 533. [2018-01-28 21:51:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-01-28 21:51:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 591 transitions. [2018-01-28 21:51:52,899 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 591 transitions. Word has length 67 [2018-01-28 21:51:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:52,900 INFO L432 AbstractCegarLoop]: Abstraction has 533 states and 591 transitions. [2018-01-28 21:51:52,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:51:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 591 transitions. [2018-01-28 21:51:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-28 21:51:52,900 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:52,901 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 21:51:52,901 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash 413385737, now seen corresponding path program 1 times [2018-01-28 21:51:52,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:52,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:52,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:52,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:52,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:52,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:53,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:51:53,292 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-28 21:51:53,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:53,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:51:53,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:53,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:53,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-28 21:51:53,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-28 21:51:53,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:51:53,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:51:53,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:51:53,394 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-28 21:51:53,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-01-28 21:51:53,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-01-28 21:51:53,455 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 12 treesize of output 11 [2018-01-28 21:51:53,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-28 21:51:53,478 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 12 treesize of output 11 [2018-01-28 21:51:53,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:51:53,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:58 [2018-01-28 21:51:53,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-01-28 21:51:53,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 21:51:53,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-01-28 21:51:53,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 21:51:53,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:53,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:51:53,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:78 [2018-01-28 21:51:57,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-01-28 21:51:57,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:57,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:51:57,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:64 [2018-01-28 21:51:57,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-01-28 21:51:57,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-01-28 21:51:57,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:57,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:51:57,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:57,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:57,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-28 21:51:57,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 21:51:57,844 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:57,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:51:57,851 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:57,852 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:57,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:51:57,858 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:78, output treesize:26 [2018-01-28 21:51:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:58,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:51:58,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2018-01-28 21:51:58,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 21:51:58,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 21:51:58,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=728, Unknown=2, NotChecked=0, Total=870 [2018-01-28 21:51:58,021 INFO L87 Difference]: Start difference. First operand 533 states and 591 transitions. Second operand 30 states. [2018-01-28 21:52:11,907 WARN L146 SmtUtils]: Spent 2039ms on a formula simplification. DAG size of input: 74 DAG size of output 45 [2018-01-28 21:52:19,963 WARN L146 SmtUtils]: Spent 2030ms on a formula simplification. DAG size of input: 61 DAG size of output 43 [2018-01-28 21:52:22,194 WARN L146 SmtUtils]: Spent 2045ms on a formula simplification. DAG size of input: 72 DAG size of output 48 [2018-01-28 21:52:24,389 WARN L146 SmtUtils]: Spent 2048ms on a formula simplification. DAG size of input: 81 DAG size of output 53 [2018-01-28 21:52:26,475 WARN L146 SmtUtils]: Spent 2056ms on a formula simplification. DAG size of input: 90 DAG size of output 58 [2018-01-28 21:52:28,554 WARN L146 SmtUtils]: Spent 2044ms on a formula simplification. DAG size of input: 81 DAG size of output 53 [2018-01-28 21:52:43,859 WARN L146 SmtUtils]: Spent 2028ms on a formula simplification. DAG size of input: 65 DAG size of output 41 [2018-01-28 21:52:45,932 WARN L146 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 74 DAG size of output 46 [2018-01-28 21:52:47,996 WARN L146 SmtUtils]: Spent 2043ms on a formula simplification. DAG size of input: 83 DAG size of output 51 [2018-01-28 21:52:50,050 WARN L146 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 74 DAG size of output 46 [2018-01-28 21:52:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:52:50,135 INFO L93 Difference]: Finished difference Result 1137 states and 1254 transitions. [2018-01-28 21:52:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-28 21:52:50,136 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 71 [2018-01-28 21:52:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:52:50,140 INFO L225 Difference]: With dead ends: 1137 [2018-01-28 21:52:50,140 INFO L226 Difference]: Without dead ends: 1136 [2018-01-28 21:52:50,142 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=758, Invalid=2533, Unknown=15, NotChecked=0, Total=3306 [2018-01-28 21:52:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2018-01-28 21:52:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 647. [2018-01-28 21:52:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-01-28 21:52:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 730 transitions. [2018-01-28 21:52:50,183 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 730 transitions. Word has length 71 [2018-01-28 21:52:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:52:50,184 INFO L432 AbstractCegarLoop]: Abstraction has 647 states and 730 transitions. [2018-01-28 21:52:50,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-28 21:52:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 730 transitions. [2018-01-28 21:52:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-28 21:52:50,185 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:52:50,185 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 21:52:50,185 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:52:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 413385738, now seen corresponding path program 1 times [2018-01-28 21:52:50,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:52:50,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:52:50,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:52:50,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:52:50,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:52:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:52:50,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:52:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:52:50,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:52:50,616 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-28 21:52:50,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:52:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:52:50,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:52:50,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 6 treesize of output 5 [2018-01-28 21:52:50,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:52:50,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:52:50,668 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:52:50,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-28 21:52:50,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:52:50,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:52:50,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:52:50,694 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-28 21:52:50,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-01-28 21:52:50,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-01-28 21:52:50,720 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 12 treesize of output 11 [2018-01-28 21:52:50,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-28 21:52:50,739 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 12 treesize of output 11 [2018-01-28 21:52:50,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:52:50,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-01-28 21:52:50,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-01-28 21:52:50,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 21:52:50,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-01-28 21:52:50,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 21:52:50,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:50,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:52:50,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-01-28 21:52:54,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-28 21:52:54,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:54,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:52:54,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:59 [2018-01-28 21:52:54,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-01-28 21:52:54,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:52:54,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:54,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-01-28 21:52:54,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:54,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:54,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-28 21:52:54,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 21:52:54,335 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:54,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:52:54,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:54,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:54,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:54,351 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:73, output treesize:17 [2018-01-28 21:52:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:52:54,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:52:54,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2018-01-28 21:52:54,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 21:52:54,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 21:52:54,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=561, Unknown=2, NotChecked=0, Total=650 [2018-01-28 21:52:54,494 INFO L87 Difference]: Start difference. First operand 647 states and 730 transitions. Second operand 26 states. [2018-01-28 21:52:56,819 WARN L146 SmtUtils]: Spent 2036ms on a formula simplification. DAG size of input: 68 DAG size of output 47 [2018-01-28 21:52:58,863 WARN L146 SmtUtils]: Spent 2029ms on a formula simplification. DAG size of input: 61 DAG size of output 45 [2018-01-28 21:53:00,922 WARN L146 SmtUtils]: Spent 2037ms on a formula simplification. DAG size of input: 72 DAG size of output 45 [2018-01-28 21:53:03,134 WARN L146 SmtUtils]: Spent 2039ms on a formula simplification. DAG size of input: 74 DAG size of output 50 [2018-01-28 21:53:05,292 WARN L146 SmtUtils]: Spent 2053ms on a formula simplification. DAG size of input: 85 DAG size of output 57 [2018-01-28 21:53:07,378 WARN L146 SmtUtils]: Spent 2065ms on a formula simplification. DAG size of input: 95 DAG size of output 60 [2018-01-28 21:53:09,454 WARN L146 SmtUtils]: Spent 2052ms on a formula simplification. DAG size of input: 86 DAG size of output 57 [2018-01-28 21:53:12,764 WARN L146 SmtUtils]: Spent 2029ms on a formula simplification. DAG size of input: 67 DAG size of output 43 [2018-01-28 21:53:14,841 WARN L146 SmtUtils]: Spent 2042ms on a formula simplification. DAG size of input: 78 DAG size of output 50 [2018-01-28 21:53:16,944 WARN L146 SmtUtils]: Spent 2083ms on a formula simplification. DAG size of input: 88 DAG size of output 55 [2018-01-28 21:53:19,002 WARN L146 SmtUtils]: Spent 2039ms on a formula simplification. DAG size of input: 79 DAG size of output 50 [2018-01-28 21:53:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:53:19,050 INFO L93 Difference]: Finished difference Result 1081 states and 1188 transitions. [2018-01-28 21:53:19,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-28 21:53:19,051 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 71 [2018-01-28 21:53:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:53:19,053 INFO L225 Difference]: With dead ends: 1081 [2018-01-28 21:53:19,054 INFO L226 Difference]: Without dead ends: 1077 [2018-01-28 21:53:19,054 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=439, Invalid=1911, Unknown=2, NotChecked=0, Total=2352 [2018-01-28 21:53:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-01-28 21:53:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 654. [2018-01-28 21:53:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-01-28 21:53:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 737 transitions. [2018-01-28 21:53:19,079 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 737 transitions. Word has length 71 [2018-01-28 21:53:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:53:19,079 INFO L432 AbstractCegarLoop]: Abstraction has 654 states and 737 transitions. [2018-01-28 21:53:19,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 21:53:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 737 transitions. [2018-01-28 21:53:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-28 21:53:19,080 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:53:19,080 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 21:53:19,080 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:53:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 6120071, now seen corresponding path program 1 times [2018-01-28 21:53:19,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:53:19,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:53:19,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:53:19,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:53:19,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:53:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:53:19,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:53:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:53:19,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:53:19,591 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-28 21:53:19,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:53:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:53:19,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:53:19,658 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-28 21:53:19,660 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-28 21:53:19,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,668 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-28 21:53:19,671 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-28 21:53:19,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-01-28 21:53:19,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:19,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:19,781 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:53:19,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:19,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-01-28 21:53:19,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-01-28 21:53:19,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:19,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:53:19,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-01-28 21:53:19,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:19,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:53:19,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:19,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:19,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:57, output treesize:39 [2018-01-28 21:53:19,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-28 21:53:19,980 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 12 treesize of output 11 [2018-01-28 21:53:19,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:20,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:20,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-01-28 21:53:20,031 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 12 treesize of output 11 [2018-01-28 21:53:20,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:20,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:20,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:20,050 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:61 [2018-01-28 21:53:20,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-01-28 21:53:20,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 21:53:20,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:20,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:20,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-01-28 21:53:20,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 21:53:20,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:20,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:20,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:20,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:87 [2018-01-28 21:53:24,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-01-28 21:53:24,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:53:24,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:24,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:24,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:24,382 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:53:24,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-01-28 21:53:24,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:24,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:24,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-28 21:53:24,405 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:53:24,405 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 21:53:24,405 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:24,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:53:24,411 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:24,412 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:24,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:24,418 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:80, output treesize:7 [2018-01-28 21:53:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 21:53:24,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:53:24,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 30 [2018-01-28 21:53:24,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 21:53:24,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 21:53:24,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=770, Unknown=2, NotChecked=0, Total=870 [2018-01-28 21:53:24,486 INFO L87 Difference]: Start difference. First operand 654 states and 737 transitions. Second operand 30 states. [2018-01-28 21:53:35,230 WARN L146 SmtUtils]: Spent 2049ms on a formula simplification. DAG size of input: 83 DAG size of output 47 [2018-01-28 21:53:42,107 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 78 DAG size of output 51 [2018-01-28 21:53:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:53:42,651 INFO L93 Difference]: Finished difference Result 1276 states and 1427 transitions. [2018-01-28 21:53:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 21:53:42,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 71 [2018-01-28 21:53:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:53:42,653 INFO L225 Difference]: With dead ends: 1276 [2018-01-28 21:53:42,653 INFO L226 Difference]: Without dead ends: 633 [2018-01-28 21:53:42,655 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=685, Invalid=2168, Unknown=9, NotChecked=0, Total=2862 [2018-01-28 21:53:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-01-28 21:53:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 598. [2018-01-28 21:53:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-01-28 21:53:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 662 transitions. [2018-01-28 21:53:42,675 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 662 transitions. Word has length 71 [2018-01-28 21:53:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:53:42,675 INFO L432 AbstractCegarLoop]: Abstraction has 598 states and 662 transitions. [2018-01-28 21:53:42,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-28 21:53:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 662 transitions. [2018-01-28 21:53:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 21:53:42,676 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:53:42,676 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 21:53:42,676 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:53:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash -166348644, now seen corresponding path program 1 times [2018-01-28 21:53:42,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:53:42,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:53:42,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:53:42,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:53:42,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:53:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:53:42,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:53:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:53:42,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:53:42,993 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-28 21:53:42,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:53:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:53:43,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:53:43,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:43,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:43,152 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:53:43,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2018-01-28 21:53:43,184 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 21 treesize of output 16 [2018-01-28 21:53:43,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:43,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:53:43,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,207 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 21 treesize of output 16 [2018-01-28 21:53:43,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:43,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:53:43,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,224 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2018-01-28 21:53:43,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 68 [2018-01-28 21:53:43,305 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 14 treesize of output 13 [2018-01-28 21:53:43,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-01-28 21:53:43,330 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 14 treesize of output 13 [2018-01-28 21:53:43,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:43,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:63 [2018-01-28 21:53:43,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 80 [2018-01-28 21:53:43,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-28 21:53:43,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-01-28 21:53:43,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-28 21:53:43,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:43,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:43,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:87 [2018-01-28 21:53:49,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-01-28 21:53:49,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:53:49,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:49,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:53:49,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-01-28 21:53:49,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:49,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:53:49,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-28 21:53:49,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 21:53:49,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:49,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:53:49,674 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:53:49,675 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:49,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:53:49,680 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:7 [2018-01-28 21:53:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:53:49,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:53:49,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 30 [2018-01-28 21:53:49,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 21:53:49,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 21:53:49,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=732, Unknown=3, NotChecked=0, Total=870 [2018-01-28 21:53:49,744 INFO L87 Difference]: Start difference. First operand 598 states and 662 transitions. Second operand 30 states. Received shutdown request... [2018-01-28 21:53:58,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 21:53:58,406 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:53:58,413 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:53:58,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:53:58 BoogieIcfgContainer [2018-01-28 21:53:58,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:53:58,414 INFO L168 Benchmark]: Toolchain (without parser) took 144124.33 ms. Allocated memory was 310.9 MB in the beginning and 652.7 MB in the end (delta: 341.8 MB). Free memory was 270.9 MB in the beginning and 392.8 MB in the end (delta: -121.8 MB). Peak memory consumption was 220.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:53:58,415 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 310.9 MB. Free memory is still 276.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:53:58,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.73 ms. Allocated memory is still 310.9 MB. Free memory was 269.9 MB in the beginning and 258.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-01-28 21:53:58,416 INFO L168 Benchmark]: Boogie Preprocessor took 40.21 ms. Allocated memory is still 310.9 MB. Free memory was 258.8 MB in the beginning and 256.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:53:58,416 INFO L168 Benchmark]: RCFGBuilder took 603.09 ms. Allocated memory is still 310.9 MB. Free memory was 256.8 MB in the beginning and 208.5 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 5.3 GB. [2018-01-28 21:53:58,416 INFO L168 Benchmark]: TraceAbstraction took 143262.05 ms. Allocated memory was 310.9 MB in the beginning and 652.7 MB in the end (delta: 341.8 MB). Free memory was 208.5 MB in the beginning and 392.8 MB in the end (delta: -184.3 MB). Peak memory consumption was 157.6 MB. Max. memory is 5.3 GB. [2018-01-28 21:53:58,418 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.16 ms. Allocated memory is still 310.9 MB. Free memory is still 276.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.73 ms. Allocated memory is still 310.9 MB. Free memory was 269.9 MB in the beginning and 258.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.21 ms. Allocated memory is still 310.9 MB. Free memory was 258.8 MB in the beginning and 256.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 603.09 ms. Allocated memory is still 310.9 MB. Free memory was 256.8 MB in the beginning and 208.5 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 143262.05 ms. Allocated memory was 310.9 MB in the beginning and 652.7 MB in the end (delta: 341.8 MB). Free memory was 208.5 MB in the beginning and 392.8 MB in the end (delta: -184.3 MB). Peak memory consumption was 157.6 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 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (598states) and interpolant automaton (currently 22 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 221 locations, 75 error locations. TIMEOUT Result, 143.1s OverallTime, 32 OverallIterations, 4 TraceHistogramMax, 115.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6066 SDtfs, 16366 SDslu, 26460 SDs, 0 SdLazy, 18613 SolverSat, 1088 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 23.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1102 GetRequests, 496 SyntacticMatches, 44 SemanticMatches, 561 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6054 ImplicationChecksByTransitivity, 107.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=654occurred in iteration=30, 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.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 3519 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 1951 NumberOfCodeBlocks, 1951 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1910 ConstructedInterpolants, 111 QuantifiedInterpolants, 1247011 SizeOfPredicates, 181 NumberOfNonLiveVariables, 1920 ConjunctsInSsa, 336 ConjunctsInUnsatCore, 41 InterpolantComputations, 25 PerfectInterpolantSequences, 224/481 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/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-53-58-428.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-53-58-428.csv Completed graceful shutdown