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.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:38:12,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:38:12,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:38:12,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:38:12,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:38:12,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:38:12,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:38:12,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:38:12,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:38:12,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:38:12,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:38:12,401 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:38:12,402 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:38:12,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:38:12,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:38:12,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:38:12,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:38:12,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:38:12,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:38:12,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:38:12,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:38:12,416 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:38:12,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:38:12,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:38:12,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:38:12,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:38:12,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:38:12,420 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:38:12,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:38:12,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:38:12,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:38:12,421 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.epf [2018-01-24 12:38:12,431 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:38:12,431 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:38:12,432 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:38:12,432 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:38:12,433 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:38:12,433 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:38:12,433 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:38:12,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:38:12,434 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:38:12,434 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:38:12,434 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:38:12,434 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:38:12,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:38:12,435 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:38:12,435 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:38:12,435 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:38:12,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:38:12,436 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:38:12,436 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:38:12,436 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:38:12,436 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:38:12,436 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:38:12,437 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:38:12,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:38:12,437 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:38:12,437 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:38:12,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:38:12,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:38:12,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:38:12,438 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:38:12,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:38:12,438 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:38:12,439 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:38:12,440 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:38:12,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:38:12,487 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:38:12,491 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:38:12,493 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:38:12,493 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:38:12,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:38:12,674 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:38:12,680 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:38:12,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:38:12,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:38:12,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:38:12,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:38:12" (1/1) ... [2018-01-24 12:38:12,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ea857c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12, skipping insertion in model container [2018-01-24 12:38:12,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:38:12" (1/1) ... [2018-01-24 12:38:12,701 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:38:12,743 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:38:12,860 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:38:12,888 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:38:12,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12 WrapperNode [2018-01-24 12:38:12,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:38:12,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:38:12,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:38:12,897 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:38:12,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12" (1/1) ... [2018-01-24 12:38:12,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12" (1/1) ... [2018-01-24 12:38:12,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12" (1/1) ... [2018-01-24 12:38:12,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12" (1/1) ... [2018-01-24 12:38:12,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12" (1/1) ... [2018-01-24 12:38:12,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12" (1/1) ... [2018-01-24 12:38:12,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12" (1/1) ... [2018-01-24 12:38:12,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:38:12,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:38:12,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:38:12,935 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:38:12,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12" (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-24 12:38:12,980 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:38:12,980 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:38:12,980 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:38:12,980 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:38:12,980 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:38:12,980 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:38:12,980 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:38:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:38:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:38:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:38:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:38:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 12:38:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:38:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:38:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:38:13,613 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:38:13,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:38:13 BoogieIcfgContainer [2018-01-24 12:38:13,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:38:13,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:38:13,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:38:13,618 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:38:13,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:38:12" (1/3) ... [2018-01-24 12:38:13,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3ef7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:38:13, skipping insertion in model container [2018-01-24 12:38:13,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:12" (2/3) ... [2018-01-24 12:38:13,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3ef7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:38:13, skipping insertion in model container [2018-01-24 12:38:13,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:38:13" (3/3) ... [2018-01-24 12:38:13,623 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:38:13,632 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:38:13,641 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-01-24 12:38:13,693 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:38:13,693 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:38:13,694 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:38:13,694 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:38:13,694 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:38:13,694 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:38:13,694 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:38:13,695 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:38:13,695 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:38:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2018-01-24 12:38:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:38:13,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:13,726 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:13,727 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1781428784, now seen corresponding path program 1 times [2018-01-24 12:38:13,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:13,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:13,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:13,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:13,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:13,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:13,856 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-24 12:38:13,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:13,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:38:13,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:38:13,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:38:13,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:38:13,879 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 4 states. [2018-01-24 12:38:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:14,194 INFO L93 Difference]: Finished difference Result 384 states and 511 transitions. [2018-01-24 12:38:14,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:38:14,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:38:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:14,209 INFO L225 Difference]: With dead ends: 384 [2018-01-24 12:38:14,209 INFO L226 Difference]: Without dead ends: 206 [2018-01-24 12:38:14,214 INFO L525 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-24 12:38:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-24 12:38:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2018-01-24 12:38:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-24 12:38:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2018-01-24 12:38:14,264 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 8 [2018-01-24 12:38:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:14,265 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2018-01-24 12:38:14,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:38:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2018-01-24 12:38:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:38:14,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:14,266 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:14,266 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1781428785, now seen corresponding path program 1 times [2018-01-24 12:38:14,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:14,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:14,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:14,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:14,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:14,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:14,391 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-24 12:38:14,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:14,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:38:14,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:38:14,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:38:14,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:38:14,394 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 4 states. [2018-01-24 12:38:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:14,616 INFO L93 Difference]: Finished difference Result 209 states and 221 transitions. [2018-01-24 12:38:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:38:14,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:38:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:14,618 INFO L225 Difference]: With dead ends: 209 [2018-01-24 12:38:14,618 INFO L226 Difference]: Without dead ends: 199 [2018-01-24 12:38:14,619 INFO L525 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-24 12:38:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-24 12:38:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 188. [2018-01-24 12:38:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-24 12:38:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2018-01-24 12:38:14,631 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 8 [2018-01-24 12:38:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:14,631 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2018-01-24 12:38:14,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:38:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2018-01-24 12:38:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:38:14,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:14,632 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:14,632 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1247402511, now seen corresponding path program 1 times [2018-01-24 12:38:14,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:14,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:14,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:14,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:14,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:14,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:14,687 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-24 12:38:14,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:14,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:38:14,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:14,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:14,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:14,688 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand 5 states. [2018-01-24 12:38:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:15,092 INFO L93 Difference]: Finished difference Result 320 states and 347 transitions. [2018-01-24 12:38:15,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:38:15,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:38:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:15,095 INFO L225 Difference]: With dead ends: 320 [2018-01-24 12:38:15,095 INFO L226 Difference]: Without dead ends: 319 [2018-01-24 12:38:15,096 INFO L525 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-24 12:38:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-24 12:38:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 187. [2018-01-24 12:38:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-24 12:38:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 206 transitions. [2018-01-24 12:38:15,113 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 206 transitions. Word has length 17 [2018-01-24 12:38:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:15,113 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 206 transitions. [2018-01-24 12:38:15,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 206 transitions. [2018-01-24 12:38:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:38:15,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:15,114 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:15,115 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:15,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1247402512, now seen corresponding path program 1 times [2018-01-24 12:38:15,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:15,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:15,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:15,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:15,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:15,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:15,206 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-24 12:38:15,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:15,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:38:15,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:15,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:15,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:15,208 INFO L87 Difference]: Start difference. First operand 187 states and 206 transitions. Second operand 5 states. [2018-01-24 12:38:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:15,438 INFO L93 Difference]: Finished difference Result 349 states and 386 transitions. [2018-01-24 12:38:15,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:38:15,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:38:15,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:15,440 INFO L225 Difference]: With dead ends: 349 [2018-01-24 12:38:15,440 INFO L226 Difference]: Without dead ends: 348 [2018-01-24 12:38:15,440 INFO L525 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-24 12:38:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-24 12:38:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 186. [2018-01-24 12:38:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-24 12:38:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-01-24 12:38:15,454 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 17 [2018-01-24 12:38:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:15,454 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-01-24 12:38:15,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-01-24 12:38:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:38:15,455 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:15,455 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:15,455 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1311177125, now seen corresponding path program 1 times [2018-01-24 12:38:15,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:15,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:15,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:15,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:15,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:15,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:15,599 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-24 12:38:15,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:15,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:38:15,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:38:15,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:38:15,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:38:15,601 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 8 states. [2018-01-24 12:38:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:16,086 INFO L93 Difference]: Finished difference Result 323 states and 348 transitions. [2018-01-24 12:38:16,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:38:16,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 12:38:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:16,088 INFO L225 Difference]: With dead ends: 323 [2018-01-24 12:38:16,088 INFO L226 Difference]: Without dead ends: 322 [2018-01-24 12:38:16,089 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:38:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-24 12:38:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 185. [2018-01-24 12:38:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-24 12:38:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 204 transitions. [2018-01-24 12:38:16,103 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 204 transitions. Word has length 20 [2018-01-24 12:38:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:16,103 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 204 transitions. [2018-01-24 12:38:16,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:38:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 204 transitions. [2018-01-24 12:38:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:38:16,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:16,105 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:16,105 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1311177126, now seen corresponding path program 1 times [2018-01-24 12:38:16,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:16,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:16,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:16,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:16,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:16,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:16,333 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-24 12:38:16,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:16,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:38:16,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:38:16,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:38:16,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:38:16,370 INFO L87 Difference]: Start difference. First operand 185 states and 204 transitions. Second operand 8 states. [2018-01-24 12:38:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:17,084 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2018-01-24 12:38:17,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:38:17,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 12:38:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:17,086 INFO L225 Difference]: With dead ends: 325 [2018-01-24 12:38:17,086 INFO L226 Difference]: Without dead ends: 324 [2018-01-24 12:38:17,087 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:38:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-01-24 12:38:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 184. [2018-01-24 12:38:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-24 12:38:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2018-01-24 12:38:17,095 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 20 [2018-01-24 12:38:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:17,096 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2018-01-24 12:38:17,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:38:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2018-01-24 12:38:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:38:17,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:17,097 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:17,097 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1745739826, now seen corresponding path program 1 times [2018-01-24 12:38:17,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:17,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:17,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:17,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:17,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:17,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:17,213 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-24 12:38:17,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:17,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:17,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:17,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:17,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:17,214 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand 5 states. [2018-01-24 12:38:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:17,350 INFO L93 Difference]: Finished difference Result 428 states and 470 transitions. [2018-01-24 12:38:17,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:38:17,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 12:38:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:17,352 INFO L225 Difference]: With dead ends: 428 [2018-01-24 12:38:17,352 INFO L226 Difference]: Without dead ends: 272 [2018-01-24 12:38:17,353 INFO L525 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-24 12:38:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-24 12:38:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 188. [2018-01-24 12:38:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-24 12:38:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2018-01-24 12:38:17,364 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 26 [2018-01-24 12:38:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:17,364 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2018-01-24 12:38:17,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2018-01-24 12:38:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:38:17,366 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:17,366 INFO L322 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] [2018-01-24 12:38:17,366 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash 33879827, now seen corresponding path program 1 times [2018-01-24 12:38:17,367 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:17,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:17,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:17,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:17,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:17,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:17,538 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-24 12:38:17,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:17,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:38:17,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:17,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:17,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:17,539 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand 5 states. [2018-01-24 12:38:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:17,657 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-01-24 12:38:17,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:38:17,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 12:38:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:17,658 INFO L225 Difference]: With dead ends: 210 [2018-01-24 12:38:17,659 INFO L226 Difference]: Without dead ends: 198 [2018-01-24 12:38:17,659 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:38:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-24 12:38:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2018-01-24 12:38:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-24 12:38:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-01-24 12:38:17,666 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 28 [2018-01-24 12:38:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:17,667 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-01-24 12:38:17,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-01-24 12:38:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:38:17,668 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:17,668 INFO L322 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] [2018-01-24 12:38:17,668 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 33879828, now seen corresponding path program 1 times [2018-01-24 12:38:17,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:17,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:17,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:17,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:17,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:17,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:17,761 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-24 12:38:17,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:17,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:38:17,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:38:17,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:38:17,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:38:17,762 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 7 states. [2018-01-24 12:38:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:18,041 INFO L93 Difference]: Finished difference Result 236 states and 251 transitions. [2018-01-24 12:38:18,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:38:18,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-24 12:38:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:18,043 INFO L225 Difference]: With dead ends: 236 [2018-01-24 12:38:18,043 INFO L226 Difference]: Without dead ends: 232 [2018-01-24 12:38:18,044 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:38:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-24 12:38:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 207. [2018-01-24 12:38:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-24 12:38:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 234 transitions. [2018-01-24 12:38:18,056 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 234 transitions. Word has length 28 [2018-01-24 12:38:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:18,056 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 234 transitions. [2018-01-24 12:38:18,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:38:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 234 transitions. [2018-01-24 12:38:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:38:18,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:18,058 INFO L322 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] [2018-01-24 12:38:18,058 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash -3315817, now seen corresponding path program 1 times [2018-01-24 12:38:18,058 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:18,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:18,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:18,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:18,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:18,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:18,139 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-24 12:38:18,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:18,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:18,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:38:18,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:38:18,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:38:18,141 INFO L87 Difference]: Start difference. First operand 207 states and 234 transitions. Second operand 6 states. [2018-01-24 12:38:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:18,394 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2018-01-24 12:38:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:38:18,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 12:38:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:18,396 INFO L225 Difference]: With dead ends: 296 [2018-01-24 12:38:18,396 INFO L226 Difference]: Without dead ends: 295 [2018-01-24 12:38:18,396 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:38:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-01-24 12:38:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 206. [2018-01-24 12:38:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 12:38:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 233 transitions. [2018-01-24 12:38:18,406 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 233 transitions. Word has length 31 [2018-01-24 12:38:18,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:18,406 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 233 transitions. [2018-01-24 12:38:18,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:38:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 233 transitions. [2018-01-24 12:38:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:38:18,407 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:18,407 INFO L322 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] [2018-01-24 12:38:18,407 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash -3315816, now seen corresponding path program 1 times [2018-01-24 12:38:18,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:18,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:18,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:18,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:18,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:18,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:18,497 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-24 12:38:18,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:18,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:18,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:38:18,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:38:18,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:38:18,499 INFO L87 Difference]: Start difference. First operand 206 states and 233 transitions. Second operand 6 states. [2018-01-24 12:38:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:18,910 INFO L93 Difference]: Finished difference Result 326 states and 374 transitions. [2018-01-24 12:38:18,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:38:18,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 12:38:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:18,912 INFO L225 Difference]: With dead ends: 326 [2018-01-24 12:38:18,912 INFO L226 Difference]: Without dead ends: 317 [2018-01-24 12:38:18,913 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:38:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-24 12:38:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 191. [2018-01-24 12:38:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-24 12:38:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2018-01-24 12:38:18,923 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 31 [2018-01-24 12:38:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:18,924 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2018-01-24 12:38:18,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:38:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2018-01-24 12:38:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 12:38:18,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:18,925 INFO L322 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] [2018-01-24 12:38:18,925 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash 253584673, now seen corresponding path program 1 times [2018-01-24 12:38:18,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:18,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:18,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:18,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:18,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:18,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:18,969 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-24 12:38:18,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:18,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:18,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:18,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:18,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:18,970 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 5 states. [2018-01-24 12:38:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:19,227 INFO L93 Difference]: Finished difference Result 269 states and 294 transitions. [2018-01-24 12:38:19,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:38:19,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-24 12:38:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:19,229 INFO L225 Difference]: With dead ends: 269 [2018-01-24 12:38:19,229 INFO L226 Difference]: Without dead ends: 212 [2018-01-24 12:38:19,230 INFO L525 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-24 12:38:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-24 12:38:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 191. [2018-01-24 12:38:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-24 12:38:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 215 transitions. [2018-01-24 12:38:19,239 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 215 transitions. Word has length 36 [2018-01-24 12:38:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:19,239 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 215 transitions. [2018-01-24 12:38:19,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 215 transitions. [2018-01-24 12:38:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:38:19,240 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:19,240 INFO L322 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] [2018-01-24 12:38:19,240 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:19,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1898871922, now seen corresponding path program 1 times [2018-01-24 12:38:19,241 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:19,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:19,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:19,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:19,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:19,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:19,629 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-24 12:38:19,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:19,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:38:19,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:38:19,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:38:19,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:38:19,631 INFO L87 Difference]: Start difference. First operand 191 states and 215 transitions. Second operand 10 states. [2018-01-24 12:38:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:20,251 INFO L93 Difference]: Finished difference Result 420 states and 467 transitions. [2018-01-24 12:38:20,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:38:20,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 12:38:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:20,253 INFO L225 Difference]: With dead ends: 420 [2018-01-24 12:38:20,253 INFO L226 Difference]: Without dead ends: 309 [2018-01-24 12:38:20,254 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:38:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-24 12:38:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 232. [2018-01-24 12:38:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-01-24 12:38:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 260 transitions. [2018-01-24 12:38:20,266 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 260 transitions. Word has length 42 [2018-01-24 12:38:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:20,266 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 260 transitions. [2018-01-24 12:38:20,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:38:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 260 transitions. [2018-01-24 12:38:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:38:20,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:20,267 INFO L322 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] [2018-01-24 12:38:20,267 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1781092500, now seen corresponding path program 1 times [2018-01-24 12:38:20,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:20,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:20,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:20,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:20,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:20,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:20,328 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-24 12:38:20,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:20,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:38:20,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:20,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:20,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:20,329 INFO L87 Difference]: Start difference. First operand 232 states and 260 transitions. Second operand 5 states. [2018-01-24 12:38:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:20,571 INFO L93 Difference]: Finished difference Result 344 states and 387 transitions. [2018-01-24 12:38:20,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:38:20,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-24 12:38:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:20,573 INFO L225 Difference]: With dead ends: 344 [2018-01-24 12:38:20,573 INFO L226 Difference]: Without dead ends: 343 [2018-01-24 12:38:20,573 INFO L525 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-24 12:38:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-24 12:38:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 231. [2018-01-24 12:38:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-24 12:38:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 259 transitions. [2018-01-24 12:38:20,583 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 259 transitions. Word has length 43 [2018-01-24 12:38:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:20,584 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 259 transitions. [2018-01-24 12:38:20,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 259 transitions. [2018-01-24 12:38:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:38:20,585 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:20,585 INFO L322 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] [2018-01-24 12:38:20,585 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:20,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1781092501, now seen corresponding path program 1 times [2018-01-24 12:38:20,586 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:20,586 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:20,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:20,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:20,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:20,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:20,684 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-24 12:38:20,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:20,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:38:20,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:20,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:20,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:20,685 INFO L87 Difference]: Start difference. First operand 231 states and 259 transitions. Second operand 5 states. [2018-01-24 12:38:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:20,954 INFO L93 Difference]: Finished difference Result 376 states and 426 transitions. [2018-01-24 12:38:20,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:38:20,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-24 12:38:20,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:20,956 INFO L225 Difference]: With dead ends: 376 [2018-01-24 12:38:20,957 INFO L226 Difference]: Without dead ends: 375 [2018-01-24 12:38:20,957 INFO L525 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-24 12:38:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-24 12:38:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 230. [2018-01-24 12:38:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-24 12:38:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 258 transitions. [2018-01-24 12:38:20,972 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 258 transitions. Word has length 43 [2018-01-24 12:38:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:20,972 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 258 transitions. [2018-01-24 12:38:20,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 258 transitions. [2018-01-24 12:38:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:38:20,973 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:20,973 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:20,973 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:20,973 INFO L82 PathProgramCache]: Analyzing trace with hash -661031902, now seen corresponding path program 1 times [2018-01-24 12:38:20,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:20,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:20,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:20,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:20,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:20,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:21,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:38:21,096 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-24 12:38:21,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:21,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:38:21,273 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 11 treesize of output 8 [2018-01-24 12:38:21,276 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-24 12:38:21,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,289 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 11 treesize of output 8 [2018-01-24 12:38:21,291 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-24 12:38:21,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-24 12:38:21,323 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-24 12:38:21,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:21,331 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-24 12:38:21,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,355 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-24 12:38:21,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:21,390 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-24 12:38:21,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-24 12:38:21,506 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 24 treesize of output 18 [2018-01-24 12:38:21,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:21,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2018-01-24 12:38:21,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,527 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 24 treesize of output 18 [2018-01-24 12:38:21,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:21,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2018-01-24 12:38:21,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:21,543 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-24 12:38:21,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-01-24 12:38:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:21,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:38:21,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-01-24 12:38:21,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:38:21,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:38:21,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:38:21,577 INFO L87 Difference]: Start difference. First operand 230 states and 258 transitions. Second operand 11 states. [2018-01-24 12:38:22,017 WARN L143 SmtUtils]: Spent 124ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-24 12:38:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:22,839 INFO L93 Difference]: Finished difference Result 461 states and 503 transitions. [2018-01-24 12:38:22,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:38:22,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-01-24 12:38:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:22,841 INFO L225 Difference]: With dead ends: 461 [2018-01-24 12:38:22,841 INFO L226 Difference]: Without dead ends: 370 [2018-01-24 12:38:22,842 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:38:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-01-24 12:38:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 274. [2018-01-24 12:38:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-01-24 12:38:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 311 transitions. [2018-01-24 12:38:22,868 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 311 transitions. Word has length 44 [2018-01-24 12:38:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:22,868 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 311 transitions. [2018-01-24 12:38:22,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:38:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 311 transitions. [2018-01-24 12:38:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:38:22,869 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:22,869 INFO L322 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-24 12:38:22,869 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:22,869 INFO L82 PathProgramCache]: Analyzing trace with hash 500825813, now seen corresponding path program 1 times [2018-01-24 12:38:22,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:22,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:22,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:22,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:22,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:22,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:22,994 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-24 12:38:22,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:22,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:38:22,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:38:22,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:38:22,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:38:22,996 INFO L87 Difference]: Start difference. First operand 274 states and 311 transitions. Second operand 8 states. [2018-01-24 12:38:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:23,498 INFO L93 Difference]: Finished difference Result 292 states and 331 transitions. [2018-01-24 12:38:23,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:38:23,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-01-24 12:38:23,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:23,500 INFO L225 Difference]: With dead ends: 292 [2018-01-24 12:38:23,500 INFO L226 Difference]: Without dead ends: 291 [2018-01-24 12:38:23,501 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:38:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-24 12:38:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 273. [2018-01-24 12:38:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-01-24 12:38:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 310 transitions. [2018-01-24 12:38:23,523 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 310 transitions. Word has length 46 [2018-01-24 12:38:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:23,523 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 310 transitions. [2018-01-24 12:38:23,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:38:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 310 transitions. [2018-01-24 12:38:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:38:23,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:23,524 INFO L322 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-24 12:38:23,524 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash 500825814, now seen corresponding path program 1 times [2018-01-24 12:38:23,525 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:23,525 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:23,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:23,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:23,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:23,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:23,767 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-24 12:38:23,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:23,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:38:23,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:38:23,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:38:23,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:38:23,768 INFO L87 Difference]: Start difference. First operand 273 states and 310 transitions. Second operand 8 states. [2018-01-24 12:38:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:24,151 INFO L93 Difference]: Finished difference Result 291 states and 330 transitions. [2018-01-24 12:38:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:38:24,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-01-24 12:38:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:24,152 INFO L225 Difference]: With dead ends: 291 [2018-01-24 12:38:24,152 INFO L226 Difference]: Without dead ends: 290 [2018-01-24 12:38:24,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:38:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-01-24 12:38:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 272. [2018-01-24 12:38:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-24 12:38:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 309 transitions. [2018-01-24 12:38:24,173 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 309 transitions. Word has length 46 [2018-01-24 12:38:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:24,174 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 309 transitions. [2018-01-24 12:38:24,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:38:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 309 transitions. [2018-01-24 12:38:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:38:24,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:24,175 INFO L322 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] [2018-01-24 12:38:24,175 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1624578300, now seen corresponding path program 1 times [2018-01-24 12:38:24,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:24,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:24,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:24,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:24,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:24,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:24,369 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-24 12:38:24,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:24,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:38:24,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:38:24,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:38:24,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:38:24,370 INFO L87 Difference]: Start difference. First operand 272 states and 309 transitions. Second operand 11 states. [2018-01-24 12:38:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:24,987 INFO L93 Difference]: Finished difference Result 525 states and 582 transitions. [2018-01-24 12:38:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:38:24,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-01-24 12:38:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:24,992 INFO L225 Difference]: With dead ends: 525 [2018-01-24 12:38:24,992 INFO L226 Difference]: Without dead ends: 522 [2018-01-24 12:38:24,993 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:38:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-01-24 12:38:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 278. [2018-01-24 12:38:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-01-24 12:38:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 314 transitions. [2018-01-24 12:38:25,016 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 314 transitions. Word has length 47 [2018-01-24 12:38:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:25,017 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 314 transitions. [2018-01-24 12:38:25,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:38:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 314 transitions. [2018-01-24 12:38:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:38:25,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:25,018 INFO L322 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] [2018-01-24 12:38:25,018 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:25,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1624578299, now seen corresponding path program 1 times [2018-01-24 12:38:25,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:25,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:25,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:25,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:25,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:25,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:25,370 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-24 12:38:25,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:25,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 12:38:25,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:38:25,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:38:25,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:38:25,371 INFO L87 Difference]: Start difference. First operand 278 states and 314 transitions. Second operand 13 states. [2018-01-24 12:38:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:26,150 INFO L93 Difference]: Finished difference Result 582 states and 629 transitions. [2018-01-24 12:38:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:38:26,150 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-01-24 12:38:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:26,152 INFO L225 Difference]: With dead ends: 582 [2018-01-24 12:38:26,152 INFO L226 Difference]: Without dead ends: 579 [2018-01-24 12:38:26,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:38:26,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-01-24 12:38:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 285. [2018-01-24 12:38:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-24 12:38:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 320 transitions. [2018-01-24 12:38:26,177 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 320 transitions. Word has length 47 [2018-01-24 12:38:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:26,178 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 320 transitions. [2018-01-24 12:38:26,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:38:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 320 transitions. [2018-01-24 12:38:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 12:38:26,179 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:26,179 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:26,179 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:26,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1211926011, now seen corresponding path program 1 times [2018-01-24 12:38:26,179 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:26,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:26,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:26,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:26,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:26,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:26,293 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-24 12:38:26,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:26,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:38:26,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:38:26,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:38:26,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:38:26,295 INFO L87 Difference]: Start difference. First operand 285 states and 320 transitions. Second operand 7 states. [2018-01-24 12:38:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:26,450 INFO L93 Difference]: Finished difference Result 352 states and 395 transitions. [2018-01-24 12:38:26,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:38:26,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-01-24 12:38:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:26,451 INFO L225 Difference]: With dead ends: 352 [2018-01-24 12:38:26,451 INFO L226 Difference]: Without dead ends: 301 [2018-01-24 12:38:26,451 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:38:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-01-24 12:38:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-01-24 12:38:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-24 12:38:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 332 transitions. [2018-01-24 12:38:26,464 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 332 transitions. Word has length 53 [2018-01-24 12:38:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:26,465 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 332 transitions. [2018-01-24 12:38:26,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:38:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 332 transitions. [2018-01-24 12:38:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 12:38:26,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:26,466 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 12:38:26,466 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1558040000, now seen corresponding path program 1 times [2018-01-24 12:38:26,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:26,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:26,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:26,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:26,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:26,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:26,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:38:26,674 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-24 12:38:26,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:26,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:38:26,712 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-24 12:38:26,714 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-24 12:38:26,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:26,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:26,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:26,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-24 12:38:26,895 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-24 12:38:26,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:38:26,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:38:26,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:38:26,915 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 24 treesize of output 18 [2018-01-24 12:38:26,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:26,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:26,922 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-01-24 12:38:26,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 12:38:26,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:38:26,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:38:26,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-24 12:38:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:27,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:38:27,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-01-24 12:38:27,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:38:27,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:38:27,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2018-01-24 12:38:27,017 INFO L87 Difference]: Start difference. First operand 297 states and 332 transitions. Second operand 17 states. [2018-01-24 12:38:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:28,201 INFO L93 Difference]: Finished difference Result 606 states and 647 transitions. [2018-01-24 12:38:28,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 12:38:28,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-01-24 12:38:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:28,203 INFO L225 Difference]: With dead ends: 606 [2018-01-24 12:38:28,203 INFO L226 Difference]: Without dead ends: 571 [2018-01-24 12:38:28,204 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1094, Unknown=7, NotChecked=0, Total=1332 [2018-01-24 12:38:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-01-24 12:38:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 325. [2018-01-24 12:38:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-24 12:38:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 367 transitions. [2018-01-24 12:38:28,232 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 367 transitions. Word has length 55 [2018-01-24 12:38:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:28,233 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 367 transitions. [2018-01-24 12:38:28,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:38:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 367 transitions. [2018-01-24 12:38:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 12:38:28,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:28,234 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:28,234 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1054600801, now seen corresponding path program 1 times [2018-01-24 12:38:28,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:28,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:28,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:28,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:28,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:28,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:38:28,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:38:28,324 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-24 12:38:28,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:28,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:38:28,483 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (and (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store |c_old(#valid)| main_~list~5.base 0)) (not (= 0 main_~list~5.base)))) is different from true [2018-01-24 12:38:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-24 12:38:28,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:38:28,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-01-24 12:38:28,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:38:28,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:38:28,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-01-24 12:38:28,520 INFO L87 Difference]: Start difference. First operand 325 states and 367 transitions. Second operand 10 states. [2018-01-24 12:38:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:28,974 INFO L93 Difference]: Finished difference Result 365 states and 407 transitions. [2018-01-24 12:38:28,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:38:28,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-01-24 12:38:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:28,976 INFO L225 Difference]: With dead ends: 365 [2018-01-24 12:38:28,976 INFO L226 Difference]: Without dead ends: 334 [2018-01-24 12:38:28,976 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=134, Unknown=1, NotChecked=24, Total=210 [2018-01-24 12:38:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-24 12:38:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2018-01-24 12:38:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-01-24 12:38:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 375 transitions. [2018-01-24 12:38:29,003 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 375 transitions. Word has length 56 [2018-01-24 12:38:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:29,003 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 375 transitions. [2018-01-24 12:38:29,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:38:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 375 transitions. [2018-01-24 12:38:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-24 12:38:29,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:29,005 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:29,005 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:29,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1232458711, now seen corresponding path program 1 times [2018-01-24 12:38:29,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:29,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:29,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:29,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:29,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:29,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:29,169 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-24 12:38:29,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:29,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:38:29,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:38:29,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:38:29,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:38:29,170 INFO L87 Difference]: Start difference. First operand 333 states and 375 transitions. Second operand 10 states. [2018-01-24 12:38:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:29,517 INFO L93 Difference]: Finished difference Result 542 states and 602 transitions. [2018-01-24 12:38:29,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:38:29,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-01-24 12:38:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:29,519 INFO L225 Difference]: With dead ends: 542 [2018-01-24 12:38:29,519 INFO L226 Difference]: Without dead ends: 541 [2018-01-24 12:38:29,520 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:38:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-01-24 12:38:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 343. [2018-01-24 12:38:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-01-24 12:38:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 387 transitions. [2018-01-24 12:38:29,537 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 387 transitions. Word has length 58 [2018-01-24 12:38:29,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:29,537 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 387 transitions. [2018-01-24 12:38:29,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:38:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 387 transitions. [2018-01-24 12:38:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-24 12:38:29,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:29,538 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:29,538 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:29,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1232458710, now seen corresponding path program 1 times [2018-01-24 12:38:29,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:29,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:29,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:29,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:29,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:29,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:29,748 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-24 12:38:29,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:29,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:38:29,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:38:29,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:38:29,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:38:29,749 INFO L87 Difference]: Start difference. First operand 343 states and 387 transitions. Second operand 10 states. [2018-01-24 12:38:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:30,160 INFO L93 Difference]: Finished difference Result 550 states and 611 transitions. [2018-01-24 12:38:30,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:38:30,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-01-24 12:38:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:30,162 INFO L225 Difference]: With dead ends: 550 [2018-01-24 12:38:30,162 INFO L226 Difference]: Without dead ends: 547 [2018-01-24 12:38:30,162 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:38:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-01-24 12:38:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 350. [2018-01-24 12:38:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-01-24 12:38:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 393 transitions. [2018-01-24 12:38:30,189 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 393 transitions. Word has length 58 [2018-01-24 12:38:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:30,189 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 393 transitions. [2018-01-24 12:38:30,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:38:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 393 transitions. [2018-01-24 12:38:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 12:38:30,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:30,191 INFO L322 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, 1, 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-24 12:38:30,191 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:30,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1559851379, now seen corresponding path program 1 times [2018-01-24 12:38:30,191 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:30,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:30,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:30,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:30,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:30,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:38:30,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:30,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:38:30,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:38:30,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:38:30,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:38:30,281 INFO L87 Difference]: Start difference. First operand 350 states and 393 transitions. Second operand 7 states. [2018-01-24 12:38:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:30,525 INFO L93 Difference]: Finished difference Result 373 states and 411 transitions. [2018-01-24 12:38:30,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:38:30,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-01-24 12:38:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:30,527 INFO L225 Difference]: With dead ends: 373 [2018-01-24 12:38:30,527 INFO L226 Difference]: Without dead ends: 364 [2018-01-24 12:38:30,528 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:38:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-24 12:38:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 350. [2018-01-24 12:38:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-01-24 12:38:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 392 transitions. [2018-01-24 12:38:30,554 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 392 transitions. Word has length 61 [2018-01-24 12:38:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:30,554 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 392 transitions. [2018-01-24 12:38:30,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:38:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 392 transitions. [2018-01-24 12:38:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 12:38:30,555 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:30,555 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 12:38:30,555 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1015558783, now seen corresponding path program 1 times [2018-01-24 12:38:30,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:30,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:30,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:30,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:30,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:30,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:30,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:30,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:38:30,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:38:30,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:38:30,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:38:30,615 INFO L87 Difference]: Start difference. First operand 350 states and 392 transitions. Second operand 3 states. [2018-01-24 12:38:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:30,689 INFO L93 Difference]: Finished difference Result 712 states and 814 transitions. [2018-01-24 12:38:30,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:38:30,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-01-24 12:38:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:30,691 INFO L225 Difference]: With dead ends: 712 [2018-01-24 12:38:30,691 INFO L226 Difference]: Without dead ends: 535 [2018-01-24 12:38:30,692 INFO L525 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-24 12:38:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-01-24 12:38:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 410. [2018-01-24 12:38:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-01-24 12:38:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 467 transitions. [2018-01-24 12:38:30,722 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 467 transitions. Word has length 63 [2018-01-24 12:38:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:30,723 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 467 transitions. [2018-01-24 12:38:30,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:38:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 467 transitions. [2018-01-24 12:38:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 12:38:30,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:30,724 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 12:38:30,724 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash -958300481, now seen corresponding path program 1 times [2018-01-24 12:38:30,725 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:30,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:30,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:30,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:30,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:30,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:30,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:30,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:38:30,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:38:30,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:38:30,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:38:30,844 INFO L87 Difference]: Start difference. First operand 410 states and 467 transitions. Second operand 6 states. [2018-01-24 12:38:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:30,940 INFO L93 Difference]: Finished difference Result 611 states and 706 transitions. [2018-01-24 12:38:30,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:38:30,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-01-24 12:38:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:30,941 INFO L225 Difference]: With dead ends: 611 [2018-01-24 12:38:30,941 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 12:38:30,942 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:38:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 12:38:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 339. [2018-01-24 12:38:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-01-24 12:38:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 375 transitions. [2018-01-24 12:38:30,959 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 375 transitions. Word has length 63 [2018-01-24 12:38:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:30,959 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 375 transitions. [2018-01-24 12:38:30,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:38:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 375 transitions. [2018-01-24 12:38:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 12:38:30,960 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:30,960 INFO L322 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, 1, 1, 1, 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-24 12:38:30,960 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:30,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1831044472, now seen corresponding path program 1 times [2018-01-24 12:38:30,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:30,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:30,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:30,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:30,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:30,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:38:31,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:31,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:38:31,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:38:31,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:38:31,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:38:31,151 INFO L87 Difference]: Start difference. First operand 339 states and 375 transitions. Second operand 10 states. [2018-01-24 12:38:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:31,417 INFO L93 Difference]: Finished difference Result 714 states and 799 transitions. [2018-01-24 12:38:31,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:38:31,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-01-24 12:38:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:31,419 INFO L225 Difference]: With dead ends: 714 [2018-01-24 12:38:31,419 INFO L226 Difference]: Without dead ends: 469 [2018-01-24 12:38:31,420 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:38:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-01-24 12:38:31,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 309. [2018-01-24 12:38:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-01-24 12:38:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 343 transitions. [2018-01-24 12:38:31,441 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 343 transitions. Word has length 63 [2018-01-24 12:38:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:31,441 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 343 transitions. [2018-01-24 12:38:31,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:38:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 343 transitions. [2018-01-24 12:38:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 12:38:31,442 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:31,443 INFO L322 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, 1, 1, 1, 1, 1, 1, 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-24 12:38:31,443 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash -795758795, now seen corresponding path program 1 times [2018-01-24 12:38:31,443 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:31,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:31,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:31,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:31,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:31,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:31,673 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-24 12:38:31,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:31,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:38:31,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:38:31,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:38:31,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:38:31,674 INFO L87 Difference]: Start difference. First operand 309 states and 343 transitions. Second operand 10 states. [2018-01-24 12:38:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:32,004 INFO L93 Difference]: Finished difference Result 468 states and 521 transitions. [2018-01-24 12:38:32,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:38:32,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-01-24 12:38:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:32,007 INFO L225 Difference]: With dead ends: 468 [2018-01-24 12:38:32,007 INFO L226 Difference]: Without dead ends: 467 [2018-01-24 12:38:32,008 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:38:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-01-24 12:38:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 310. [2018-01-24 12:38:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-01-24 12:38:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 344 transitions. [2018-01-24 12:38:32,036 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 344 transitions. Word has length 67 [2018-01-24 12:38:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:32,036 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 344 transitions. [2018-01-24 12:38:32,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:38:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 344 transitions. [2018-01-24 12:38:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 12:38:32,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:32,038 INFO L322 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] [2018-01-24 12:38:32,038 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:32,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1091380990, now seen corresponding path program 1 times [2018-01-24 12:38:32,038 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:32,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:32,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:32,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:32,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:32,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:38:32,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:32,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:32,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:32,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:32,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:32,108 INFO L87 Difference]: Start difference. First operand 310 states and 344 transitions. Second operand 5 states. [2018-01-24 12:38:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:32,205 INFO L93 Difference]: Finished difference Result 521 states and 585 transitions. [2018-01-24 12:38:32,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:38:32,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-01-24 12:38:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:32,207 INFO L225 Difference]: With dead ends: 521 [2018-01-24 12:38:32,207 INFO L226 Difference]: Without dead ends: 326 [2018-01-24 12:38:32,207 INFO L525 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-24 12:38:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-01-24 12:38:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 314. [2018-01-24 12:38:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-01-24 12:38:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 347 transitions. [2018-01-24 12:38:32,223 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 347 transitions. Word has length 67 [2018-01-24 12:38:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:32,223 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 347 transitions. [2018-01-24 12:38:32,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 347 transitions. [2018-01-24 12:38:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-24 12:38:32,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:32,224 INFO L322 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] [2018-01-24 12:38:32,224 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2101911161, now seen corresponding path program 1 times [2018-01-24 12:38:32,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:32,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:32,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:32,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:32,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:32,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:32,514 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-24 12:38:32,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:38:32,515 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-24 12:38:32,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:32,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:38:32,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:32,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:32,559 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-24 12:38:32,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-24 12:38:32,626 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-24 12:38:32,629 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-24 12:38:32,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,639 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-24 12:38:32,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-24 12:38:32,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:32,701 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 36 treesize of output 37 [2018-01-24 12:38:32,703 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-24 12:38:32,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-24 12:38:32,739 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 50 treesize of output 40 [2018-01-24 12:38:32,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:32,742 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 31 [2018-01-24 12:38:32,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,760 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-24 12:38:32,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-01-24 12:38:32,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 49 treesize of output 31 [2018-01-24 12:38:32,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:32,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 6 [2018-01-24 12:38:32,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,851 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 19 treesize of output 10 [2018-01-24 12:38:32,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:32,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:32,857 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:15 [2018-01-24 12:38:32,910 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-24 12:38:32,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:38:32,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-01-24 12:38:32,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:38:32,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:38:32,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:38:32,944 INFO L87 Difference]: Start difference. First operand 314 states and 347 transitions. Second operand 23 states. [2018-01-24 12:38:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:33,790 INFO L93 Difference]: Finished difference Result 517 states and 562 transitions. [2018-01-24 12:38:33,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:38:33,791 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-01-24 12:38:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:33,792 INFO L225 Difference]: With dead ends: 517 [2018-01-24 12:38:33,792 INFO L226 Difference]: Without dead ends: 516 [2018-01-24 12:38:33,793 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 12:38:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-01-24 12:38:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 373. [2018-01-24 12:38:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-01-24 12:38:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 416 transitions. [2018-01-24 12:38:33,815 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 416 transitions. Word has length 69 [2018-01-24 12:38:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:33,815 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 416 transitions. [2018-01-24 12:38:33,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:38:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 416 transitions. [2018-01-24 12:38:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-24 12:38:33,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:33,816 INFO L322 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] [2018-01-24 12:38:33,816 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2101911162, now seen corresponding path program 1 times [2018-01-24 12:38:33,816 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:33,816 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:33,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:33,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:33,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:33,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:34,053 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-24 12:38:34,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:38:34,053 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-24 12:38:34,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:34,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:38:34,104 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-24 12:38:34,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:34,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:34,114 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-24 12:38:34,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-24 12:38:34,126 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-24 12:38:34,128 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-24 12:38:34,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,138 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-24 12:38:34,141 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-24 12:38:34,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,150 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-24 12:38:34,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-01-24 12:38:34,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:34,210 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 36 treesize of output 37 [2018-01-24 12:38:34,212 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-24 12:38:34,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:34,233 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 19 treesize of output 24 [2018-01-24 12:38:34,235 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-24 12:38:34,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-01-24 12:38:34,274 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-24 12:38:34,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:34,277 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 31 [2018-01-24 12:38:34,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,299 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 74 treesize of output 64 [2018-01-24 12:38:34,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:34,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-01-24 12:38:34,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,328 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-24 12:38:34,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:73 [2018-01-24 12:38:34,428 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 73 treesize of output 51 [2018-01-24 12:38:34,431 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 39 treesize of output 26 [2018-01-24 12:38:34,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:34,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 6 [2018-01-24 12:38:34,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,456 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 31 treesize of output 27 [2018-01-24 12:38:34,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:34,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 6 [2018-01-24 12:38:34,460 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,465 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-24 12:38:34,465 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:34,470 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-24 12:38:34,470 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-01-24 12:38:34,513 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-24 12:38:34,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:38:34,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-01-24 12:38:34,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:38:34,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:38:34,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:38:34,535 INFO L87 Difference]: Start difference. First operand 373 states and 416 transitions. Second operand 19 states. [2018-01-24 12:38:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:35,557 INFO L93 Difference]: Finished difference Result 507 states and 552 transitions. [2018-01-24 12:38:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:38:35,557 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-01-24 12:38:35,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:35,559 INFO L225 Difference]: With dead ends: 507 [2018-01-24 12:38:35,560 INFO L226 Difference]: Without dead ends: 505 [2018-01-24 12:38:35,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2018-01-24 12:38:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-01-24 12:38:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 396. [2018-01-24 12:38:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-01-24 12:38:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 444 transitions. [2018-01-24 12:38:35,600 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 444 transitions. Word has length 69 [2018-01-24 12:38:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:35,600 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 444 transitions. [2018-01-24 12:38:35,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:38:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 444 transitions. [2018-01-24 12:38:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-24 12:38:35,601 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:35,601 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:38:35,601 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1419604425, now seen corresponding path program 1 times [2018-01-24 12:38:35,602 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:35,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:35,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:35,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:35,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:35,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:36,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:38:36,174 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-24 12:38:36,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:36,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:38:36,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:36,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:36,237 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-24 12:38:36,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:36,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:36,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-24 12:38:36,266 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 13 treesize of output 10 [2018-01-24 12:38:36,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-24 12:38:36,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:36,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:36,275 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-24 12:38:36,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-24 12:38:36,309 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 45 treesize of output 39 [2018-01-24 12:38:36,312 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-24 12:38:36,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:36,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:36,323 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-24 12:38:36,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-01-24 12:38:36,388 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 60 treesize of output 46 [2018-01-24 12:38:36,391 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-24 12:38:36,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:36,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:36,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:36,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-01-24 12:38:40,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-01-24 12:38:40,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,524 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-24 12:38:40,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-01-24 12:38:40,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-01-24 12:38:40,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-01-24 12:38:40,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:40,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-01-24 12:38:40,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 100 [2018-01-24 12:38:40,742 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-24 12:38:40,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,766 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-24 12:38:40,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-01-24 12:38:40,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 93 [2018-01-24 12:38:40,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,837 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 31 [2018-01-24 12:38:40,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:40,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:100 [2018-01-24 12:38:41,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 64 [2018-01-24 12:38:41,010 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-24 12:38:41,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2018-01-24 12:38:41,022 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-24 12:38:41,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 6 [2018-01-24 12:38:41,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:41,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:41,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:28 [2018-01-24 12:38:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:41,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:38:41,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-01-24 12:38:41,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 12:38:41,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 12:38:41,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1190, Unknown=2, NotChecked=0, Total=1406 [2018-01-24 12:38:41,175 INFO L87 Difference]: Start difference. First operand 396 states and 444 transitions. Second operand 38 states. [2018-01-24 12:39:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:39:03,837 INFO L93 Difference]: Finished difference Result 716 states and 792 transitions. [2018-01-24 12:39:03,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-24 12:39:03,837 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-01-24 12:39:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:39:03,839 INFO L225 Difference]: With dead ends: 716 [2018-01-24 12:39:03,839 INFO L226 Difference]: Without dead ends: 715 [2018-01-24 12:39:03,840 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=1183, Invalid=4508, Unknown=9, NotChecked=0, Total=5700 [2018-01-24 12:39:03,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-01-24 12:39:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 396. [2018-01-24 12:39:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-01-24 12:39:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 443 transitions. [2018-01-24 12:39:03,864 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 443 transitions. Word has length 72 [2018-01-24 12:39:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:39:03,865 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 443 transitions. [2018-01-24 12:39:03,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 12:39:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 443 transitions. [2018-01-24 12:39:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-24 12:39:03,865 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:39:03,865 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:39:03,866 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:39:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1419604424, now seen corresponding path program 1 times [2018-01-24 12:39:03,866 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:39:03,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:39:03,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:39:03,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:39:03,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:39:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:39:03,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:39:03,982 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-01-24 12:39:03,983 ERROR L119 erpolLogProxyWrapper]: Interpolant 31 not inductive: (Check returned sat) [2018-01-24 12:39:03,984 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 12:39:03,987 INFO L168 Benchmark]: Toolchain (without parser) took 51312.81 ms. Allocated memory was 307.2 MB in the beginning and 768.1 MB in the end (delta: 460.8 MB). Free memory was 267.3 MB in the beginning and 357.0 MB in the end (delta: -89.8 MB). Peak memory consumption was 371.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:03,988 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:39:03,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.75 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 254.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:03,989 INFO L168 Benchmark]: Boogie Preprocessor took 37.54 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:03,989 INFO L168 Benchmark]: RCFGBuilder took 679.87 ms. Allocated memory is still 307.2 MB. Free memory was 252.1 MB in the beginning and 208.8 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:03,989 INFO L168 Benchmark]: TraceAbstraction took 50371.08 ms. Allocated memory was 307.2 MB in the beginning and 768.1 MB in the end (delta: 460.8 MB). Free memory was 208.8 MB in the beginning and 357.0 MB in the end (delta: -148.2 MB). Peak memory consumption was 312.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:03,991 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.19 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.75 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 254.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.54 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 679.87 ms. Allocated memory is still 307.2 MB. Free memory was 252.1 MB in the beginning and 208.8 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50371.08 ms. Allocated memory was 307.2 MB in the beginning and 768.1 MB in the end (delta: 460.8 MB). Free memory was 208.8 MB in the beginning and 357.0 MB in the end (delta: -148.2 MB). Peak memory consumption was 312.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-39-03-999.csv Received shutdown request...