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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:32:22,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:32:22,584 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:32:22,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:32:22,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:32:22,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:32:22,599 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:32:22,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:32:22,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:32:22,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:32:22,604 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:32:22,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:32:22,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:32:22,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:32:22,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:32:22,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:32:22,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:32:22,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:32:22,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:32:22,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:32:22,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:32:22,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:32:22,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:32:22,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:32:22,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:32:22,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:32:22,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:32:22,623 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:32:22,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:32:22,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:32:22,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:32:22,625 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:32:22,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:32:22,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:32:22,636 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:32:22,636 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:32:22,636 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:32:22,636 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:32:22,637 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:32:22,637 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:32:22,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:32:22,638 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:32:22,638 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:32:22,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:32:22,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:32:22,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:32:22,639 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:32:22,639 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:32:22,639 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:32:22,639 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:32:22,639 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:32:22,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:32:22,640 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:32:22,640 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:32:22,640 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:32:22,640 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:32:22,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:32:22,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:32:22,641 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:32:22,641 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:32:22,642 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:32:22,642 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:32:22,642 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:32:22,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:32:22,642 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:32:22,642 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:32:22,643 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:32:22,644 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:32:22,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:32:22,691 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:32:22,695 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:32:22,697 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:32:22,697 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:32:22,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-01-24 17:32:22,884 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:32:22,889 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:32:22,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:32:22,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:32:22,894 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:32:22,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:32:22" (1/1) ... [2018-01-24 17:32:22,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5977c944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:22, skipping insertion in model container [2018-01-24 17:32:22,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:32:22" (1/1) ... [2018-01-24 17:32:22,910 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:32:22,972 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:32:23,125 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:32:23,154 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:32:23,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23 WrapperNode [2018-01-24 17:32:23,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:32:23,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:32:23,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:32:23,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:32:23,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23" (1/1) ... [2018-01-24 17:32:23,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23" (1/1) ... [2018-01-24 17:32:23,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23" (1/1) ... [2018-01-24 17:32:23,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23" (1/1) ... [2018-01-24 17:32:23,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23" (1/1) ... [2018-01-24 17:32:23,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23" (1/1) ... [2018-01-24 17:32:23,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23" (1/1) ... [2018-01-24 17:32:23,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:32:23,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:32:23,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:32:23,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:32:23,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23" (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 17:32:23,288 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:32:23,288 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:32:23,289 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:32:23,289 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:32:23,289 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:32:23,289 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:32:23,289 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:32:23,289 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:32:23,289 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:32:23,289 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:32:23,289 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:32:23,290 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 17:32:23,290 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:32:23,290 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:32:23,290 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:32:24,054 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:32:24,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:32:24 BoogieIcfgContainer [2018-01-24 17:32:24,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:32:24,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:32:24,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:32:24,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:32:24,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:32:22" (1/3) ... [2018-01-24 17:32:24,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1584b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:32:24, skipping insertion in model container [2018-01-24 17:32:24,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:32:23" (2/3) ... [2018-01-24 17:32:24,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1584b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:32:24, skipping insertion in model container [2018-01-24 17:32:24,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:32:24" (3/3) ... [2018-01-24 17:32:24,062 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-01-24 17:32:24,069 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:32:24,077 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2018-01-24 17:32:24,155 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:32:24,156 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:32:24,156 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:32:24,156 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:32:24,157 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:32:24,157 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:32:24,157 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:32:24,157 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:32:24,158 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:32:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states. [2018-01-24 17:32:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:32:24,198 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:24,199 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:24,200 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:24,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1231756068, now seen corresponding path program 1 times [2018-01-24 17:32:24,208 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:24,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:24,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:24,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:24,270 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:24,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:24,407 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 17:32:24,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:24,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:32:24,409 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:24,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:32:24,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:32:24,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:32:24,465 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 4 states. [2018-01-24 17:32:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:24,841 INFO L93 Difference]: Finished difference Result 402 states and 529 transitions. [2018-01-24 17:32:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:32:24,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:32:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:24,856 INFO L225 Difference]: With dead ends: 402 [2018-01-24 17:32:24,857 INFO L226 Difference]: Without dead ends: 214 [2018-01-24 17:32:24,862 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 17:32:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-01-24 17:32:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 185. [2018-01-24 17:32:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-24 17:32:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-24 17:32:24,919 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 8 [2018-01-24 17:32:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:24,919 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-24 17:32:24,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:32:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-24 17:32:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:32:24,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:24,920 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:24,921 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1231756069, now seen corresponding path program 1 times [2018-01-24 17:32:24,921 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:24,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:24,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:24,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:24,923 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:24,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:25,019 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 17:32:25,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:25,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:32:25,020 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:25,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:32:25,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:32:25,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:32:25,023 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 4 states. [2018-01-24 17:32:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:25,219 INFO L93 Difference]: Finished difference Result 218 states and 228 transitions. [2018-01-24 17:32:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:32:25,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:32:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:25,221 INFO L225 Difference]: With dead ends: 218 [2018-01-24 17:32:25,221 INFO L226 Difference]: Without dead ends: 206 [2018-01-24 17:32:25,222 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 17:32:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-24 17:32:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 195. [2018-01-24 17:32:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 17:32:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-01-24 17:32:25,233 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 8 [2018-01-24 17:32:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:25,234 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-01-24 17:32:25,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:32:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-01-24 17:32:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 17:32:25,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:25,234 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:25,235 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:25,235 INFO L82 PathProgramCache]: Analyzing trace with hash -268288902, now seen corresponding path program 1 times [2018-01-24 17:32:25,235 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:25,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:25,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:25,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:25,237 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:25,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:25,313 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 17:32:25,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:25,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:32:25,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:25,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:25,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:25,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:25,316 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 5 states. [2018-01-24 17:32:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:25,819 INFO L93 Difference]: Finished difference Result 334 states and 360 transitions. [2018-01-24 17:32:25,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:32:25,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 17:32:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:25,822 INFO L225 Difference]: With dead ends: 334 [2018-01-24 17:32:25,822 INFO L226 Difference]: Without dead ends: 333 [2018-01-24 17:32:25,823 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 17:32:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-24 17:32:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 194. [2018-01-24 17:32:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-24 17:32:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2018-01-24 17:32:25,841 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 18 [2018-01-24 17:32:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:25,841 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2018-01-24 17:32:25,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2018-01-24 17:32:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 17:32:25,842 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:25,843 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:25,843 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -268288901, now seen corresponding path program 1 times [2018-01-24 17:32:25,843 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:25,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:25,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:25,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:25,845 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:25,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:25,937 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 17:32:25,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:25,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:32:25,938 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:25,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:25,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:25,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:25,939 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 5 states. [2018-01-24 17:32:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:26,294 INFO L93 Difference]: Finished difference Result 362 states and 397 transitions. [2018-01-24 17:32:26,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:32:26,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 17:32:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:26,296 INFO L225 Difference]: With dead ends: 362 [2018-01-24 17:32:26,296 INFO L226 Difference]: Without dead ends: 361 [2018-01-24 17:32:26,297 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 17:32:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-01-24 17:32:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 193. [2018-01-24 17:32:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-24 17:32:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2018-01-24 17:32:26,312 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 18 [2018-01-24 17:32:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:26,312 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2018-01-24 17:32:26,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2018-01-24 17:32:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 17:32:26,313 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:26,313 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] [2018-01-24 17:32:26,313 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash 339478269, now seen corresponding path program 1 times [2018-01-24 17:32:26,313 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:26,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:26,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:26,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:26,314 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:26,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:26,484 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 17:32:26,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:26,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:32:26,485 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:26,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:32:26,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:32:26,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:32:26,486 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand 8 states. [2018-01-24 17:32:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:27,333 INFO L93 Difference]: Finished difference Result 336 states and 361 transitions. [2018-01-24 17:32:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:32:27,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 17:32:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:27,335 INFO L225 Difference]: With dead ends: 336 [2018-01-24 17:32:27,335 INFO L226 Difference]: Without dead ends: 335 [2018-01-24 17:32:27,336 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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 17:32:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-24 17:32:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 192. [2018-01-24 17:32:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-24 17:32:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2018-01-24 17:32:27,346 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 21 [2018-01-24 17:32:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:27,347 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2018-01-24 17:32:27,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:32:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2018-01-24 17:32:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 17:32:27,348 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:27,348 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] [2018-01-24 17:32:27,348 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:27,348 INFO L82 PathProgramCache]: Analyzing trace with hash 339478270, now seen corresponding path program 1 times [2018-01-24 17:32:27,349 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:27,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:27,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:27,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:27,350 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:27,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:27,556 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 17:32:27,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:27,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:32:27,557 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:27,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:32:27,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:32:27,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:32:27,558 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 8 states. [2018-01-24 17:32:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:28,420 INFO L93 Difference]: Finished difference Result 337 states and 362 transitions. [2018-01-24 17:32:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:32:28,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 17:32:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:28,422 INFO L225 Difference]: With dead ends: 337 [2018-01-24 17:32:28,422 INFO L226 Difference]: Without dead ends: 336 [2018-01-24 17:32:28,422 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 17:32:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-01-24 17:32:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 191. [2018-01-24 17:32:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-24 17:32:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 209 transitions. [2018-01-24 17:32:28,430 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 209 transitions. Word has length 21 [2018-01-24 17:32:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:28,430 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 209 transitions. [2018-01-24 17:32:28,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:32:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2018-01-24 17:32:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:32:28,431 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:28,431 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] [2018-01-24 17:32:28,431 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1615330234, now seen corresponding path program 1 times [2018-01-24 17:32:28,431 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:28,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:28,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:28,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:28,432 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:28,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:28,508 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 17:32:28,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:28,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:32:28,508 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:28,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:28,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:28,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:28,510 INFO L87 Difference]: Start difference. First operand 191 states and 209 transitions. Second operand 5 states. [2018-01-24 17:32:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:28,668 INFO L93 Difference]: Finished difference Result 445 states and 485 transitions. [2018-01-24 17:32:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:32:28,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-24 17:32:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:28,680 INFO L225 Difference]: With dead ends: 445 [2018-01-24 17:32:28,680 INFO L226 Difference]: Without dead ends: 283 [2018-01-24 17:32:28,681 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 17:32:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-24 17:32:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 195. [2018-01-24 17:32:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 17:32:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-01-24 17:32:28,692 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 27 [2018-01-24 17:32:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:28,693 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-01-24 17:32:28,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-01-24 17:32:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:32:28,695 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:28,695 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] [2018-01-24 17:32:28,695 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:28,695 INFO L82 PathProgramCache]: Analyzing trace with hash 803446251, now seen corresponding path program 1 times [2018-01-24 17:32:28,695 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:28,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:28,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:28,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:28,697 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:28,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:28,904 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 17:32:28,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:28,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:32:28,905 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:28,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:28,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:28,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:28,905 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 5 states. [2018-01-24 17:32:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:29,055 INFO L93 Difference]: Finished difference Result 217 states and 231 transitions. [2018-01-24 17:32:29,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:32:29,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 17:32:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:29,056 INFO L225 Difference]: With dead ends: 217 [2018-01-24 17:32:29,057 INFO L226 Difference]: Without dead ends: 204 [2018-01-24 17:32:29,057 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 17:32:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-24 17:32:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 186. [2018-01-24 17:32:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-24 17:32:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 204 transitions. [2018-01-24 17:32:29,069 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 204 transitions. Word has length 29 [2018-01-24 17:32:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:29,070 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 204 transitions. [2018-01-24 17:32:29,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 204 transitions. [2018-01-24 17:32:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:32:29,071 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:29,071 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] [2018-01-24 17:32:29,071 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:29,072 INFO L82 PathProgramCache]: Analyzing trace with hash 803446252, now seen corresponding path program 1 times [2018-01-24 17:32:29,072 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:29,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:29,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:29,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:29,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:29,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:29,320 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 17:32:29,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:29,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:32:29,320 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:29,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:32:29,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:32:29,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:29,321 INFO L87 Difference]: Start difference. First operand 186 states and 204 transitions. Second operand 7 states. [2018-01-24 17:32:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:29,708 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2018-01-24 17:32:29,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:32:29,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-24 17:32:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:29,710 INFO L225 Difference]: With dead ends: 248 [2018-01-24 17:32:29,710 INFO L226 Difference]: Without dead ends: 243 [2018-01-24 17:32:29,710 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:32:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-24 17:32:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 216. [2018-01-24 17:32:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 17:32:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 244 transitions. [2018-01-24 17:32:29,724 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 244 transitions. Word has length 29 [2018-01-24 17:32:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:29,724 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 244 transitions. [2018-01-24 17:32:29,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:32:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 244 transitions. [2018-01-24 17:32:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:32:29,729 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:29,730 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 17:32:29,730 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:29,730 INFO L82 PathProgramCache]: Analyzing trace with hash -982263634, now seen corresponding path program 1 times [2018-01-24 17:32:29,730 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:29,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:29,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:29,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:29,733 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:29,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:29,803 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 17:32:29,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:29,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:32:29,804 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:29,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:29,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:29,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:29,805 INFO L87 Difference]: Start difference. First operand 216 states and 244 transitions. Second operand 5 states. [2018-01-24 17:32:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:30,038 INFO L93 Difference]: Finished difference Result 305 states and 346 transitions. [2018-01-24 17:32:30,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:32:30,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-24 17:32:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:30,042 INFO L225 Difference]: With dead ends: 305 [2018-01-24 17:32:30,042 INFO L226 Difference]: Without dead ends: 304 [2018-01-24 17:32:30,042 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:30,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-24 17:32:30,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 215. [2018-01-24 17:32:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-24 17:32:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 242 transitions. [2018-01-24 17:32:30,055 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 242 transitions. Word has length 31 [2018-01-24 17:32:30,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:30,056 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 242 transitions. [2018-01-24 17:32:30,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 242 transitions. [2018-01-24 17:32:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:32:30,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:30,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 17:32:30,058 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:30,058 INFO L82 PathProgramCache]: Analyzing trace with hash -982263633, now seen corresponding path program 1 times [2018-01-24 17:32:30,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:30,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:30,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:30,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:30,060 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:30,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:30,226 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 17:32:30,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:30,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:32:30,227 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:30,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:30,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:30,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:30,227 INFO L87 Difference]: Start difference. First operand 215 states and 242 transitions. Second operand 5 states. [2018-01-24 17:32:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:30,633 INFO L93 Difference]: Finished difference Result 333 states and 380 transitions. [2018-01-24 17:32:30,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:32:30,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-24 17:32:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:30,634 INFO L225 Difference]: With dead ends: 333 [2018-01-24 17:32:30,634 INFO L226 Difference]: Without dead ends: 332 [2018-01-24 17:32:30,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:32:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-01-24 17:32:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 214. [2018-01-24 17:32:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-24 17:32:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 240 transitions. [2018-01-24 17:32:30,648 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 240 transitions. Word has length 31 [2018-01-24 17:32:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:30,648 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 240 transitions. [2018-01-24 17:32:30,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 240 transitions. [2018-01-24 17:32:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 17:32:30,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:30,652 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] [2018-01-24 17:32:30,652 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:30,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1048421776, now seen corresponding path program 1 times [2018-01-24 17:32:30,652 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:30,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:30,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:30,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:30,653 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:30,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:30,878 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 17:32:30,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:30,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:32:30,879 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:30,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:32:30,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:32:30,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:32:30,880 INFO L87 Difference]: Start difference. First operand 214 states and 240 transitions. Second operand 9 states. [2018-01-24 17:32:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:31,549 INFO L93 Difference]: Finished difference Result 224 states and 249 transitions. [2018-01-24 17:32:31,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:32:31,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-24 17:32:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:31,551 INFO L225 Difference]: With dead ends: 224 [2018-01-24 17:32:31,551 INFO L226 Difference]: Without dead ends: 223 [2018-01-24 17:32:31,551 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:32:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-24 17:32:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 213. [2018-01-24 17:32:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-24 17:32:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 239 transitions. [2018-01-24 17:32:31,564 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 239 transitions. Word has length 35 [2018-01-24 17:32:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:31,564 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 239 transitions. [2018-01-24 17:32:31,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:32:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2018-01-24 17:32:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 17:32:31,565 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:31,566 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] [2018-01-24 17:32:31,566 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:31,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1048421775, now seen corresponding path program 1 times [2018-01-24 17:32:31,566 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:31,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:31,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:31,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:31,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:31,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:32,056 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 17:32:32,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:32,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:32:32,056 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:32,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:32:32,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:32:32,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:32:32,057 INFO L87 Difference]: Start difference. First operand 213 states and 239 transitions. Second operand 10 states. [2018-01-24 17:32:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:32,788 INFO L93 Difference]: Finished difference Result 225 states and 250 transitions. [2018-01-24 17:32:32,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 17:32:32,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-01-24 17:32:32,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:32,790 INFO L225 Difference]: With dead ends: 225 [2018-01-24 17:32:32,790 INFO L226 Difference]: Without dead ends: 215 [2018-01-24 17:32:32,790 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:32:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-24 17:32:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2018-01-24 17:32:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-24 17:32:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2018-01-24 17:32:32,798 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 35 [2018-01-24 17:32:32,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:32,798 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2018-01-24 17:32:32,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:32:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-01-24 17:32:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 17:32:32,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:32,799 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] [2018-01-24 17:32:32,799 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:32,799 INFO L82 PathProgramCache]: Analyzing trace with hash -436143591, now seen corresponding path program 1 times [2018-01-24 17:32:32,799 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:32,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:32,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:32,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:32,800 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:32,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:32,895 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 17:32:32,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:32,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:32:32,896 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:32,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:32,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:32,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:32,897 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand 5 states. [2018-01-24 17:32:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:33,091 INFO L93 Difference]: Finished difference Result 274 states and 297 transitions. [2018-01-24 17:32:33,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:32:33,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-24 17:32:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:33,092 INFO L225 Difference]: With dead ends: 274 [2018-01-24 17:32:33,092 INFO L226 Difference]: Without dead ends: 218 [2018-01-24 17:32:33,093 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 17:32:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-24 17:32:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2018-01-24 17:32:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-24 17:32:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2018-01-24 17:32:33,103 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 37 [2018-01-24 17:32:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:33,104 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2018-01-24 17:32:33,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2018-01-24 17:32:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 17:32:33,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:33,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, 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 17:32:33,105 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2094023958, now seen corresponding path program 1 times [2018-01-24 17:32:33,106 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:33,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:33,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:33,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:33,107 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:33,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:33,531 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 17:32:33,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:33,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 17:32:33,532 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:33,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:32:33,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:32:33,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:32:33,533 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand 10 states. [2018-01-24 17:32:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:34,118 INFO L93 Difference]: Finished difference Result 395 states and 437 transitions. [2018-01-24 17:32:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 17:32:34,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-01-24 17:32:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:34,120 INFO L225 Difference]: With dead ends: 395 [2018-01-24 17:32:34,120 INFO L226 Difference]: Without dead ends: 285 [2018-01-24 17:32:34,120 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 17:32:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-24 17:32:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 210. [2018-01-24 17:32:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-24 17:32:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 234 transitions. [2018-01-24 17:32:34,135 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 234 transitions. Word has length 43 [2018-01-24 17:32:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:34,135 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 234 transitions. [2018-01-24 17:32:34,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:32:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 234 transitions. [2018-01-24 17:32:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 17:32:34,136 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:34,137 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] [2018-01-24 17:32:34,137 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1866790362, now seen corresponding path program 1 times [2018-01-24 17:32:34,137 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:34,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:34,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:34,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:34,139 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:34,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:34,349 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 17:32:34,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:34,349 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:32:34,350 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-01-24 17:32:34,352 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [10], [16], [21], [25], [31], [34], [35], [61], [62], [65], [70], [71], [74], [80], [84], [90], [94], [96], [99], [217], [221], [226], [230], [238], [244], [245], [246], [248], [252], [256], [331], [336], [340], [346], [349], [450], [451], [452] [2018-01-24 17:32:34,406 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:32:34,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:32:35,050 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:32:35,052 INFO L268 AbstractInterpreter]: Visited 43 different actions 67 times. Merged at 12 different actions 23 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-24 17:32:35,106 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:32:35,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:35,106 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 17:32:35,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:35,119 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:32:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:35,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:32:35,255 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 17:32:35,277 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 17:32:35,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,368 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 17:32:35,383 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 17:32:35,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-24 17:32:35,521 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 17:32:35,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,526 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 17:32:35,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,583 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 17:32:35,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,588 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 17:32:35,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-01-24 17:32:35,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-24 17:32:35,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 17:32:35,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,685 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 30 treesize of output 23 [2018-01-24 17:32:35,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 17:32:35,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,747 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-01-24 17:32:35,832 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 33 treesize of output 25 [2018-01-24 17:32:35,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 17:32:35,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,853 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 33 treesize of output 25 [2018-01-24 17:32:35,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:35,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 17:32:35,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,867 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 17:32:35,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2018-01-24 17:32:35,880 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 17:32:35,880 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:32:35,915 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 17:32:35,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:35,934 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 17:32:35,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:1 [2018-01-24 17:32:35,953 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 17:32:35,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:35,990 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:32:35,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:35,995 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:32:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:36,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:32:36,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:32:36,214 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 17:32:36,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,237 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 17:32:36,252 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 17:32:36,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-24 17:32:36,315 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 17:32:36,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,318 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 17:32:36,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,413 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 17:32:36,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,417 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 17:32:36,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,430 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-24 17:32:36,436 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 30 treesize of output 23 [2018-01-24 17:32:36,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 17:32:36,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-24 17:32:36,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 17:32:36,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-01-24 17:32:36,566 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 33 treesize of output 25 [2018-01-24 17:32:36,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 17:32:36,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,586 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 33 treesize of output 25 [2018-01-24 17:32:36,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:36,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 17:32:36,591 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,603 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 17:32:36,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2018-01-24 17:32:36,612 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 17:32:36,612 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:32:36,670 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 17:32:36,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:36,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:1 [2018-01-24 17:32:36,686 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 17:32:36,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:32:36,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 7, 10, 7] total 16 [2018-01-24 17:32:36,688 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:32:36,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 17:32:36,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 17:32:36,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:32:36,689 INFO L87 Difference]: Start difference. First operand 210 states and 234 transitions. Second operand 12 states. [2018-01-24 17:32:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:37,629 INFO L93 Difference]: Finished difference Result 435 states and 472 transitions. [2018-01-24 17:32:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 17:32:37,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-01-24 17:32:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:37,631 INFO L225 Difference]: With dead ends: 435 [2018-01-24 17:32:37,631 INFO L226 Difference]: Without dead ends: 345 [2018-01-24 17:32:37,632 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 165 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-01-24 17:32:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-24 17:32:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 244. [2018-01-24 17:32:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-24 17:32:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 277 transitions. [2018-01-24 17:32:37,651 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 277 transitions. Word has length 45 [2018-01-24 17:32:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:37,651 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 277 transitions. [2018-01-24 17:32:37,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 17:32:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 277 transitions. [2018-01-24 17:32:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 17:32:37,652 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:37,652 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 17:32:37,652 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash -336978579, now seen corresponding path program 1 times [2018-01-24 17:32:37,664 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:37,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:37,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:37,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:37,666 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:37,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:37,772 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 17:32:37,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:37,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:32:37,773 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:37,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:37,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:37,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:37,774 INFO L87 Difference]: Start difference. First operand 244 states and 277 transitions. Second operand 5 states. [2018-01-24 17:32:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:38,155 INFO L93 Difference]: Finished difference Result 359 states and 407 transitions. [2018-01-24 17:32:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:32:38,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-01-24 17:32:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:38,156 INFO L225 Difference]: With dead ends: 359 [2018-01-24 17:32:38,157 INFO L226 Difference]: Without dead ends: 358 [2018-01-24 17:32:38,157 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:32:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-01-24 17:32:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 243. [2018-01-24 17:32:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-24 17:32:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 276 transitions. [2018-01-24 17:32:38,175 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 276 transitions. Word has length 47 [2018-01-24 17:32:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:38,175 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 276 transitions. [2018-01-24 17:32:38,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 276 transitions. [2018-01-24 17:32:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 17:32:38,176 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:38,177 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 17:32:38,177 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:38,177 INFO L82 PathProgramCache]: Analyzing trace with hash -336978578, now seen corresponding path program 1 times [2018-01-24 17:32:38,177 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:38,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:38,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:38,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:38,178 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:38,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:38,267 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 17:32:38,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:38,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:32:38,267 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:38,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:38,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:38,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:38,268 INFO L87 Difference]: Start difference. First operand 243 states and 276 transitions. Second operand 5 states. [2018-01-24 17:32:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:38,560 INFO L93 Difference]: Finished difference Result 390 states and 444 transitions. [2018-01-24 17:32:38,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:32:38,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-01-24 17:32:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:38,562 INFO L225 Difference]: With dead ends: 390 [2018-01-24 17:32:38,562 INFO L226 Difference]: Without dead ends: 389 [2018-01-24 17:32:38,563 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 17:32:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-24 17:32:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 242. [2018-01-24 17:32:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-24 17:32:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 275 transitions. [2018-01-24 17:32:38,581 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 275 transitions. Word has length 47 [2018-01-24 17:32:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:38,581 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 275 transitions. [2018-01-24 17:32:38,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 275 transitions. [2018-01-24 17:32:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 17:32:38,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:38,582 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, 1] [2018-01-24 17:32:38,582 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:38,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1571885263, now seen corresponding path program 1 times [2018-01-24 17:32:38,583 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:38,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:38,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:38,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:38,584 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:38,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:39,080 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 17:32:39,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:39,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 17:32:39,080 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:39,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:32:39,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:32:39,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:32:39,081 INFO L87 Difference]: Start difference. First operand 242 states and 275 transitions. Second operand 17 states. [2018-01-24 17:32:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:40,689 INFO L93 Difference]: Finished difference Result 535 states and 583 transitions. [2018-01-24 17:32:40,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 17:32:40,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-01-24 17:32:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:40,693 INFO L225 Difference]: With dead ends: 535 [2018-01-24 17:32:40,693 INFO L226 Difference]: Without dead ends: 532 [2018-01-24 17:32:40,694 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 17:32:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-01-24 17:32:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 248. [2018-01-24 17:32:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-01-24 17:32:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 280 transitions. [2018-01-24 17:32:40,709 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 280 transitions. Word has length 48 [2018-01-24 17:32:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:40,709 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 280 transitions. [2018-01-24 17:32:40,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:32:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 280 transitions. [2018-01-24 17:32:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 17:32:40,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:40,710 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, 1] [2018-01-24 17:32:40,710 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1571885264, now seen corresponding path program 1 times [2018-01-24 17:32:40,711 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:40,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:40,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:40,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:40,712 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:40,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:41,239 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 10 DAG size of output 9 [2018-01-24 17:32:41,528 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 17:32:41,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:41,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 17:32:41,528 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:41,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 17:32:41,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 17:32:41,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:32:41,530 INFO L87 Difference]: Start difference. First operand 248 states and 280 transitions. Second operand 16 states. [2018-01-24 17:32:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:43,483 INFO L93 Difference]: Finished difference Result 587 states and 628 transitions. [2018-01-24 17:32:43,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-24 17:32:43,483 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-01-24 17:32:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:43,485 INFO L225 Difference]: With dead ends: 587 [2018-01-24 17:32:43,485 INFO L226 Difference]: Without dead ends: 584 [2018-01-24 17:32:43,487 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=481, Invalid=1325, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 17:32:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-01-24 17:32:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 255. [2018-01-24 17:32:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-01-24 17:32:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 286 transitions. [2018-01-24 17:32:43,511 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 286 transitions. Word has length 48 [2018-01-24 17:32:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:43,511 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 286 transitions. [2018-01-24 17:32:43,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 17:32:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 286 transitions. [2018-01-24 17:32:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 17:32:43,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:43,513 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, 1, 1, 1] [2018-01-24 17:32:43,513 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1590133210, now seen corresponding path program 1 times [2018-01-24 17:32:43,513 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:43,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:43,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:43,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:43,515 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:43,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:44,324 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 17:32:44,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:44,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 17:32:44,324 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:44,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:32:44,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:32:44,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:32:44,325 INFO L87 Difference]: Start difference. First operand 255 states and 286 transitions. Second operand 14 states. [2018-01-24 17:32:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:44,852 INFO L93 Difference]: Finished difference Result 274 states and 307 transitions. [2018-01-24 17:32:44,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 17:32:44,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-01-24 17:32:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:44,853 INFO L225 Difference]: With dead ends: 274 [2018-01-24 17:32:44,853 INFO L226 Difference]: Without dead ends: 273 [2018-01-24 17:32:44,854 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2018-01-24 17:32:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-24 17:32:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 254. [2018-01-24 17:32:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-01-24 17:32:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2018-01-24 17:32:44,867 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 50 [2018-01-24 17:32:44,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:44,867 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2018-01-24 17:32:44,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:32:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2018-01-24 17:32:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 17:32:44,868 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:44,868 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, 1, 1, 1] [2018-01-24 17:32:44,868 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:44,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1590133209, now seen corresponding path program 1 times [2018-01-24 17:32:44,868 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:44,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:44,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:44,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:44,869 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:44,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:45,056 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 17:32:45,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:45,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:32:45,057 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:45,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:32:45,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:32:45,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:32:45,057 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand 8 states. [2018-01-24 17:32:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:45,296 INFO L93 Difference]: Finished difference Result 275 states and 308 transitions. [2018-01-24 17:32:45,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:32:45,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-01-24 17:32:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:45,298 INFO L225 Difference]: With dead ends: 275 [2018-01-24 17:32:45,298 INFO L226 Difference]: Without dead ends: 274 [2018-01-24 17:32:45,298 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 17:32:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-24 17:32:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 253. [2018-01-24 17:32:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-24 17:32:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2018-01-24 17:32:45,316 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 50 [2018-01-24 17:32:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:45,316 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2018-01-24 17:32:45,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:32:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2018-01-24 17:32:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 17:32:45,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:45,317 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] [2018-01-24 17:32:45,317 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1798050227, now seen corresponding path program 1 times [2018-01-24 17:32:45,317 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:45,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:45,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:45,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:45,318 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:45,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:45,425 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 17:32:45,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:45,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:32:45,425 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:45,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:32:45,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:32:45,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:45,426 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand 7 states. [2018-01-24 17:32:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:45,578 INFO L93 Difference]: Finished difference Result 329 states and 367 transitions. [2018-01-24 17:32:45,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:32:45,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-01-24 17:32:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:45,579 INFO L225 Difference]: With dead ends: 329 [2018-01-24 17:32:45,579 INFO L226 Difference]: Without dead ends: 278 [2018-01-24 17:32:45,579 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 17:32:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-01-24 17:32:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 265. [2018-01-24 17:32:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-01-24 17:32:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 296 transitions. [2018-01-24 17:32:45,590 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 296 transitions. Word has length 54 [2018-01-24 17:32:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:45,591 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 296 transitions. [2018-01-24 17:32:45,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:32:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 296 transitions. [2018-01-24 17:32:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 17:32:45,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:45,591 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, 1] [2018-01-24 17:32:45,591 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:45,592 INFO L82 PathProgramCache]: Analyzing trace with hash 508691472, now seen corresponding path program 1 times [2018-01-24 17:32:45,592 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:45,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:45,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:45,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:45,593 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:45,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:45,718 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 17:32:45,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:45,719 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:32:45,719 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-01-24 17:32:45,719 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [10], [16], [21], [25], [31], [34], [35], [61], [62], [65], [70], [71], [74], [80], [84], [90], [94], [96], [99], [217], [221], [226], [230], [238], [242], [244], [245], [248], [252], [256], [331], [336], [340], [346], [349], [355], [361], [362], [363], [365], [434], [436], [439], [440], [443], [450], [451], [452] [2018-01-24 17:32:45,722 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:32:45,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:32:46,085 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:32:46,085 INFO L268 AbstractInterpreter]: Visited 53 different actions 100 times. Merged at 22 different actions 43 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 36 variables. [2018-01-24 17:32:46,119 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:32:46,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:46,119 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 17:32:46,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:46,130 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:32:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:46,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:32:46,177 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 17:32:46,181 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 17:32:46,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,200 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 17:32:46,202 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 17:32:46,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-24 17:32:46,369 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 17:32:46,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:46,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:46,377 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 17:32:46,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 17:32:46,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:32:46,409 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 17:32:46,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:46,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:32:46,416 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 17:32:46,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 17:32:46,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:32:46,432 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 17:32:46,432 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-01-24 17:32:46,495 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 17:32:46,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:32:46,621 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 17:32:46,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:46,641 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:32:46,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:46,644 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:32:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:46,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:32:46,770 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 17:32:46,772 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 17:32:46,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:32:46,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 17:32:46,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-24 17:32:46,936 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 22 treesize of output 16 [2018-01-24 17:32:46,937 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 16 treesize of output 3 [2018-01-24 17:32:46,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,943 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 22 treesize of output 16 [2018-01-24 17:32:46,944 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 16 treesize of output 3 [2018-01-24 17:32:46,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:46,947 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 17:32:46,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-01-24 17:32:46,969 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 17:32:46,969 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:32:47,062 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 17:32:47,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:32:47,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10, 12, 9] total 33 [2018-01-24 17:32:47,064 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:32:47,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:32:47,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:32:47,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=905, Unknown=4, NotChecked=0, Total=1056 [2018-01-24 17:32:47,065 INFO L87 Difference]: Start difference. First operand 265 states and 296 transitions. Second operand 17 states. [2018-01-24 17:32:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:48,109 INFO L93 Difference]: Finished difference Result 429 states and 454 transitions. [2018-01-24 17:32:48,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-24 17:32:48,110 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-01-24 17:32:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:48,111 INFO L225 Difference]: With dead ends: 429 [2018-01-24 17:32:48,111 INFO L226 Difference]: Without dead ends: 394 [2018-01-24 17:32:48,112 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 191 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=422, Invalid=2122, Unknown=6, NotChecked=0, Total=2550 [2018-01-24 17:32:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-01-24 17:32:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 292. [2018-01-24 17:32:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-24 17:32:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 330 transitions. [2018-01-24 17:32:48,127 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 330 transitions. Word has length 56 [2018-01-24 17:32:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:48,127 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 330 transitions. [2018-01-24 17:32:48,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:32:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 330 transitions. [2018-01-24 17:32:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 17:32:48,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:48,128 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] [2018-01-24 17:32:48,128 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1410432421, now seen corresponding path program 1 times [2018-01-24 17:32:48,128 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:48,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:48,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:48,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:48,129 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:48,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:48,247 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 17:32:48,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:48,247 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:32:48,247 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-01-24 17:32:48,247 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [10], [16], [21], [25], [31], [34], [35], [61], [62], [65], [70], [71], [74], [80], [84], [90], [94], [96], [99], [217], [221], [226], [230], [238], [242], [244], [245], [248], [252], [256], [331], [336], [340], [346], [349], [355], [359], [361], [362], [365], [434], [436], [439], [440], [443], [447], [449], [450], [451], [452] [2018-01-24 17:32:48,250 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:32:48,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:32:48,556 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:32:48,556 INFO L268 AbstractInterpreter]: Visited 55 different actions 105 times. Merged at 24 different actions 45 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 37 variables. [2018-01-24 17:32:48,569 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:32:48,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:48,569 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 17:32:48,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:48,579 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:32:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:48,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:32:48,685 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 17:32:48,697 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 17:32:48,697 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:32:48,783 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_3| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_3|))) (= 0 |v_main_#t~malloc0.base_3|) (= (store |c_#valid| |v_main_#t~malloc0.base_3| 0) |c_old(#valid)|))) is different from false [2018-01-24 17:32:48,794 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 17:32:48,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:48,825 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:32:48,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:48,828 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:32:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:48,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:32:48,874 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 17:32:48,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:48,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:48,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:32:48,948 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 17:32:48,948 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:32:48,962 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_4| Int)) (or (= (store |c_#valid| |v_main_#t~malloc0.base_4| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc0.base_4|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_4|))))) is different from false [2018-01-24 17:32:48,977 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 17:32:48,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:32:48,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7, 6, 5] total 20 [2018-01-24 17:32:48,979 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:32:48,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:32:48,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:32:48,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=243, Unknown=6, NotChecked=102, Total=420 [2018-01-24 17:32:48,981 INFO L87 Difference]: Start difference. First operand 292 states and 330 transitions. Second operand 10 states. [2018-01-24 17:32:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:49,455 INFO L93 Difference]: Finished difference Result 332 states and 370 transitions. [2018-01-24 17:32:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:32:49,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-01-24 17:32:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:49,457 INFO L225 Difference]: With dead ends: 332 [2018-01-24 17:32:49,457 INFO L226 Difference]: Without dead ends: 301 [2018-01-24 17:32:49,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=397, Unknown=6, NotChecked=132, Total=650 [2018-01-24 17:32:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-01-24 17:32:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-01-24 17:32:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-01-24 17:32:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 338 transitions. [2018-01-24 17:32:49,477 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 338 transitions. Word has length 57 [2018-01-24 17:32:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:49,477 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 338 transitions. [2018-01-24 17:32:49,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:32:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 338 transitions. [2018-01-24 17:32:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 17:32:49,478 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:49,479 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] [2018-01-24 17:32:49,479 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:49,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1383831736, now seen corresponding path program 1 times [2018-01-24 17:32:49,479 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:49,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:49,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:49,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:49,480 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:49,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:49,907 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 17:32:49,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:49,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 17:32:49,908 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:49,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:32:49,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:32:49,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:32:49,908 INFO L87 Difference]: Start difference. First operand 300 states and 338 transitions. Second operand 17 states. [2018-01-24 17:32:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:50,919 INFO L93 Difference]: Finished difference Result 504 states and 554 transitions. [2018-01-24 17:32:50,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 17:32:50,920 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-01-24 17:32:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:50,922 INFO L225 Difference]: With dead ends: 504 [2018-01-24 17:32:50,922 INFO L226 Difference]: Without dead ends: 503 [2018-01-24 17:32:50,923 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=1190, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 17:32:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-01-24 17:32:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 310. [2018-01-24 17:32:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-01-24 17:32:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 350 transitions. [2018-01-24 17:32:50,944 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 350 transitions. Word has length 59 [2018-01-24 17:32:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:50,945 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 350 transitions. [2018-01-24 17:32:50,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:32:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 350 transitions. [2018-01-24 17:32:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 17:32:50,946 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:50,946 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] [2018-01-24 17:32:50,946 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1383831735, now seen corresponding path program 1 times [2018-01-24 17:32:50,947 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:50,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:50,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:50,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:50,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:50,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:51,469 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 17:32:51,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:51,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 17:32:51,469 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:51,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:32:51,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:32:51,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:32:51,470 INFO L87 Difference]: Start difference. First operand 310 states and 350 transitions. Second operand 17 states. [2018-01-24 17:32:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:52,836 INFO L93 Difference]: Finished difference Result 507 states and 557 transitions. [2018-01-24 17:32:52,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 17:32:52,837 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-01-24 17:32:52,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:52,839 INFO L225 Difference]: With dead ends: 507 [2018-01-24 17:32:52,839 INFO L226 Difference]: Without dead ends: 504 [2018-01-24 17:32:52,840 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=368, Invalid=1114, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 17:32:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-01-24 17:32:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 317. [2018-01-24 17:32:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-01-24 17:32:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 356 transitions. [2018-01-24 17:32:52,881 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 356 transitions. Word has length 59 [2018-01-24 17:32:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:52,882 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 356 transitions. [2018-01-24 17:32:52,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:32:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 356 transitions. [2018-01-24 17:32:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-24 17:32:52,883 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:52,883 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] [2018-01-24 17:32:52,883 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:52,884 INFO L82 PathProgramCache]: Analyzing trace with hash -868408448, now seen corresponding path program 1 times [2018-01-24 17:32:52,884 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:52,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:52,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:52,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:52,885 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:52,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:53,070 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 17:32:53,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:53,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:32:53,071 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:53,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:32:53,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:32:53,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:53,072 INFO L87 Difference]: Start difference. First operand 317 states and 356 transitions. Second operand 7 states. [2018-01-24 17:32:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:53,955 INFO L93 Difference]: Finished difference Result 348 states and 382 transitions. [2018-01-24 17:32:53,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:32:53,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-01-24 17:32:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:53,957 INFO L225 Difference]: With dead ends: 348 [2018-01-24 17:32:53,957 INFO L226 Difference]: Without dead ends: 339 [2018-01-24 17:32:53,957 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:32:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-24 17:32:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 317. [2018-01-24 17:32:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-01-24 17:32:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 355 transitions. [2018-01-24 17:32:53,983 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 355 transitions. Word has length 62 [2018-01-24 17:32:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:53,984 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 355 transitions. [2018-01-24 17:32:53,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:32:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 355 transitions. [2018-01-24 17:32:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 17:32:53,985 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:53,985 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, 1] [2018-01-24 17:32:53,985 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash -64861364, now seen corresponding path program 1 times [2018-01-24 17:32:53,986 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:53,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:53,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:53,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:53,987 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:53,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:54,237 WARN L143 SmtUtils]: Spent 174ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-24 17:32:54,326 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 17:32:54,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:54,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:32:54,326 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:54,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:32:54,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:32:54,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:32:54,327 INFO L87 Difference]: Start difference. First operand 317 states and 355 transitions. Second operand 6 states. [2018-01-24 17:32:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:54,535 INFO L93 Difference]: Finished difference Result 483 states and 547 transitions. [2018-01-24 17:32:54,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:32:54,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-01-24 17:32:54,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:54,538 INFO L225 Difference]: With dead ends: 483 [2018-01-24 17:32:54,538 INFO L226 Difference]: Without dead ends: 308 [2018-01-24 17:32:54,538 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-01-24 17:32:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-01-24 17:32:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-01-24 17:32:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 340 transitions. [2018-01-24 17:32:54,566 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 340 transitions. Word has length 64 [2018-01-24 17:32:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:54,566 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 340 transitions. [2018-01-24 17:32:54,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:32:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 340 transitions. [2018-01-24 17:32:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 17:32:54,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:54,568 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] [2018-01-24 17:32:54,568 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:54,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1078175451, now seen corresponding path program 1 times [2018-01-24 17:32:54,568 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:54,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:54,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:54,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:54,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:54,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:54,948 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 17:32:54,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:54,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 17:32:54,948 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:54,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:32:54,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:32:54,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:32:54,949 INFO L87 Difference]: Start difference. First operand 308 states and 340 transitions. Second operand 11 states. [2018-01-24 17:32:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:55,946 INFO L93 Difference]: Finished difference Result 670 states and 748 transitions. [2018-01-24 17:32:55,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 17:32:55,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-01-24 17:32:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:55,949 INFO L225 Difference]: With dead ends: 670 [2018-01-24 17:32:55,949 INFO L226 Difference]: Without dead ends: 457 [2018-01-24 17:32:55,950 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2018-01-24 17:32:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-01-24 17:32:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 278. [2018-01-24 17:32:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-01-24 17:32:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 308 transitions. [2018-01-24 17:32:55,977 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 308 transitions. Word has length 64 [2018-01-24 17:32:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:55,977 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 308 transitions. [2018-01-24 17:32:55,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:32:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 308 transitions. [2018-01-24 17:32:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 17:32:55,978 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:55,978 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 17:32:55,979 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1463894548, now seen corresponding path program 1 times [2018-01-24 17:32:55,979 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:55,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:55,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:55,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:55,980 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:55,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:56,402 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 17:32:56,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:56,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:32:56,403 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:56,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:32:56,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:32:56,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:32:56,404 INFO L87 Difference]: Start difference. First operand 278 states and 308 transitions. Second operand 10 states. [2018-01-24 17:32:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:56,829 INFO L93 Difference]: Finished difference Result 436 states and 486 transitions. [2018-01-24 17:32:56,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 17:32:56,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-01-24 17:32:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:56,831 INFO L225 Difference]: With dead ends: 436 [2018-01-24 17:32:56,831 INFO L226 Difference]: Without dead ends: 435 [2018-01-24 17:32:56,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-01-24 17:32:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-01-24 17:32:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 279. [2018-01-24 17:32:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-24 17:32:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 309 transitions. [2018-01-24 17:32:56,857 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 309 transitions. Word has length 67 [2018-01-24 17:32:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:56,857 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 309 transitions. [2018-01-24 17:32:56,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:32:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 309 transitions. [2018-01-24 17:32:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-24 17:32:56,858 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:56,858 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] [2018-01-24 17:32:56,858 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:56,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1469129984, now seen corresponding path program 1 times [2018-01-24 17:32:56,859 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:56,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:56,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:56,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:56,860 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:56,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:32:57,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:57,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:32:57,009 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:57,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:57,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:57,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:57,010 INFO L87 Difference]: Start difference. First operand 279 states and 309 transitions. Second operand 5 states. [2018-01-24 17:32:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:57,129 INFO L93 Difference]: Finished difference Result 478 states and 536 transitions. [2018-01-24 17:32:57,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:32:57,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-01-24 17:32:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:57,131 INFO L225 Difference]: With dead ends: 478 [2018-01-24 17:32:57,131 INFO L226 Difference]: Without dead ends: 295 [2018-01-24 17:32:57,132 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-01-24 17:32:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 283. [2018-01-24 17:32:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-24 17:32:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2018-01-24 17:32:57,150 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 69 [2018-01-24 17:32:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:57,151 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2018-01-24 17:32:57,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2018-01-24 17:32:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-24 17:32:57,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:57,152 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] [2018-01-24 17:32:57,152 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:32:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1957356603, now seen corresponding path program 1 times [2018-01-24 17:32:57,153 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:57,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:57,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:57,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:57,154 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:57,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:57,328 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-01-24 17:32:57,329 ERROR L119 erpolLogProxyWrapper]: Interpolant 27 not inductive: (Check returned sat) [2018-01-24 17:32:57,330 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.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) 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 17:32:57,335 INFO L168 Benchmark]: Toolchain (without parser) took 34450.79 ms. Allocated memory was 306.2 MB in the beginning and 735.6 MB in the end (delta: 429.4 MB). Free memory was 265.1 MB in the beginning and 398.5 MB in the end (delta: -133.4 MB). Peak memory consumption was 296.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:32:57,336 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 306.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:32:57,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.82 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 251.1 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:32:57,337 INFO L168 Benchmark]: Boogie Preprocessor took 60.29 ms. Allocated memory is still 306.2 MB. Free memory was 251.1 MB in the beginning and 249.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 17:32:57,341 INFO L168 Benchmark]: RCFGBuilder took 827.00 ms. Allocated memory is still 306.2 MB. Free memory was 249.1 MB in the beginning and 204.2 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:32:57,342 INFO L168 Benchmark]: TraceAbstraction took 33277.92 ms. Allocated memory was 306.2 MB in the beginning and 735.6 MB in the end (delta: 429.4 MB). Free memory was 204.2 MB in the beginning and 398.5 MB in the end (delta: -194.3 MB). Peak memory consumption was 235.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:32:57,345 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.17 ms. Allocated memory is still 306.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 277.82 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 251.1 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 60.29 ms. Allocated memory is still 306.2 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 827.00 ms. Allocated memory is still 306.2 MB. Free memory was 249.1 MB in the beginning and 204.2 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 33277.92 ms. Allocated memory was 306.2 MB in the beginning and 735.6 MB in the end (delta: 429.4 MB). Free memory was 204.2 MB in the beginning and 398.5 MB in the end (delta: -194.3 MB). Peak memory consumption was 235.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 42 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 537 LocStat_NO_SUPPORTING_DISEQUALITIES : 150 LocStat_NO_DISJUNCTIONS : -84 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 47 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 54 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.240621 RENAME_VARIABLES(MILLISECONDS) : 3.106324 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.163427 PROJECTAWAY(MILLISECONDS) : 0.776545 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.007768 DISJOIN(MILLISECONDS) : 0.803503 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.191080 ADD_EQUALITY(MILLISECONDS) : 0.026311 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.038441 #CONJOIN_DISJUNCTIVE : 117 #RENAME_VARIABLES : 200 #UNFREEZE : 0 #CONJOIN : 178 #PROJECTAWAY : 149 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 189 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 13 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 51 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 649 LocStat_NO_SUPPORTING_DISEQUALITIES : 167 LocStat_NO_DISJUNCTIONS : -102 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 57 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 99 TransStat_NO_SUPPORTING_DISEQUALITIES : 20 TransStat_NO_DISJUNCTIONS : 68 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.602039 RENAME_VARIABLES(MILLISECONDS) : 0.442023 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.570253 PROJECTAWAY(MILLISECONDS) : 1.139141 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.003286 DISJOIN(MILLISECONDS) : 0.784829 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.473294 ADD_EQUALITY(MILLISECONDS) : 0.016671 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015498 #CONJOIN_DISJUNCTIVE : 161 #RENAME_VARIABLES : 296 #UNFREEZE : 0 #CONJOIN : 275 #PROJECTAWAY : 199 #ADD_WEAK_EQUALITY : 16 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 261 #ADD_EQUALITY : 94 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 53 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 680 LocStat_NO_SUPPORTING_DISEQUALITIES : 171 LocStat_NO_DISJUNCTIONS : -106 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 59 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 102 TransStat_NO_SUPPORTING_DISEQUALITIES : 20 TransStat_NO_DISJUNCTIONS : 70 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.514149 RENAME_VARIABLES(MILLISECONDS) : 0.392651 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.483723 PROJECTAWAY(MILLISECONDS) : 1.003070 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002837 DISJOIN(MILLISECONDS) : 0.679902 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.424585 ADD_EQUALITY(MILLISECONDS) : 0.033241 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.022195 #CONJOIN_DISJUNCTIVE : 169 #RENAME_VARIABLES : 310 #UNFREEZE : 0 #CONJOIN : 283 #PROJECTAWAY : 205 #ADD_WEAK_EQUALITY : 16 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 275 #ADD_EQUALITY : 97 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 * 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/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-32-57-361.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-32-57-361.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-32-57-361.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-32-57-361.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-32-57-361.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-32-57-361.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-32-57-361.csv Received shutdown request...