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/dll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:07:45,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:07:45,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:07:45,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:07:45,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:07:45,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:07:45,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:07:45,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:07:45,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:07:45,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:07:45,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:07:45,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:07:45,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:07:45,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:07:45,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:07:45,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:07:45,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:07:45,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:07:45,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:07:45,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:07:45,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:07:45,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:07:45,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:07:45,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:07:45,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:07:45,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:07:45,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:07:45,305 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:07:45,305 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:07:45,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:07:45,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:07:45,306 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:07:45,316 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:07:45,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:07:45,317 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:07:45,317 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:07:45,318 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:07:45,318 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:07:45,318 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:07:45,319 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:07:45,319 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:07:45,319 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:07:45,319 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:07:45,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:07:45,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:07:45,320 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:07:45,320 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:07:45,320 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:07:45,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:07:45,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:07:45,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:07:45,321 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:07:45,321 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:07:45,322 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:07:45,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:07:45,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:07:45,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:07:45,322 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:07:45,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:07:45,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:07:45,323 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:07:45,323 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:07:45,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:07:45,324 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:07:45,324 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:07:45,325 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:07:45,325 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:07:45,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:07:45,378 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:07:45,382 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:07:45,383 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:07:45,383 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:07:45,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:07:45,554 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:07:45,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:07:45,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:07:45,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:07:45,566 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:07:45,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:07:45" (1/1) ... [2018-01-24 16:07:45,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bda4018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45, skipping insertion in model container [2018-01-24 16:07:45,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:07:45" (1/1) ... [2018-01-24 16:07:45,589 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:07:45,629 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:07:45,747 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:07:45,764 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:07:45,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45 WrapperNode [2018-01-24 16:07:45,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:07:45,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:07:45,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:07:45,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:07:45,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45" (1/1) ... [2018-01-24 16:07:45,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45" (1/1) ... [2018-01-24 16:07:45,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45" (1/1) ... [2018-01-24 16:07:45,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45" (1/1) ... [2018-01-24 16:07:45,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45" (1/1) ... [2018-01-24 16:07:45,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45" (1/1) ... [2018-01-24 16:07:45,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45" (1/1) ... [2018-01-24 16:07:45,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:07:45,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:07:45,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:07:45,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:07:45,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45" (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:07:45,856 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:07:45,856 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:07:45,856 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:07:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:07:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:07:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:07:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:07:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:07:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:07:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:07:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:07:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:07:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:07:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:07:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:07:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:07:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:07:46,278 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:07:46,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:07:46 BoogieIcfgContainer [2018-01-24 16:07:46,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:07:46,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:07:46,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:07:46,318 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:07:46,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:07:45" (1/3) ... [2018-01-24 16:07:46,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36062e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:07:46, skipping insertion in model container [2018-01-24 16:07:46,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:07:45" (2/3) ... [2018-01-24 16:07:46,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36062e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:07:46, skipping insertion in model container [2018-01-24 16:07:46,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:07:46" (3/3) ... [2018-01-24 16:07:46,321 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:07:46,328 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:07:46,335 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-01-24 16:07:46,387 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:07:46,388 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:07:46,388 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:07:46,388 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:07:46,388 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:07:46,388 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:07:46,388 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:07:46,389 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:07:46,389 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:07:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-01-24 16:07:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:07:46,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:46,415 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:46,415 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash 414289043, now seen corresponding path program 1 times [2018-01-24 16:07:46,421 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:46,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:46,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:46,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:46,463 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:46,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:46,592 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:07:46,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:46,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:07:46,595 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:46,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:07:46,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:07:46,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:07:46,700 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2018-01-24 16:07:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:46,974 INFO L93 Difference]: Finished difference Result 222 states and 262 transitions. [2018-01-24 16:07:46,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:07:46,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:07:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:46,988 INFO L225 Difference]: With dead ends: 222 [2018-01-24 16:07:46,989 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 16:07:46,993 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:07:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 16:07:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-01-24 16:07:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 16:07:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-24 16:07:47,035 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 8 [2018-01-24 16:07:47,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:47,035 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-24 16:07:47,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:07:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-24 16:07:47,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:07:47,036 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:47,036 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:47,036 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:47,037 INFO L82 PathProgramCache]: Analyzing trace with hash 414289044, now seen corresponding path program 1 times [2018-01-24 16:07:47,037 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:47,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:47,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:47,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:47,039 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:47,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:47,116 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:07:47,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:47,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:07:47,117 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:47,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:07:47,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:07:47,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:07:47,119 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 4 states. [2018-01-24 16:07:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:47,249 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-01-24 16:07:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:07:47,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:07:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:47,253 INFO L225 Difference]: With dead ends: 116 [2018-01-24 16:07:47,254 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 16:07:47,255 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:07:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 16:07:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-01-24 16:07:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-24 16:07:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-24 16:07:47,266 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-01-24 16:07:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:47,266 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-24 16:07:47,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:07:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-24 16:07:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:07:47,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:47,267 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:47,268 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556376, now seen corresponding path program 1 times [2018-01-24 16:07:47,268 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:47,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:47,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:47,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:47,270 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:47,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:47,339 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:07:47,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:47,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:07:47,339 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:47,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:07:47,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:07:47,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:07:47,341 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-01-24 16:07:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:47,469 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-01-24 16:07:47,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:07:47,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 16:07:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:47,471 INFO L225 Difference]: With dead ends: 107 [2018-01-24 16:07:47,471 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 16:07:47,472 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:07:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 16:07:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-01-24 16:07:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 16:07:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-24 16:07:47,482 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2018-01-24 16:07:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:47,483 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-24 16:07:47,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:07:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-24 16:07:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:07:47,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:47,484 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:47,484 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:47,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556377, now seen corresponding path program 1 times [2018-01-24 16:07:47,484 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:47,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:47,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:47,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:47,486 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:47,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:47,583 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:07:47,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:47,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:07:47,583 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:47,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:07:47,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:07:47,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:07:47,584 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-01-24 16:07:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:47,728 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-24 16:07:47,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:07:47,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 16:07:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:47,730 INFO L225 Difference]: With dead ends: 117 [2018-01-24 16:07:47,730 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 16:07:47,731 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:07:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 16:07:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-01-24 16:07:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 16:07:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-24 16:07:47,742 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2018-01-24 16:07:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:47,742 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-24 16:07:47,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:07:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-24 16:07:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:07:47,743 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:47,743 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:47,744 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:47,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426684, now seen corresponding path program 1 times [2018-01-24 16:07:47,744 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:47,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:47,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:47,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:47,745 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:47,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:47,835 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:07:47,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:47,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:07:47,836 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:47,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:07:47,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:07:47,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:07:47,837 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-01-24 16:07:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:48,081 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-24 16:07:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:07:48,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:07:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:48,083 INFO L225 Difference]: With dead ends: 146 [2018-01-24 16:07:48,083 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 16:07:48,083 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:07:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 16:07:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2018-01-24 16:07:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 16:07:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-24 16:07:48,094 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 18 [2018-01-24 16:07:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:48,094 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-24 16:07:48,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:07:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-24 16:07:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:07:48,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:48,095 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:48,095 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426685, now seen corresponding path program 1 times [2018-01-24 16:07:48,095 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:48,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:48,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:48,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:48,097 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:48,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:48,172 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:07:48,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:48,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:07:48,172 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:48,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:07:48,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:07:48,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:07:48,173 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 5 states. [2018-01-24 16:07:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:48,352 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-24 16:07:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:07:48,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:07:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:48,353 INFO L225 Difference]: With dead ends: 142 [2018-01-24 16:07:48,354 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 16:07:48,354 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:07:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 16:07:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2018-01-24 16:07:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 16:07:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-24 16:07:48,361 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 18 [2018-01-24 16:07:48,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:48,361 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-24 16:07:48,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:07:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-24 16:07:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:07:48,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:48,362 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:07:48,362 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867382, now seen corresponding path program 1 times [2018-01-24 16:07:48,362 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:48,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:48,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:48,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:48,363 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:48,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:07:48,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:48,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:07:48,600 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:48,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:07:48,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:07:48,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:07:48,601 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 10 states. [2018-01-24 16:07:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:48,949 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-24 16:07:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:07:48,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 16:07:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:48,950 INFO L225 Difference]: With dead ends: 140 [2018-01-24 16:07:48,950 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 16:07:48,951 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:07:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 16:07:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2018-01-24 16:07:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 16:07:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-24 16:07:48,960 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 22 [2018-01-24 16:07:48,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:48,960 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-24 16:07:48,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:07:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-24 16:07:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:07:48,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:48,961 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:07:48,961 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867381, now seen corresponding path program 1 times [2018-01-24 16:07:48,962 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:48,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:48,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:48,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:48,963 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:48,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:49,241 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:07:49,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:49,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:07:49,242 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:49,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:07:49,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:07:49,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:07:49,243 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2018-01-24 16:07:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:49,548 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-24 16:07:49,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:07:49,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 16:07:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:49,550 INFO L225 Difference]: With dead ends: 177 [2018-01-24 16:07:49,550 INFO L226 Difference]: Without dead ends: 172 [2018-01-24 16:07:49,551 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-24 16:07:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-24 16:07:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2018-01-24 16:07:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-24 16:07:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-01-24 16:07:49,562 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2018-01-24 16:07:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:49,562 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-01-24 16:07:49,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:07:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-01-24 16:07:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:07:49,563 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:49,563 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:07:49,563 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash 687906629, now seen corresponding path program 1 times [2018-01-24 16:07:49,564 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:49,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:49,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:49,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:49,565 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:49,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:49,680 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:07:49,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:49,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:07:49,680 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:49,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:07:49,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:07:49,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:07:49,681 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 9 states. [2018-01-24 16:07:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:50,077 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-24 16:07:50,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:07:50,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 16:07:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:50,078 INFO L225 Difference]: With dead ends: 123 [2018-01-24 16:07:50,078 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 16:07:50,079 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:07:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 16:07:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-01-24 16:07:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 16:07:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-01-24 16:07:50,085 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 22 [2018-01-24 16:07:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:50,086 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-01-24 16:07:50,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:07:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-01-24 16:07:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:07:50,087 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:50,087 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:07:50,087 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash 687906630, now seen corresponding path program 1 times [2018-01-24 16:07:50,087 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:50,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:50,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:50,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:50,088 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:50,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:50,200 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:07:50,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:50,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:07:50,201 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:50,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:07:50,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:07:50,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:07:50,201 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2018-01-24 16:07:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:50,831 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-24 16:07:50,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:07:50,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 16:07:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:50,832 INFO L225 Difference]: With dead ends: 123 [2018-01-24 16:07:50,832 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 16:07:50,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-24 16:07:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 16:07:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2018-01-24 16:07:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 16:07:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-24 16:07:50,838 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 22 [2018-01-24 16:07:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:50,838 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-24 16:07:50,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:07:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-24 16:07:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:07:50,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:50,839 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:50,839 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:50,839 INFO L82 PathProgramCache]: Analyzing trace with hash 36223985, now seen corresponding path program 1 times [2018-01-24 16:07:50,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:50,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:50,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:50,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:50,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:50,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:51,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:07:51,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:51,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:07:51,105 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:51,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:07:51,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:07:51,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:07:51,106 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 10 states. [2018-01-24 16:07:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:51,463 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-01-24 16:07:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:07:51,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-24 16:07:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:51,464 INFO L225 Difference]: With dead ends: 147 [2018-01-24 16:07:51,464 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 16:07:51,464 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-24 16:07:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 16:07:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2018-01-24 16:07:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 16:07:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-01-24 16:07:51,473 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 26 [2018-01-24 16:07:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:51,473 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-01-24 16:07:51,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:07:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-01-24 16:07:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:07:51,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:51,475 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:51,475 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash 36223986, now seen corresponding path program 1 times [2018-01-24 16:07:51,475 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:51,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:51,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:51,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:51,477 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:51,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:51,788 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:07:51,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:51,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:07:51,789 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:51,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:07:51,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:07:51,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:07:51,790 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 9 states. [2018-01-24 16:07:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:52,131 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-01-24 16:07:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:07:52,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 16:07:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:52,132 INFO L225 Difference]: With dead ends: 159 [2018-01-24 16:07:52,132 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 16:07:52,132 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:07:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 16:07:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2018-01-24 16:07:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 16:07:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-01-24 16:07:52,139 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 26 [2018-01-24 16:07:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:52,139 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-01-24 16:07:52,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:07:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-01-24 16:07:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:07:52,140 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:52,140 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:52,140 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483890, now seen corresponding path program 1 times [2018-01-24 16:07:52,140 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:52,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:52,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:52,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:52,141 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:52,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:52,247 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:07:52,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:52,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:07:52,247 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:52,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:07:52,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:07:52,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:07:52,248 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-01-24 16:07:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:52,586 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-01-24 16:07:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:07:52,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 16:07:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:52,587 INFO L225 Difference]: With dead ends: 140 [2018-01-24 16:07:52,588 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 16:07:52,588 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:07:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 16:07:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2018-01-24 16:07:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 16:07:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-24 16:07:52,594 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2018-01-24 16:07:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:52,595 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-24 16:07:52,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:07:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-24 16:07:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:07:52,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:52,596 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:52,596 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483891, now seen corresponding path program 1 times [2018-01-24 16:07:52,596 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:52,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:52,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:52,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:52,597 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:52,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:52,906 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:07:52,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:52,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:07:52,906 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:52,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:07:52,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:07:52,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:07:52,907 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 11 states. [2018-01-24 16:07:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:53,359 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2018-01-24 16:07:53,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 16:07:53,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-24 16:07:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:53,361 INFO L225 Difference]: With dead ends: 169 [2018-01-24 16:07:53,361 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 16:07:53,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-01-24 16:07:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 16:07:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2018-01-24 16:07:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 16:07:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-01-24 16:07:53,374 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 27 [2018-01-24 16:07:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:53,375 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-01-24 16:07:53,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:07:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-01-24 16:07:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:07:53,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:53,384 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:53,384 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash -152260992, now seen corresponding path program 1 times [2018-01-24 16:07:53,385 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:53,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:53,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:53,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:53,386 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:53,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:07:53,653 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:07:53,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:53,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:07:53,653 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:53,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:07:53,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:07:53,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:07:53,654 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 10 states. [2018-01-24 16:07:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:54,145 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-01-24 16:07:54,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:07:54,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 16:07:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:54,147 INFO L225 Difference]: With dead ends: 144 [2018-01-24 16:07:54,147 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 16:07:54,147 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:07:54,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 16:07:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2018-01-24 16:07:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 16:07:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-01-24 16:07:54,161 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 31 [2018-01-24 16:07:54,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:54,162 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-01-24 16:07:54,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:07:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-01-24 16:07:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:07:54,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:54,163 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:54,163 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:54,164 INFO L82 PathProgramCache]: Analyzing trace with hash -771319912, now seen corresponding path program 1 times [2018-01-24 16:07:54,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:54,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:54,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:54,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:54,165 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:54,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:54,348 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:07:54,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:54,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:07:54,349 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:54,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:07:54,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:07:54,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:07:54,349 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 9 states. [2018-01-24 16:07:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:54,662 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-24 16:07:54,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:07:54,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-24 16:07:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:54,663 INFO L225 Difference]: With dead ends: 154 [2018-01-24 16:07:54,663 INFO L226 Difference]: Without dead ends: 153 [2018-01-24 16:07:54,664 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:07:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-24 16:07:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2018-01-24 16:07:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 16:07:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-01-24 16:07:54,672 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2018-01-24 16:07:54,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:54,673 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-01-24 16:07:54,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:07:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-01-24 16:07:54,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:07:54,673 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:54,673 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:54,673 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:54,674 INFO L82 PathProgramCache]: Analyzing trace with hash -771319913, now seen corresponding path program 1 times [2018-01-24 16:07:54,674 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:54,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:54,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:54,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:54,675 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:54,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:55,027 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:07:55,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:55,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:07:55,028 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:55,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:07:55,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:07:55,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:07:55,028 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-01-24 16:07:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:55,377 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-01-24 16:07:55,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:07:55,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 16:07:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:55,379 INFO L225 Difference]: With dead ends: 148 [2018-01-24 16:07:55,379 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 16:07:55,379 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-24 16:07:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 16:07:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-01-24 16:07:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 16:07:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-01-24 16:07:55,393 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2018-01-24 16:07:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:55,393 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2018-01-24 16:07:55,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:07:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2018-01-24 16:07:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:07:55,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:55,394 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:55,395 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash -246205034, now seen corresponding path program 1 times [2018-01-24 16:07:55,395 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:55,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:55,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:55,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:55,396 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:55,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:07:55,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:07:55,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 16:07:55,823 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:07:55,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:07:55,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:07:55,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:07:55,824 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 13 states. [2018-01-24 16:07:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:07:56,126 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-01-24 16:07:56,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:07:56,127 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-24 16:07:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:07:56,127 INFO L225 Difference]: With dead ends: 165 [2018-01-24 16:07:56,127 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 16:07:56,128 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-01-24 16:07:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 16:07:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-01-24 16:07:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 16:07:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-01-24 16:07:56,136 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 33 [2018-01-24 16:07:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:07:56,136 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-01-24 16:07:56,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:07:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-01-24 16:07:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:07:56,137 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:07:56,137 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:07:56,137 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:07:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590979, now seen corresponding path program 1 times [2018-01-24 16:07:56,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:07:56,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:56,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:56,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:07:56,139 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:07:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:56,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:07:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:07:56,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:07:56,330 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:07:56,331 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 16:07:56,333 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [83], [86], [89], [93], [98], [102], [110], [112], [113], [119], [123], [124], [127], [130], [133], [151], [155], [161], [164], [201], [202], [206], [207], [208] [2018-01-24 16:07:56,378 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:07:56,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:08:44,652 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:08:44,652 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:08:44,653 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:08:44,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:08:44,653 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:08:44,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:44,659 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:08:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:44,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:08:44,729 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:08:44,730 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:08:44,737 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:08:44,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:08:44 BoogieIcfgContainer [2018-01-24 16:08:44,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:08:44,738 INFO L168 Benchmark]: Toolchain (without parser) took 59184.21 ms. Allocated memory was 308.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 267.4 MB in the beginning and 560.5 MB in the end (delta: -293.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-24 16:08:44,740 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:08:44,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.50 ms. Allocated memory is still 308.3 MB. Free memory was 267.4 MB in the beginning and 255.4 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:08:44,741 INFO L168 Benchmark]: Boogie Preprocessor took 37.61 ms. Allocated memory is still 308.3 MB. Free memory was 255.4 MB in the beginning and 253.4 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:08:44,741 INFO L168 Benchmark]: RCFGBuilder took 505.61 ms. Allocated memory is still 308.3 MB. Free memory was 253.4 MB in the beginning and 222.8 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:08:44,741 INFO L168 Benchmark]: TraceAbstraction took 58421.63 ms. Allocated memory was 308.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 222.8 MB in the beginning and 560.5 MB in the end (delta: -337.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-24 16:08:44,743 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.50 ms. Allocated memory is still 308.3 MB. Free memory was 267.4 MB in the beginning and 255.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.61 ms. Allocated memory is still 308.3 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 505.61 ms. Allocated memory is still 308.3 MB. Free memory was 253.4 MB in the beginning and 222.8 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58421.63 ms. Allocated memory was 308.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 222.8 MB in the beginning and 560.5 MB in the end (delta: -337.6 MB). Peak memory consumption was 1.6 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 989). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 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 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 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 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 47 error locations. TIMEOUT Result, 58.3s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1123 SDtfs, 4584 SDslu, 3589 SDs, 0 SdLazy, 3967 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 22 SyntacticMatches, 27 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 48.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 487 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 109563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 2/2 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/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-08-44-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-08-44-753.csv Completed graceful shutdown