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_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:51:41,926 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:51:41,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:51:41,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:51:41,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:51:41,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:51:41,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:51:41,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:51:41,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:51:41,951 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:51:41,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:51:41,952 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:51:41,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:51:41,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:51:41,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:51:41,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:51:41,958 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:51:41,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:51:41,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:51:41,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:51:41,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:51:41,966 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:51:41,966 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:51:41,967 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:51:41,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:51:41,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:51:41,970 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:51:41,970 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:51:41,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:51:41,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:51:41,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:51:41,972 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_smtcomp.epf [2018-01-25 05:51:41,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:51:41,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:51:41,983 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:51:41,984 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:51:41,984 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:51:41,984 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:51:41,984 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:51:41,984 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:51:41,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:51:41,985 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:51:41,986 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:51:41,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:51:41,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:51:41,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:51:41,986 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:51:41,987 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:51:41,987 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:51:41,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:51:41,987 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:51:41,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:51:41,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:51:41,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:51:41,988 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:51:41,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:51:41,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:51:41,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:51:41,989 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:51:41,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:51:41,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:51:41,990 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:51:41,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:51:41,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:51:41,990 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:51:41,990 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:51:41,991 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:51:41,991 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:51:42,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:51:42,041 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:51:42,045 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:51:42,047 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:51:42,048 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:51:42,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-01-25 05:51:42,256 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:51:42,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:51:42,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:51:42,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:51:42,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:51:42,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:51:42" (1/1) ... [2018-01-25 05:51:42,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365d5287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42, skipping insertion in model container [2018-01-25 05:51:42,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:51:42" (1/1) ... [2018-01-25 05:51:42,292 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:51:42,333 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:51:42,453 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:51:42,476 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:51:42,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42 WrapperNode [2018-01-25 05:51:42,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:51:42,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:51:42,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:51:42,484 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:51:42,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42" (1/1) ... [2018-01-25 05:51:42,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42" (1/1) ... [2018-01-25 05:51:42,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42" (1/1) ... [2018-01-25 05:51:42,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42" (1/1) ... [2018-01-25 05:51:42,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42" (1/1) ... [2018-01-25 05:51:42,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42" (1/1) ... [2018-01-25 05:51:42,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42" (1/1) ... [2018-01-25 05:51:42,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:51:42,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:51:42,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:51:42,524 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:51:42,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42" (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-25 05:51:42,574 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:51:42,575 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:51:42,575 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 05:51:42,575 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:51:42,575 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:51:42,575 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:51:42,575 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:51:42,575 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:51:42,575 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:51:42,575 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:51:42,576 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:51:42,576 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:51:42,576 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-25 05:51:42,576 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:51:42,576 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 05:51:42,576 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:51:42,576 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:51:42,576 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:51:43,126 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:51:43,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:51:43 BoogieIcfgContainer [2018-01-25 05:51:43,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:51:43,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:51:43,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:51:43,131 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:51:43,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:51:42" (1/3) ... [2018-01-25 05:51:43,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b122cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:51:43, skipping insertion in model container [2018-01-25 05:51:43,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:51:42" (2/3) ... [2018-01-25 05:51:43,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b122cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:51:43, skipping insertion in model container [2018-01-25 05:51:43,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:51:43" (3/3) ... [2018-01-25 05:51:43,135 INFO L105 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-01-25 05:51:43,142 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:51:43,148 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-25 05:51:43,200 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:51:43,200 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:51:43,200 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:51:43,200 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:51:43,201 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:51:43,201 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:51:43,201 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:51:43,201 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:51:43,202 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:51:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-25 05:51:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 05:51:43,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:43,235 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:51:43,235 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash -683315734, now seen corresponding path program 1 times [2018-01-25 05:51:43,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:43,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:43,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:43,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:43,306 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:43,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:43,419 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-25 05:51:43,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:43,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:51:43,421 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:43,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:51:43,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:51:43,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:51:43,519 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2018-01-25 05:51:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:43,815 INFO L93 Difference]: Finished difference Result 268 states and 291 transitions. [2018-01-25 05:51:43,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:51:43,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 05:51:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:43,828 INFO L225 Difference]: With dead ends: 268 [2018-01-25 05:51:43,829 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 05:51:43,833 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-25 05:51:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 05:51:43,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-01-25 05:51:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 05:51:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-01-25 05:51:43,880 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8 [2018-01-25 05:51:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:43,881 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-01-25 05:51:43,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:51:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-01-25 05:51:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 05:51:43,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:43,882 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:51:43,882 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:43,882 INFO L82 PathProgramCache]: Analyzing trace with hash -683315733, now seen corresponding path program 1 times [2018-01-25 05:51:43,883 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:43,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:43,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:43,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:43,884 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:43,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:43,990 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-25 05:51:43,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:43,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:51:43,991 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:43,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:51:43,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:51:43,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:51:43,993 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 4 states. [2018-01-25 05:51:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:44,161 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-01-25 05:51:44,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:51:44,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 05:51:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:44,163 INFO L225 Difference]: With dead ends: 128 [2018-01-25 05:51:44,164 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 05:51:44,165 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-25 05:51:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 05:51:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-01-25 05:51:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 05:51:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-01-25 05:51:44,176 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 8 [2018-01-25 05:51:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:44,176 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-01-25 05:51:44,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:51:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-01-25 05:51:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:51:44,177 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:44,177 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:51:44,177 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912018, now seen corresponding path program 1 times [2018-01-25 05:51:44,178 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:44,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:44,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:44,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:44,179 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:44,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:44,243 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-25 05:51:44,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:44,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:51:44,243 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:44,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:51:44,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:51:44,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:51:44,244 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 4 states. [2018-01-25 05:51:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:44,392 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-25 05:51:44,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:51:44,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-01-25 05:51:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:44,394 INFO L225 Difference]: With dead ends: 139 [2018-01-25 05:51:44,394 INFO L226 Difference]: Without dead ends: 136 [2018-01-25 05:51:44,395 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-25 05:51:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-25 05:51:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-01-25 05:51:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 05:51:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-01-25 05:51:44,402 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 12 [2018-01-25 05:51:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:44,402 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-01-25 05:51:44,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:51:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-01-25 05:51:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:51:44,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:44,403 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:51:44,403 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:44,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912017, now seen corresponding path program 1 times [2018-01-25 05:51:44,404 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:44,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:44,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:44,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:44,405 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:44,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:44,488 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-25 05:51:44,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:44,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:51:44,488 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:44,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:51:44,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:51:44,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:51:44,489 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-01-25 05:51:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:44,605 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-25 05:51:44,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:51:44,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-01-25 05:51:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:44,607 INFO L225 Difference]: With dead ends: 128 [2018-01-25 05:51:44,607 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 05:51:44,608 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-25 05:51:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 05:51:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-01-25 05:51:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 05:51:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-25 05:51:44,618 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 12 [2018-01-25 05:51:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:44,618 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-25 05:51:44,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:51:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-25 05:51:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:51:44,619 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:44,620 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:51:44,620 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:44,620 INFO L82 PathProgramCache]: Analyzing trace with hash -424566030, now seen corresponding path program 1 times [2018-01-25 05:51:44,620 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:44,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:44,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:44,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:44,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:44,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:44,683 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-25 05:51:44,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:44,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:51:44,683 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:44,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:51:44,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:51:44,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:51:44,685 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 4 states. [2018-01-25 05:51:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:44,806 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-01-25 05:51:44,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:51:44,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 05:51:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:44,807 INFO L225 Difference]: With dead ends: 124 [2018-01-25 05:51:44,807 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 05:51:44,808 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-25 05:51:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 05:51:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-25 05:51:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 05:51:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-25 05:51:44,817 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 20 [2018-01-25 05:51:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:44,817 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-25 05:51:44,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:51:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-25 05:51:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:51:44,826 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:44,826 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:51:44,826 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash -424566029, now seen corresponding path program 1 times [2018-01-25 05:51:44,826 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:44,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:44,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:44,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:44,828 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:44,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:44,958 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-25 05:51:44,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:44,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:51:44,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:44,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:51:44,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:51:44,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:51:44,985 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-01-25 05:51:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:45,070 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-01-25 05:51:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:51:45,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 05:51:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:45,071 INFO L225 Difference]: With dead ends: 119 [2018-01-25 05:51:45,071 INFO L226 Difference]: Without dead ends: 114 [2018-01-25 05:51:45,071 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-25 05:51:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-25 05:51:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-25 05:51:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 05:51:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-01-25 05:51:45,079 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2018-01-25 05:51:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:45,079 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-01-25 05:51:45,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:51:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-01-25 05:51:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:51:45,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:45,080 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-25 05:51:45,080 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:45,081 INFO L82 PathProgramCache]: Analyzing trace with hash -276644944, now seen corresponding path program 1 times [2018-01-25 05:51:45,081 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:45,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:45,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:45,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:45,082 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:45,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:45,239 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-25 05:51:45,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:45,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:51:45,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:45,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:51:45,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:51:45,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:51:45,240 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 8 states. [2018-01-25 05:51:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:45,548 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2018-01-25 05:51:45,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:51:45,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-25 05:51:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:45,549 INFO L225 Difference]: With dead ends: 185 [2018-01-25 05:51:45,549 INFO L226 Difference]: Without dead ends: 177 [2018-01-25 05:51:45,550 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:51:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-25 05:51:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2018-01-25 05:51:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 05:51:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2018-01-25 05:51:45,557 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 21 [2018-01-25 05:51:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:45,557 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2018-01-25 05:51:45,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:51:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-01-25 05:51:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:51:45,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:45,558 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-25 05:51:45,558 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:45,558 INFO L82 PathProgramCache]: Analyzing trace with hash -276644943, now seen corresponding path program 1 times [2018-01-25 05:51:45,558 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:45,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:45,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:45,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:45,559 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:45,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:45,736 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-25 05:51:45,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:45,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:51:45,736 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:45,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:51:45,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:51:45,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:51:45,737 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 9 states. [2018-01-25 05:51:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:46,011 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions. [2018-01-25 05:51:46,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:51:46,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 05:51:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:46,013 INFO L225 Difference]: With dead ends: 196 [2018-01-25 05:51:46,013 INFO L226 Difference]: Without dead ends: 187 [2018-01-25 05:51:46,013 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:51:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-25 05:51:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2018-01-25 05:51:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-25 05:51:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2018-01-25 05:51:46,020 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 21 [2018-01-25 05:51:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:46,020 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2018-01-25 05:51:46,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:51:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2018-01-25 05:51:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:51:46,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:46,021 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] [2018-01-25 05:51:46,021 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:46,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1018638093, now seen corresponding path program 1 times [2018-01-25 05:51:46,022 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:46,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:46,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:46,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:46,023 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:46,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:46,338 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-25 05:51:46,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:46,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:51:46,338 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:46,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 05:51:46,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 05:51:46,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:51:46,339 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand 14 states. [2018-01-25 05:51:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:46,898 INFO L93 Difference]: Finished difference Result 376 states and 463 transitions. [2018-01-25 05:51:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:51:46,899 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-01-25 05:51:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:46,902 INFO L225 Difference]: With dead ends: 376 [2018-01-25 05:51:46,904 INFO L226 Difference]: Without dead ends: 228 [2018-01-25 05:51:46,906 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-01-25 05:51:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-25 05:51:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 171. [2018-01-25 05:51:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-25 05:51:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2018-01-25 05:51:46,918 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 30 [2018-01-25 05:51:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:46,919 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2018-01-25 05:51:46,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 05:51:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2018-01-25 05:51:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:51:46,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:46,920 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] [2018-01-25 05:51:46,921 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:46,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2019932176, now seen corresponding path program 1 times [2018-01-25 05:51:46,921 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:46,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:46,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:46,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:46,922 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:46,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:47,394 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-25 05:51:47,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:47,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:51:47,395 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:47,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 05:51:47,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 05:51:47,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:51:47,396 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand 14 states. [2018-01-25 05:51:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:47,837 INFO L93 Difference]: Finished difference Result 324 states and 393 transitions. [2018-01-25 05:51:47,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:51:47,838 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-01-25 05:51:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:47,839 INFO L225 Difference]: With dead ends: 324 [2018-01-25 05:51:47,839 INFO L226 Difference]: Without dead ends: 176 [2018-01-25 05:51:47,841 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-01-25 05:51:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-25 05:51:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-01-25 05:51:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-25 05:51:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2018-01-25 05:51:47,850 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 32 [2018-01-25 05:51:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:47,851 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2018-01-25 05:51:47,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 05:51:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2018-01-25 05:51:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 05:51:47,852 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:47,852 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] [2018-01-25 05:51:47,852 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -489397259, now seen corresponding path program 1 times [2018-01-25 05:51:47,853 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:47,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:47,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:47,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:47,854 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:47,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:47,919 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-25 05:51:47,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:51:47,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:51:47,920 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:51:47,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:51:47,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:51:47,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:51:47,921 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand 3 states. [2018-01-25 05:51:47,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:51:47,940 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2018-01-25 05:51:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:51:47,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-01-25 05:51:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:51:47,943 INFO L225 Difference]: With dead ends: 207 [2018-01-25 05:51:47,943 INFO L226 Difference]: Without dead ends: 155 [2018-01-25 05:51:47,944 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:51:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-25 05:51:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2018-01-25 05:51:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 05:51:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-01-25 05:51:47,952 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 40 [2018-01-25 05:51:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:51:47,953 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-01-25 05:51:47,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:51:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-01-25 05:51:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 05:51:47,954 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:51:47,954 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:51:47,955 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 05:51:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244567, now seen corresponding path program 1 times [2018-01-25 05:51:47,955 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:51:47,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:47,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:51:47,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:51:47,956 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:51:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:51:47,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:51:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:51:48,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:51:48,149 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:51:48,150 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-25 05:51:48,152 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [9], [10], [13], [16], [20], [23], [26], [32], [36], [41], [117], [118], [122], [123], [124], [125], [128], [129], [131], [134], [135], [138], [144], [145], [148], [151], [154], [178], [179], [180], [181], [183], [184], [185] [2018-01-25 05:51:48,213 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:51:48,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown