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.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:14:09,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:14:09,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:14:09,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:14:09,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:14:09,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:14:09,624 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:14:09,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:14:09,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:14:09,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:14:09,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:14:09,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:14:09,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:14:09,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:14:09,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:14:09,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:14:09,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:14:09,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:14:09,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:14:09,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:14:09,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:14:09,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:14:09,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:14:09,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:14:09,650 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:14:09,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:14:09,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:14:09,653 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:14:09,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:14:09,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:14:09,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:14:09,655 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.epf [2018-01-24 16:14:09,666 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:14:09,667 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:14:09,667 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:14:09,668 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:14:09,668 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:14:09,668 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:14:09,668 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:14:09,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:14:09,669 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:14:09,670 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:14:09,670 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:14:09,670 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:14:09,670 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:14:09,670 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:14:09,671 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:14:09,671 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:14:09,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:14:09,671 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:14:09,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:14:09,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:14:09,672 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:14:09,672 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:14:09,672 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:14:09,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:14:09,673 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:14:09,673 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:14:09,673 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:14:09,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:14:09,674 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:14:09,674 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:14:09,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:14:09,674 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:14:09,674 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:14:09,675 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:14:09,676 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:14:09,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:14:09,737 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:14:09,742 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:14:09,744 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:14:09,745 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:14:09,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:14:10,008 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:14:10,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:14:10,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:14:10,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:14:10,029 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:14:10,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:14:09" (1/1) ... [2018-01-24 16:14:10,042 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 04:14:10, skipping insertion in model container [2018-01-24 16:14:10,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:14:09" (1/1) ... [2018-01-24 16:14:10,065 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:14:10,144 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:14:10,296 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:14:10,323 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:14:10,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10 WrapperNode [2018-01-24 16:14:10,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:14:10,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:14:10,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:14:10,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:14:10,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10" (1/1) ... [2018-01-24 16:14:10,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10" (1/1) ... [2018-01-24 16:14:10,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10" (1/1) ... [2018-01-24 16:14:10,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10" (1/1) ... [2018-01-24 16:14:10,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10" (1/1) ... [2018-01-24 16:14:10,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10" (1/1) ... [2018-01-24 16:14:10,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10" (1/1) ... [2018-01-24 16:14:10,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:14:10,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:14:10,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:14:10,377 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:14:10,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10" (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 16:14:10,458 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:14:10,458 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:14:10,458 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:14:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:14:10,459 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:14:10,459 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:14:10,459 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:14:10,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:14:10,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:14:10,459 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:14:10,460 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:14:10,460 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:14:10,460 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:14:10,460 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:14:10,460 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:14:10,460 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:14:10,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:14:10,954 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:14:10,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:14:10 BoogieIcfgContainer [2018-01-24 16:14:10,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:14:10,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:14:10,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:14:10,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:14:10,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:14:09" (1/3) ... [2018-01-24 16:14:10,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379291fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:14:10, skipping insertion in model container [2018-01-24 16:14:10,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:14:10" (2/3) ... [2018-01-24 16:14:10,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379291fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:14:10, skipping insertion in model container [2018-01-24 16:14:10,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:14:10" (3/3) ... [2018-01-24 16:14:10,963 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:14:10,972 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:14:10,981 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-01-24 16:14:11,033 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:14:11,033 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:14:11,033 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:14:11,033 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:14:11,033 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:14:11,033 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:14:11,033 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:14:11,034 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:14:11,034 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:14:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-24 16:14:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:14:11,064 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:11,065 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:14:11,066 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:11,072 INFO L82 PathProgramCache]: Analyzing trace with hash 437540254, now seen corresponding path program 1 times [2018-01-24 16:14:11,075 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:11,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:11,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:11,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:11,136 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:11,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:11,257 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 16:14:11,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:11,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:14:11,259 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:11,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:14:11,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:14:11,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:14:11,276 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 4 states. [2018-01-24 16:14:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:11,605 INFO L93 Difference]: Finished difference Result 227 states and 260 transitions. [2018-01-24 16:14:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:14:11,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:14:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:11,616 INFO L225 Difference]: With dead ends: 227 [2018-01-24 16:14:11,617 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 16:14:11,620 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 16:14:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 16:14:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2018-01-24 16:14:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 16:14:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2018-01-24 16:14:11,657 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 8 [2018-01-24 16:14:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:11,657 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-01-24 16:14:11,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:14:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2018-01-24 16:14:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:14:11,658 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:11,658 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:14:11,658 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:11,659 INFO L82 PathProgramCache]: Analyzing trace with hash 437540255, now seen corresponding path program 1 times [2018-01-24 16:14:11,659 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:11,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:11,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:11,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:11,660 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:11,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:11,780 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 16:14:11,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:11,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:14:11,781 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:11,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:14:11,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:14:11,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:14:11,783 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 4 states. [2018-01-24 16:14:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:11,977 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2018-01-24 16:14:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:14:11,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:14:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:11,979 INFO L225 Difference]: With dead ends: 138 [2018-01-24 16:14:11,979 INFO L226 Difference]: Without dead ends: 130 [2018-01-24 16:14:11,980 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:14:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-24 16:14:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-01-24 16:14:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 16:14:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2018-01-24 16:14:11,995 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 8 [2018-01-24 16:14:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:11,995 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2018-01-24 16:14:11,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:14:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2018-01-24 16:14:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:14:11,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:11,997 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:14:11,997 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:11,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1223362610, now seen corresponding path program 1 times [2018-01-24 16:14:11,997 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:11,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:11,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:11,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:11,998 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:12,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:12,066 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 16:14:12,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:12,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:14:12,067 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:12,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:14:12,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:14:12,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:14:12,068 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand 5 states. [2018-01-24 16:14:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:12,448 INFO L93 Difference]: Finished difference Result 271 states and 295 transitions. [2018-01-24 16:14:12,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:14:12,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 16:14:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:12,452 INFO L225 Difference]: With dead ends: 271 [2018-01-24 16:14:12,453 INFO L226 Difference]: Without dead ends: 270 [2018-01-24 16:14:12,453 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 16:14:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-01-24 16:14:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 124. [2018-01-24 16:14:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 16:14:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-01-24 16:14:12,467 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 15 [2018-01-24 16:14:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:12,468 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-01-24 16:14:12,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:14:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-01-24 16:14:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:14:12,468 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:12,469 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:14:12,469 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1223362609, now seen corresponding path program 1 times [2018-01-24 16:14:12,469 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:12,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:12,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:12,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:12,471 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:12,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:12,595 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 16:14:12,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:12,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:14:12,596 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:12,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:14:12,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:14:12,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:14:12,597 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 5 states. [2018-01-24 16:14:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:13,021 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2018-01-24 16:14:13,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:14:13,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 16:14:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:13,024 INFO L225 Difference]: With dead ends: 226 [2018-01-24 16:14:13,024 INFO L226 Difference]: Without dead ends: 225 [2018-01-24 16:14:13,024 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 16:14:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-24 16:14:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 123. [2018-01-24 16:14:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 16:14:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-01-24 16:14:13,037 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 15 [2018-01-24 16:14:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:13,037 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-01-24 16:14:13,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:14:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-01-24 16:14:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:14:13,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:13,038 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:14:13,038 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1355242881, now seen corresponding path program 1 times [2018-01-24 16:14:13,039 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:13,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:13,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:13,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:13,040 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:13,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:13,105 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 16:14:13,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:13,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:14:13,106 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:13,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:14:13,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:14:13,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:14:13,106 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 4 states. [2018-01-24 16:14:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:13,261 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-01-24 16:14:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:14:13,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 16:14:13,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:13,262 INFO L225 Difference]: With dead ends: 143 [2018-01-24 16:14:13,263 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 16:14:13,263 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 16:14:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 16:14:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-01-24 16:14:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 16:14:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-01-24 16:14:13,274 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 19 [2018-01-24 16:14:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:13,275 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-01-24 16:14:13,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:14:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-01-24 16:14:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:14:13,275 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:13,276 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:14:13,276 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1355242882, now seen corresponding path program 1 times [2018-01-24 16:14:13,276 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:13,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:13,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:13,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:13,278 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:13,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:13,373 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 16:14:13,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:13,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:14:13,374 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:13,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:14:13,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:14:13,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:14:13,375 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 5 states. [2018-01-24 16:14:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:13,540 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-01-24 16:14:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:14:13,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 16:14:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:13,541 INFO L225 Difference]: With dead ends: 175 [2018-01-24 16:14:13,541 INFO L226 Difference]: Without dead ends: 164 [2018-01-24 16:14:13,542 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 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 16:14:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-24 16:14:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2018-01-24 16:14:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 16:14:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2018-01-24 16:14:13,549 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 19 [2018-01-24 16:14:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:13,550 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2018-01-24 16:14:13,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:14:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2018-01-24 16:14:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:14:13,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:13,550 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] [2018-01-24 16:14:13,551 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1348114365, now seen corresponding path program 1 times [2018-01-24 16:14:13,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:13,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:13,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:13,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:13,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:13,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:13,624 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 16:14:13,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:13,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:14:13,625 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:13,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:14:13,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:14:13,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:14:13,626 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand 6 states. [2018-01-24 16:14:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:13,881 INFO L93 Difference]: Finished difference Result 212 states and 246 transitions. [2018-01-24 16:14:13,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:14:13,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 16:14:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:13,882 INFO L225 Difference]: With dead ends: 212 [2018-01-24 16:14:13,882 INFO L226 Difference]: Without dead ends: 211 [2018-01-24 16:14:13,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:14:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-24 16:14:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 146. [2018-01-24 16:14:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 16:14:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2018-01-24 16:14:13,889 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 22 [2018-01-24 16:14:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:13,890 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2018-01-24 16:14:13,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:14:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2018-01-24 16:14:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:14:13,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:13,891 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] [2018-01-24 16:14:13,891 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:13,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1348114366, now seen corresponding path program 1 times [2018-01-24 16:14:13,891 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:13,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:13,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:13,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:13,892 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:13,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:13,974 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 16:14:13,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:13,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:14:13,974 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:13,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:14:13,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:14:13,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:14:13,975 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand 6 states. [2018-01-24 16:14:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:14,911 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2018-01-24 16:14:14,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:14:14,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 16:14:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:14,913 INFO L225 Difference]: With dead ends: 232 [2018-01-24 16:14:14,914 INFO L226 Difference]: Without dead ends: 222 [2018-01-24 16:14:14,914 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:14:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-24 16:14:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 130. [2018-01-24 16:14:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 16:14:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-01-24 16:14:14,926 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 22 [2018-01-24 16:14:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:14,927 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-01-24 16:14:14,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:14:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-01-24 16:14:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:14:14,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:14,928 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] [2018-01-24 16:14:14,928 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1821397366, now seen corresponding path program 1 times [2018-01-24 16:14:14,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:14,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:14,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:14,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:14,930 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:14,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:14,975 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 16:14:14,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:14,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:14:14,976 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:14,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:14:14,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:14:14,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:14:14,977 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 5 states. [2018-01-24 16:14:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:15,095 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2018-01-24 16:14:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:14:15,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 16:14:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:15,096 INFO L225 Difference]: With dead ends: 183 [2018-01-24 16:14:15,096 INFO L226 Difference]: Without dead ends: 148 [2018-01-24 16:14:15,097 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 16:14:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-24 16:14:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2018-01-24 16:14:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 16:14:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2018-01-24 16:14:15,104 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 25 [2018-01-24 16:14:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:15,104 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2018-01-24 16:14:15,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:14:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2018-01-24 16:14:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:14:15,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:15,106 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:14:15,106 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:15,106 INFO L82 PathProgramCache]: Analyzing trace with hash 203248485, now seen corresponding path program 1 times [2018-01-24 16:14:15,106 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:15,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:15,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:15,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:15,108 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:15,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:15,144 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 16:14:15,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:15,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:14:15,144 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:15,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:14:15,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:14:15,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:14:15,145 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand 4 states. [2018-01-24 16:14:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:15,212 INFO L93 Difference]: Finished difference Result 230 states and 269 transitions. [2018-01-24 16:14:15,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:14:15,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 16:14:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:15,213 INFO L225 Difference]: With dead ends: 230 [2018-01-24 16:14:15,214 INFO L226 Difference]: Without dead ends: 156 [2018-01-24 16:14:15,214 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:14:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-24 16:14:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-01-24 16:14:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 16:14:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2018-01-24 16:14:15,224 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 28 [2018-01-24 16:14:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:15,224 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2018-01-24 16:14:15,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:14:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2018-01-24 16:14:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:14:15,226 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:15,226 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 16:14:15,226 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:15,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1370430932, now seen corresponding path program 1 times [2018-01-24 16:14:15,227 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:15,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:15,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:15,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:15,228 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:15,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:15,304 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 16:14:15,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:15,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:14:15,306 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:15,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:14:15,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:14:15,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:14:15,307 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 5 states. [2018-01-24 16:14:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:15,650 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2018-01-24 16:14:15,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:14:15,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 16:14:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:15,652 INFO L225 Difference]: With dead ends: 233 [2018-01-24 16:14:15,652 INFO L226 Difference]: Without dead ends: 232 [2018-01-24 16:14:15,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 16:14:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-24 16:14:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 133. [2018-01-24 16:14:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 16:14:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2018-01-24 16:14:15,665 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 29 [2018-01-24 16:14:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:15,666 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2018-01-24 16:14:15,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:14:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2018-01-24 16:14:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:14:15,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:15,667 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 16:14:15,667 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1370430931, now seen corresponding path program 1 times [2018-01-24 16:14:15,668 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:15,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:15,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:15,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:15,669 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:15,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:15,756 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 16:14:15,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:15,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:14:15,756 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:15,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:14:15,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:14:15,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:14:15,757 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 5 states. [2018-01-24 16:14:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:16,374 INFO L93 Difference]: Finished difference Result 239 states and 277 transitions. [2018-01-24 16:14:16,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:14:16,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 16:14:16,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:16,375 INFO L225 Difference]: With dead ends: 239 [2018-01-24 16:14:16,375 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 16:14:16,376 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 16:14:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 16:14:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 132. [2018-01-24 16:14:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 16:14:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2018-01-24 16:14:16,385 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 29 [2018-01-24 16:14:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:16,385 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2018-01-24 16:14:16,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:14:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2018-01-24 16:14:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:14:16,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:16,386 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-24 16:14:16,386 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:16,387 INFO L82 PathProgramCache]: Analyzing trace with hash 811222786, now seen corresponding path program 1 times [2018-01-24 16:14:16,387 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:16,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:16,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:16,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:16,388 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:16,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:16,777 WARN L146 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 24 DAG size of output 16 [2018-01-24 16:14:16,852 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 16:14:16,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:16,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:14:16,852 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:16,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:14:16,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:14:16,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:14:16,853 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand 10 states. [2018-01-24 16:14:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:17,383 INFO L93 Difference]: Finished difference Result 240 states and 274 transitions. [2018-01-24 16:14:17,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:14:17,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-01-24 16:14:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:17,385 INFO L225 Difference]: With dead ends: 240 [2018-01-24 16:14:17,385 INFO L226 Difference]: Without dead ends: 239 [2018-01-24 16:14:17,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-01-24 16:14:17,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-24 16:14:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 149. [2018-01-24 16:14:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 16:14:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2018-01-24 16:14:17,401 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 30 [2018-01-24 16:14:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:17,401 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2018-01-24 16:14:17,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:14:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-01-24 16:14:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:14:17,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:17,403 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-24 16:14:17,403 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 811222787, now seen corresponding path program 1 times [2018-01-24 16:14:17,403 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:17,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:17,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:17,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:17,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:17,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:17,553 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 16:14:17,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:17,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:14:17,554 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:17,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:14:17,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:14:17,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:14:17,555 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 9 states. [2018-01-24 16:14:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:18,079 INFO L93 Difference]: Finished difference Result 294 states and 336 transitions. [2018-01-24 16:14:18,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:14:18,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 16:14:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:18,081 INFO L225 Difference]: With dead ends: 294 [2018-01-24 16:14:18,081 INFO L226 Difference]: Without dead ends: 218 [2018-01-24 16:14:18,082 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:14:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-24 16:14:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 145. [2018-01-24 16:14:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-24 16:14:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2018-01-24 16:14:18,095 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 30 [2018-01-24 16:14:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:18,095 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2018-01-24 16:14:18,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:14:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2018-01-24 16:14:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:14:18,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:18,096 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] [2018-01-24 16:14:18,096 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:18,096 INFO L82 PathProgramCache]: Analyzing trace with hash -518752177, now seen corresponding path program 1 times [2018-01-24 16:14:18,097 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:18,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:18,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:18,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:18,097 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:18,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:18,232 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 16:14:18,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:18,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:14:18,232 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:18,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:14:18,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:14:18,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:14:18,233 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 9 states. [2018-01-24 16:14:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:18,857 INFO L93 Difference]: Finished difference Result 399 states and 455 transitions. [2018-01-24 16:14:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:14:18,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-24 16:14:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:18,859 INFO L225 Difference]: With dead ends: 399 [2018-01-24 16:14:18,860 INFO L226 Difference]: Without dead ends: 398 [2018-01-24 16:14:18,860 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-01-24 16:14:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-24 16:14:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 161. [2018-01-24 16:14:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 16:14:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2018-01-24 16:14:18,884 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 33 [2018-01-24 16:14:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:18,884 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2018-01-24 16:14:18,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:14:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2018-01-24 16:14:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:14:18,885 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:18,901 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] [2018-01-24 16:14:18,901 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:18,901 INFO L82 PathProgramCache]: Analyzing trace with hash -518752176, now seen corresponding path program 1 times [2018-01-24 16:14:18,901 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:18,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:18,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:18,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:18,903 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:18,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:19,316 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 29 DAG size of output 25 [2018-01-24 16:14:19,452 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 16:14:19,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:19,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:14:19,453 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:19,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:14:19,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:14:19,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:14:19,454 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 9 states. [2018-01-24 16:14:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:20,118 INFO L93 Difference]: Finished difference Result 312 states and 355 transitions. [2018-01-24 16:14:20,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 16:14:20,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-24 16:14:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:20,120 INFO L225 Difference]: With dead ends: 312 [2018-01-24 16:14:20,120 INFO L226 Difference]: Without dead ends: 311 [2018-01-24 16:14:20,121 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:14:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-24 16:14:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 161. [2018-01-24 16:14:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 16:14:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2018-01-24 16:14:20,135 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 33 [2018-01-24 16:14:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:20,135 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2018-01-24 16:14:20,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:14:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2018-01-24 16:14:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:14:20,136 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:20,136 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] [2018-01-24 16:14:20,137 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:20,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1613392636, now seen corresponding path program 1 times [2018-01-24 16:14:20,137 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:20,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:20,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:20,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:20,138 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:20,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:14:20,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:14:20,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:14:20,168 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:14:20,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:14:20,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:14:20,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:14:20,169 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 4 states. [2018-01-24 16:14:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:14:20,197 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2018-01-24 16:14:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:14:20,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-24 16:14:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:14:20,200 INFO L225 Difference]: With dead ends: 241 [2018-01-24 16:14:20,200 INFO L226 Difference]: Without dead ends: 172 [2018-01-24 16:14:20,200 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:14:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-24 16:14:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2018-01-24 16:14:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 16:14:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2018-01-24 16:14:20,216 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 36 [2018-01-24 16:14:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:14:20,216 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2018-01-24 16:14:20,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:14:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2018-01-24 16:14:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 16:14:20,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:14:20,217 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] [2018-01-24 16:14:20,217 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:14:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1298991553, now seen corresponding path program 1 times [2018-01-24 16:14:20,218 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:14:20,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:20,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:14:20,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:14:20,219 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:14:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:14:20,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:14:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:14:20,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:14:20,357 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:14:20,358 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 16:14:20,360 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [24], [35], [36], [39], [43], [47], [49], [52], [107], [111], [117], [121], [122], [123], [125], [134], [136], [148], [150], [155], [156], [159], [165], [169], [175], [178], [222], [223], [227], [228], [229] [2018-01-24 16:14:20,412 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:14:20,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:15:02,031 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:15:02,032 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:15:02,033 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:15:02,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:15:02,033 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 16:15:02,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:02,039 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:15:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:02,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:15:02,095 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:15:02,096 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:15:02,105 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:15:02,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:15:02 BoogieIcfgContainer [2018-01-24 16:15:02,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:15:02,107 INFO L168 Benchmark]: Toolchain (without parser) took 52098.52 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 267.2 MB in the beginning and 821.5 MB in the end (delta: -554.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-24 16:15:02,108 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 308.3 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:15:02,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.02 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 255.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:15:02,109 INFO L168 Benchmark]: Boogie Preprocessor took 41.28 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:15:02,109 INFO L168 Benchmark]: RCFGBuilder took 577.87 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 216.3 MB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:15:02,110 INFO L168 Benchmark]: TraceAbstraction took 51149.98 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 216.3 MB in the beginning and 821.5 MB in the end (delta: -605.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-24 16:15:02,112 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.29 ms. Allocated memory is still 308.3 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 317.02 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 255.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.28 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 577.87 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 216.3 MB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51149.98 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 216.3 MB in the beginning and 821.5 MB in the end (delta: -605.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 63 error locations. TIMEOUT Result, 51.0s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1839 SDtfs, 3613 SDslu, 4060 SDs, 0 SdLazy, 4130 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 41.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1258 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 57112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-15-02-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-15-02-123.csv Completed graceful shutdown