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-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:08:47,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:08:47,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:08:47,216 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:08:47,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:08:47,217 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:08:47,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:08:47,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:08:47,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:08:47,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:08:47,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:08:47,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:08:47,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:08:47,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:08:47,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:08:47,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:08:47,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:08:47,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:08:47,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:08:47,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:08:47,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:08:47,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:08:47,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:08:47,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:08:47,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:08:47,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:08:47,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:08:47,349 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:08:47,349 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:08:47,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:08:47,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:08:47,350 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:08:47,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:08:47,360 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:08:47,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:08:47,361 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:08:47,361 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:08:47,361 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:08:47,362 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:08:47,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:08:47,362 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:08:47,363 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:08:47,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:08:47,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:08:47,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:08:47,363 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:08:47,363 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:08:47,364 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:08:47,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:08:47,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:08:47,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:08:47,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:08:47,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:08:47,365 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:08:47,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:08:47,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:08:47,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:08:47,365 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:08:47,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:08:47,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:08:47,366 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:08:47,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:08:47,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:08:47,366 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:08:47,367 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:08:47,367 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:08:47,368 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:08:47,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:08:47,415 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:08:47,419 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:08:47,421 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:08:47,421 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:08:47,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:08:47,594 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:08:47,599 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:08:47,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:08:47,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:08:47,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:08:47,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:08:47" (1/1) ... [2018-01-24 16:08:47,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47, skipping insertion in model container [2018-01-24 16:08:47,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:08:47" (1/1) ... [2018-01-24 16:08:47,622 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:08:47,659 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:08:47,784 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:08:47,810 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:08:47,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47 WrapperNode [2018-01-24 16:08:47,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:08:47,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:08:47,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:08:47,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:08:47,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47" (1/1) ... [2018-01-24 16:08:47,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47" (1/1) ... [2018-01-24 16:08:47,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47" (1/1) ... [2018-01-24 16:08:47,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47" (1/1) ... [2018-01-24 16:08:47,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47" (1/1) ... [2018-01-24 16:08:47,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47" (1/1) ... [2018-01-24 16:08:47,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47" (1/1) ... [2018-01-24 16:08:47,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:08:47,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:08:47,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:08:47,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:08:47,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47" (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:08:47,918 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:08:47,919 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:08:47,919 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:08:47,919 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:08:47,919 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:08:47,919 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:08:47,919 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:08:47,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:08:47,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:08:47,920 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:08:47,920 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:08:47,920 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:08:47,920 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:08:47,920 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:08:47,920 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:08:47,920 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:08:47,920 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:08:48,502 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:08:48,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:08:48 BoogieIcfgContainer [2018-01-24 16:08:48,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:08:48,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:08:48,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:08:48,506 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:08:48,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:08:47" (1/3) ... [2018-01-24 16:08:48,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651882a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:08:48, skipping insertion in model container [2018-01-24 16:08:48,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:08:47" (2/3) ... [2018-01-24 16:08:48,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651882a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:08:48, skipping insertion in model container [2018-01-24 16:08:48,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:08:48" (3/3) ... [2018-01-24 16:08:48,510 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:08:48,517 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:08:48,525 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-01-24 16:08:48,574 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:08:48,574 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:08:48,574 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:08:48,574 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:08:48,574 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:08:48,574 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:08:48,574 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:08:48,575 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:08:48,575 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:08:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-01-24 16:08:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:08:48,601 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:48,602 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:48,602 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:48,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1266701268, now seen corresponding path program 1 times [2018-01-24 16:08:48,608 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:48,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:48,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:48,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:48,654 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:48,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:48,773 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:08:48,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:48,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:08:48,775 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:48,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:08:48,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:08:48,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:08:48,878 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2018-01-24 16:08:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:49,172 INFO L93 Difference]: Finished difference Result 237 states and 270 transitions. [2018-01-24 16:08:49,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:08:49,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:08:49,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:49,189 INFO L225 Difference]: With dead ends: 237 [2018-01-24 16:08:49,189 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 16:08:49,193 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:08:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 16:08:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2018-01-24 16:08:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 16:08:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-01-24 16:08:49,246 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 8 [2018-01-24 16:08:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:49,247 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-01-24 16:08:49,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:08:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-01-24 16:08:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:08:49,247 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:49,248 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:49,248 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1266701269, now seen corresponding path program 1 times [2018-01-24 16:08:49,248 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:49,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:49,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:49,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:49,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:49,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:08:49,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:49,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:08:49,328 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:49,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:08:49,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:08:49,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:08:49,331 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 4 states. [2018-01-24 16:08:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:49,514 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-01-24 16:08:49,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:08:49,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:08:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:49,516 INFO L225 Difference]: With dead ends: 147 [2018-01-24 16:08:49,516 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 16:08:49,517 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:08:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 16:08:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2018-01-24 16:08:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 16:08:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2018-01-24 16:08:49,530 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 8 [2018-01-24 16:08:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:49,530 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-01-24 16:08:49,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:08:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2018-01-24 16:08:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:08:49,532 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:49,532 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:49,532 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash -235797476, now seen corresponding path program 1 times [2018-01-24 16:08:49,532 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:49,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:49,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:49,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:49,534 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:49,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:49,603 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:08:49,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:49,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:08:49,603 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:49,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:08:49,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:08:49,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:08:49,605 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 5 states. [2018-01-24 16:08:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:49,971 INFO L93 Difference]: Finished difference Result 286 states and 310 transitions. [2018-01-24 16:08:49,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:08:49,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 16:08:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:49,974 INFO L225 Difference]: With dead ends: 286 [2018-01-24 16:08:49,975 INFO L226 Difference]: Without dead ends: 285 [2018-01-24 16:08:49,975 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:08:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-24 16:08:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 132. [2018-01-24 16:08:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 16:08:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2018-01-24 16:08:49,990 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 16 [2018-01-24 16:08:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:49,991 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-01-24 16:08:49,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:08:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2018-01-24 16:08:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:08:49,992 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:49,992 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:49,992 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash -235797475, now seen corresponding path program 1 times [2018-01-24 16:08:49,993 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:49,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:49,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:49,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:49,994 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:50,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:50,108 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:08:50,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:50,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:08:50,109 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:50,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:08:50,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:08:50,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:08:50,110 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 5 states. [2018-01-24 16:08:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:50,456 INFO L93 Difference]: Finished difference Result 241 states and 261 transitions. [2018-01-24 16:08:50,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:08:50,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 16:08:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:50,458 INFO L225 Difference]: With dead ends: 241 [2018-01-24 16:08:50,458 INFO L226 Difference]: Without dead ends: 240 [2018-01-24 16:08:50,458 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:08:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-24 16:08:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 131. [2018-01-24 16:08:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 16:08:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-01-24 16:08:50,469 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 16 [2018-01-24 16:08:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:50,469 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-01-24 16:08:50,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:08:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-01-24 16:08:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:08:50,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:50,471 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:50,471 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2104820849, now seen corresponding path program 1 times [2018-01-24 16:08:50,471 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:50,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:50,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:50,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:50,473 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:50,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:50,558 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:08:50,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:50,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:08:50,559 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:50,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:08:50,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:08:50,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:08:50,560 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 4 states. [2018-01-24 16:08:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:50,789 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-01-24 16:08:50,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:08:50,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-24 16:08:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:50,791 INFO L225 Difference]: With dead ends: 151 [2018-01-24 16:08:50,791 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 16:08:50,791 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 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:08:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 16:08:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-01-24 16:08:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 16:08:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-01-24 16:08:50,802 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 20 [2018-01-24 16:08:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:50,802 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-01-24 16:08:50,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:08:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-01-24 16:08:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:08:50,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:50,803 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:50,804 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2104820848, now seen corresponding path program 1 times [2018-01-24 16:08:50,804 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:50,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:50,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:50,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:50,805 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:50,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:50,924 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:08:50,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:50,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:08:50,925 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:50,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:08:50,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:08:50,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:08:50,926 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 7 states. [2018-01-24 16:08:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:51,157 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2018-01-24 16:08:51,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:08:51,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 16:08:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:51,159 INFO L225 Difference]: With dead ends: 188 [2018-01-24 16:08:51,159 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 16:08:51,159 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:08:51,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 16:08:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2018-01-24 16:08:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 16:08:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2018-01-24 16:08:51,170 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 20 [2018-01-24 16:08:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:51,171 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2018-01-24 16:08:51,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:08:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2018-01-24 16:08:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:08:51,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:51,172 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:08:51,172 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:51,172 INFO L82 PathProgramCache]: Analyzing trace with hash 196761554, now seen corresponding path program 1 times [2018-01-24 16:08:51,173 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:51,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:51,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:51,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:51,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:51,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:51,250 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:08:51,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:51,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:08:51,250 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:51,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:08:51,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:08:51,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:08:51,251 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 5 states. [2018-01-24 16:08:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:51,504 INFO L93 Difference]: Finished difference Result 222 states and 258 transitions. [2018-01-24 16:08:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:08:51,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 16:08:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:51,506 INFO L225 Difference]: With dead ends: 222 [2018-01-24 16:08:51,507 INFO L226 Difference]: Without dead ends: 221 [2018-01-24 16:08:51,507 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:08:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-24 16:08:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 156. [2018-01-24 16:08:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 16:08:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2018-01-24 16:08:51,519 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 22 [2018-01-24 16:08:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:51,519 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2018-01-24 16:08:51,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:08:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-01-24 16:08:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:08:51,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:51,521 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:08:51,521 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash 196761555, now seen corresponding path program 1 times [2018-01-24 16:08:51,521 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:51,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:51,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:51,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:51,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:51,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:51,603 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:08:51,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:51,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:08:51,604 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:51,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:08:51,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:08:51,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:08:51,605 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 5 states. [2018-01-24 16:08:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:51,937 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2018-01-24 16:08:51,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:08:51,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 16:08:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:51,938 INFO L225 Difference]: With dead ends: 241 [2018-01-24 16:08:51,938 INFO L226 Difference]: Without dead ends: 240 [2018-01-24 16:08:51,939 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:08:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-24 16:08:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 155. [2018-01-24 16:08:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 16:08:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2018-01-24 16:08:51,946 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 22 [2018-01-24 16:08:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:51,947 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2018-01-24 16:08:51,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:08:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2018-01-24 16:08:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:08:51,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:51,948 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:08:51,948 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2133980856, now seen corresponding path program 1 times [2018-01-24 16:08:51,949 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:51,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:51,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:51,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:51,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:51,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:52,029 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:08:52,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:52,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:08:52,029 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:52,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:08:52,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:08:52,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:08:52,030 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand 5 states. [2018-01-24 16:08:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:52,173 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2018-01-24 16:08:52,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:08:52,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 16:08:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:52,175 INFO L225 Difference]: With dead ends: 202 [2018-01-24 16:08:52,175 INFO L226 Difference]: Without dead ends: 167 [2018-01-24 16:08:52,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:08:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-24 16:08:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2018-01-24 16:08:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 16:08:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2018-01-24 16:08:52,187 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 26 [2018-01-24 16:08:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:52,188 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2018-01-24 16:08:52,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:08:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2018-01-24 16:08:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:08:52,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:52,189 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:08:52,189 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1951923348, now seen corresponding path program 1 times [2018-01-24 16:08:52,190 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:52,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:52,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:52,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:52,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:52,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:52,307 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:08:52,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:52,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:08:52,308 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:52,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:08:52,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:08:52,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:08:52,308 INFO L87 Difference]: Start difference. First operand 155 states and 176 transitions. Second operand 9 states. [2018-01-24 16:08:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:52,958 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-01-24 16:08:52,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:08:52,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 16:08:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:52,959 INFO L225 Difference]: With dead ends: 156 [2018-01-24 16:08:52,959 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 16:08:52,960 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:08:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 16:08:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-01-24 16:08:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-24 16:08:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2018-01-24 16:08:52,967 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 26 [2018-01-24 16:08:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:52,968 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2018-01-24 16:08:52,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:08:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2018-01-24 16:08:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:08:52,969 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:52,970 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:08:52,970 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1951923349, now seen corresponding path program 1 times [2018-01-24 16:08:52,970 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:52,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:52,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:52,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:52,972 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:52,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:53,266 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:08:53,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:53,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:08:53,267 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:53,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:08:53,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:08:53,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:08:53,268 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 10 states. [2018-01-24 16:08:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:53,924 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-01-24 16:08:53,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:08:53,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-24 16:08:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:53,925 INFO L225 Difference]: With dead ends: 157 [2018-01-24 16:08:53,925 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 16:08:53,925 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-24 16:08:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 16:08:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2018-01-24 16:08:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 16:08:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2018-01-24 16:08:53,934 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 26 [2018-01-24 16:08:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:53,934 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2018-01-24 16:08:53,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:08:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2018-01-24 16:08:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:08:53,935 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:53,936 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:53,936 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:53,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1846863039, now seen corresponding path program 1 times [2018-01-24 16:08:53,936 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:53,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:53,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:53,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:53,937 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:53,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:53,999 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:08:53,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:53,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:08:53,999 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:54,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:08:54,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:08:54,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:08:54,000 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 4 states. [2018-01-24 16:08:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:54,039 INFO L93 Difference]: Finished difference Result 234 states and 273 transitions. [2018-01-24 16:08:54,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:08:54,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 16:08:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:54,041 INFO L225 Difference]: With dead ends: 234 [2018-01-24 16:08:54,041 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 16:08:54,041 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:08:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 16:08:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2018-01-24 16:08:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 16:08:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2018-01-24 16:08:54,054 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 29 [2018-01-24 16:08:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:54,055 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2018-01-24 16:08:54,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:08:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2018-01-24 16:08:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:08:54,056 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:54,056 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:08:54,056 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2044037406, now seen corresponding path program 1 times [2018-01-24 16:08:54,056 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:54,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:54,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:54,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:54,057 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:54,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:54,187 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:08:54,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:54,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:08:54,188 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:54,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:08:54,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:08:54,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:08:54,189 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand 8 states. [2018-01-24 16:08:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:54,639 INFO L93 Difference]: Finished difference Result 252 states and 286 transitions. [2018-01-24 16:08:54,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:08:54,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-24 16:08:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:54,640 INFO L225 Difference]: With dead ends: 252 [2018-01-24 16:08:54,641 INFO L226 Difference]: Without dead ends: 251 [2018-01-24 16:08:54,641 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:08:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-24 16:08:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 155. [2018-01-24 16:08:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 16:08:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2018-01-24 16:08:54,649 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 31 [2018-01-24 16:08:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:54,649 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2018-01-24 16:08:54,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:08:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2018-01-24 16:08:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:08:54,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:54,650 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:08:54,651 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:54,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2044037407, now seen corresponding path program 1 times [2018-01-24 16:08:54,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:54,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:54,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:54,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:54,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:54,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:54,747 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:08:54,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:54,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:08:54,747 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:54,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:08:54,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:08:54,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:08:54,748 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand 7 states. [2018-01-24 16:08:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:55,057 INFO L93 Difference]: Finished difference Result 342 states and 391 transitions. [2018-01-24 16:08:55,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 16:08:55,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 16:08:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:55,062 INFO L225 Difference]: With dead ends: 342 [2018-01-24 16:08:55,062 INFO L226 Difference]: Without dead ends: 266 [2018-01-24 16:08:55,063 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:08:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-24 16:08:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 151. [2018-01-24 16:08:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 16:08:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2018-01-24 16:08:55,077 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 31 [2018-01-24 16:08:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:55,078 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2018-01-24 16:08:55,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:08:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2018-01-24 16:08:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:08:55,079 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:55,079 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:55,079 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash -638053953, now seen corresponding path program 1 times [2018-01-24 16:08:55,080 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:55,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:55,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:55,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:55,081 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:55,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:55,145 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:08:55,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:55,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:08:55,146 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:55,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:08:55,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:08:55,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:08:55,147 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand 5 states. [2018-01-24 16:08:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:55,464 INFO L93 Difference]: Finished difference Result 259 states and 296 transitions. [2018-01-24 16:08:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:08:55,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 16:08:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:55,466 INFO L225 Difference]: With dead ends: 259 [2018-01-24 16:08:55,466 INFO L226 Difference]: Without dead ends: 258 [2018-01-24 16:08:55,466 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:08:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-24 16:08:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 150. [2018-01-24 16:08:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 16:08:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2018-01-24 16:08:55,478 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 33 [2018-01-24 16:08:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:55,478 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2018-01-24 16:08:55,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:08:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2018-01-24 16:08:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:08:55,479 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:55,479 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:55,480 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:55,480 INFO L82 PathProgramCache]: Analyzing trace with hash -638053952, now seen corresponding path program 1 times [2018-01-24 16:08:55,480 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:55,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:55,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:55,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:55,481 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:55,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:55,578 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:08:55,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:55,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:08:55,579 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:55,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:08:55,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:08:55,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:08:55,580 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand 5 states. [2018-01-24 16:08:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:55,865 INFO L93 Difference]: Finished difference Result 259 states and 299 transitions. [2018-01-24 16:08:55,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:08:55,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 16:08:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:55,866 INFO L225 Difference]: With dead ends: 259 [2018-01-24 16:08:55,866 INFO L226 Difference]: Without dead ends: 258 [2018-01-24 16:08:55,867 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:08:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-24 16:08:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 149. [2018-01-24 16:08:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 16:08:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2018-01-24 16:08:55,876 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 33 [2018-01-24 16:08:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:55,876 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2018-01-24 16:08:55,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:08:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-01-24 16:08:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:08:55,877 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:55,877 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:55,877 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash 851008324, now seen corresponding path program 1 times [2018-01-24 16:08:55,877 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:55,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:55,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:55,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:55,878 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:55,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:55,981 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:08:55,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:55,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:08:55,981 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:55,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:08:55,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:08:55,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:08:55,982 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 9 states. [2018-01-24 16:08:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:56,614 INFO L93 Difference]: Finished difference Result 412 states and 468 transitions. [2018-01-24 16:08:56,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:08:56,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-24 16:08:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:56,615 INFO L225 Difference]: With dead ends: 412 [2018-01-24 16:08:56,615 INFO L226 Difference]: Without dead ends: 411 [2018-01-24 16:08:56,616 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-01-24 16:08:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-01-24 16:08:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 165. [2018-01-24 16:08:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 16:08:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2018-01-24 16:08:56,626 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 34 [2018-01-24 16:08:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:56,626 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2018-01-24 16:08:56,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:08:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2018-01-24 16:08:56,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:08:56,627 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:56,627 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:56,627 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash 851008325, now seen corresponding path program 1 times [2018-01-24 16:08:56,628 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:56,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:56,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:56,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:56,629 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:56,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:56,753 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:08:56,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:56,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:08:56,753 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:56,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:08:56,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:08:56,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:08:56,754 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 9 states. [2018-01-24 16:08:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:57,515 INFO L93 Difference]: Finished difference Result 319 states and 362 transitions. [2018-01-24 16:08:57,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 16:08:57,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-24 16:08:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:57,552 INFO L225 Difference]: With dead ends: 319 [2018-01-24 16:08:57,552 INFO L226 Difference]: Without dead ends: 318 [2018-01-24 16:08:57,552 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:08:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-01-24 16:08:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 165. [2018-01-24 16:08:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 16:08:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2018-01-24 16:08:57,570 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 34 [2018-01-24 16:08:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:57,570 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2018-01-24 16:08:57,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:08:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2018-01-24 16:08:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 16:08:57,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:57,572 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:57,572 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:57,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1753433128, now seen corresponding path program 1 times [2018-01-24 16:08:57,572 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:57,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:57,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:57,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:57,574 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:57,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:08:57,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:08:57,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:08:57,632 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:08:57,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:08:57,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:08:57,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:08:57,634 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand 5 states. [2018-01-24 16:08:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:08:57,705 INFO L93 Difference]: Finished difference Result 258 states and 297 transitions. [2018-01-24 16:08:57,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:08:57,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-24 16:08:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:08:57,707 INFO L225 Difference]: With dead ends: 258 [2018-01-24 16:08:57,708 INFO L226 Difference]: Without dead ends: 189 [2018-01-24 16:08:57,708 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:08:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-24 16:08:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2018-01-24 16:08:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-24 16:08:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2018-01-24 16:08:57,724 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 37 [2018-01-24 16:08:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:08:57,724 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2018-01-24 16:08:57,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:08:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2018-01-24 16:08:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 16:08:57,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:08:57,726 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:08:57,726 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:08:57,726 INFO L82 PathProgramCache]: Analyzing trace with hash -110193443, now seen corresponding path program 1 times [2018-01-24 16:08:57,726 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:08:57,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:57,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:08:57,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:08:57,727 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:08:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:08:57,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:08:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:08:57,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:08:57,885 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:08:57,886 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-24 16:08:57,889 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [27], [38], [39], [42], [46], [50], [52], [55], [117], [121], [127], [131], [132], [133], [135], [144], [146], [158], [160], [165], [166], [169], [175], [179], [185], [188], [232], [233], [237], [238], [239] [2018-01-24 16:08:57,956 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:08:57,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:09:48,287 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:09:48,288 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:09:48,289 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:09:48,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:09:48,289 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:09:48,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:09:48,295 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:09:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:09:48,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:09:48,342 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:09:48,342 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:09:48,350 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:09:48,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:09:48 BoogieIcfgContainer [2018-01-24 16:09:48,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:09:48,351 INFO L168 Benchmark]: Toolchain (without parser) took 60756.89 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 266.2 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 335.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:09:48,352 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 308.3 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:09:48,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.81 ms. Allocated memory is still 308.3 MB. Free memory was 265.2 MB in the beginning and 253.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:09:48,353 INFO L168 Benchmark]: Boogie Preprocessor took 44.27 ms. Allocated memory is still 308.3 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:09:48,353 INFO L168 Benchmark]: RCFGBuilder took 636.02 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 212.2 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:09:48,354 INFO L168 Benchmark]: TraceAbstraction took 59846.04 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 212.2 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 281.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:09:48,355 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 308.3 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.81 ms. Allocated memory is still 308.3 MB. Free memory was 265.2 MB in the beginning and 253.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.27 ms. Allocated memory is still 308.3 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 636.02 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 212.2 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 59846.04 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 212.2 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 281.5 MB. 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 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 154 locations, 69 error locations. TIMEOUT Result, 59.7s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2071 SDtfs, 3840 SDslu, 4775 SDs, 0 SdLazy, 5083 SolverSat, 318 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 50.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 1359 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 64879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-09-48-366.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-09-48-366.csv Completed graceful shutdown