java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:15:14,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:15:14,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:15:14,338 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:15:14,338 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:15:14,339 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:15:14,340 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:15:14,342 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:15:14,344 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:15:14,345 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:15:14,346 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:15:14,346 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:15:14,347 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:15:14,349 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:15:14,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:15:14,352 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:15:14,354 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:15:14,357 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:15:14,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:15:14,360 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:15:14,363 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:15:14,363 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:15:14,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:15:14,364 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:15:14,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:15:14,366 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:15:14,367 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:15:14,367 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:15:14,368 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:15:14,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:15:14,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:15:14,369 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:15:14,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:15:14,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:15:14,378 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:15:14,379 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:15:14,379 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:15:14,379 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:15:14,379 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:15:14,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:15:14,380 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:15:14,380 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:15:14,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:15:14,380 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:15:14,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:15:14,381 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:15:14,381 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:15:14,381 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:15:14,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:15:14,381 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:15:14,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:15:14,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:15:14,382 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:15:14,382 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:15:14,382 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:15:14,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:15:14,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:15:14,383 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:15:14,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:15:14,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:15:14,383 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:15:14,383 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:15:14,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:15:14,383 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:15:14,384 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:15:14,384 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:15:14,385 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:15:14,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:15:14,430 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:15:14,435 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:15:14,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:15:14,436 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:15:14,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:15:14,619 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:15:14,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:15:14,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:15:14,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:15:14,630 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:15:14,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:15:14" (1/1) ... [2018-01-24 16:15:14,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3969979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14, skipping insertion in model container [2018-01-24 16:15:14,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:15:14" (1/1) ... [2018-01-24 16:15:14,646 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:15:14,686 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:15:14,810 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:15:14,834 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:15:14,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14 WrapperNode [2018-01-24 16:15:14,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:15:14,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:15:14,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:15:14,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:15:14,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14" (1/1) ... [2018-01-24 16:15:14,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14" (1/1) ... [2018-01-24 16:15:14,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14" (1/1) ... [2018-01-24 16:15:14,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14" (1/1) ... [2018-01-24 16:15:14,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14" (1/1) ... [2018-01-24 16:15:14,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14" (1/1) ... [2018-01-24 16:15:14,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14" (1/1) ... [2018-01-24 16:15:14,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:15:14,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:15:14,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:15:14,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:15:14,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14" (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:15:14,925 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:15:14,925 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:15:14,925 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:15:14,925 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:15:14,925 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:15:14,925 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:15:14,925 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:15:14,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:15:14,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:15:14,926 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:15:14,926 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:15:14,926 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:15:14,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:15:14,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:15:14,926 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:15:14,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:15:14,927 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:15:15,414 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:15:15,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:15:15 BoogieIcfgContainer [2018-01-24 16:15:15,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:15:15,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:15:15,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:15:15,417 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:15:15,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:15:14" (1/3) ... [2018-01-24 16:15:15,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d3265c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:15:15, skipping insertion in model container [2018-01-24 16:15:15,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:15:14" (2/3) ... [2018-01-24 16:15:15,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d3265c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:15:15, skipping insertion in model container [2018-01-24 16:15:15,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:15:15" (3/3) ... [2018-01-24 16:15:15,421 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:15:15,428 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:15:15,434 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-01-24 16:15:15,487 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:15:15,570 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:15:15,570 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:15:15,570 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:15:15,570 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:15:15,571 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:15:15,571 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:15:15,571 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:15:15,572 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:15:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-01-24 16:15:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:15:15,603 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:15,604 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:15,605 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:15,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1462365916, now seen corresponding path program 1 times [2018-01-24 16:15:15,613 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:15,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:15,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:15,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:15,673 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:15,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:15:15,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:15,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:15:15,783 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:15,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:15:15,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:15:15,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:15:15,799 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 4 states. [2018-01-24 16:15:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:16,083 INFO L93 Difference]: Finished difference Result 220 states and 261 transitions. [2018-01-24 16:15:16,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:15:16,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:15:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:16,093 INFO L225 Difference]: With dead ends: 220 [2018-01-24 16:15:16,093 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 16:15:16,096 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:15:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 16:15:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 126. [2018-01-24 16:15:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 16:15:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-01-24 16:15:16,132 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 8 [2018-01-24 16:15:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:16,132 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-01-24 16:15:16,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:15:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-01-24 16:15:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:15:16,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:16,133 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:16,133 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1462365917, now seen corresponding path program 1 times [2018-01-24 16:15:16,133 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:16,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:16,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:16,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:16,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:16,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:16,211 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:15:16,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:16,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:15:16,211 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:16,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:15:16,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:15:16,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:15:16,213 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 4 states. [2018-01-24 16:15:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:16,347 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-01-24 16:15:16,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:15:16,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:15:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:16,350 INFO L225 Difference]: With dead ends: 126 [2018-01-24 16:15:16,350 INFO L226 Difference]: Without dead ends: 123 [2018-01-24 16:15:16,351 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:15:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-24 16:15:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-24 16:15:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 16:15:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-01-24 16:15:16,363 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 8 [2018-01-24 16:15:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:16,363 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-01-24 16:15:16,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:15:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-01-24 16:15:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 16:15:16,364 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:16,364 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:16,364 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:16,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1064079776, now seen corresponding path program 1 times [2018-01-24 16:15:16,365 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:16,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:16,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:16,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:16,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:16,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:16,421 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:15:16,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:16,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:15:16,422 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:16,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:15:16,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:15:16,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:15:16,423 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 4 states. [2018-01-24 16:15:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:16,578 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-01-24 16:15:16,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:15:16,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-01-24 16:15:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:16,579 INFO L225 Difference]: With dead ends: 137 [2018-01-24 16:15:16,579 INFO L226 Difference]: Without dead ends: 130 [2018-01-24 16:15:16,580 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:15:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-24 16:15:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2018-01-24 16:15:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 16:15:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-01-24 16:15:16,591 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 12 [2018-01-24 16:15:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:16,592 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-01-24 16:15:16,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:15:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-01-24 16:15:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 16:15:16,593 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:16,593 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:16,593 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1064079775, now seen corresponding path program 1 times [2018-01-24 16:15:16,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:16,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:16,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:16,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:16,595 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:16,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:16,665 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:15:16,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:16,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:15:16,666 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:16,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:15:16,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:15:16,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:15:16,667 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 4 states. [2018-01-24 16:15:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:16,779 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-01-24 16:15:16,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:15:16,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-01-24 16:15:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:16,781 INFO L225 Difference]: With dead ends: 138 [2018-01-24 16:15:16,781 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 16:15:16,782 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:15:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 16:15:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-01-24 16:15:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 16:15:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-01-24 16:15:16,792 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 12 [2018-01-24 16:15:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:16,792 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-01-24 16:15:16,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:15:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-01-24 16:15:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:15:16,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:16,794 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:16,794 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash 503792665, now seen corresponding path program 1 times [2018-01-24 16:15:16,795 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:16,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:16,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:16,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:16,797 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:16,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:15:16,883 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:15:16,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:16,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:15:16,883 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:16,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:15:16,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:15:16,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:15:16,884 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 5 states. [2018-01-24 16:15:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:17,108 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-01-24 16:15:17,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:15:17,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 16:15:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:17,110 INFO L225 Difference]: With dead ends: 137 [2018-01-24 16:15:17,110 INFO L226 Difference]: Without dead ends: 125 [2018-01-24 16:15:17,110 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:15:17,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-24 16:15:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2018-01-24 16:15:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 16:15:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-24 16:15:17,120 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 19 [2018-01-24 16:15:17,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:17,120 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-24 16:15:17,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:15:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-24 16:15:17,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:15:17,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:17,121 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:17,121 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:17,122 INFO L82 PathProgramCache]: Analyzing trace with hash 503792666, now seen corresponding path program 1 times [2018-01-24 16:15:17,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:17,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:17,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:17,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:17,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:17,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:17,208 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:15:17,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:17,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:15:17,208 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:17,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:15:17,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:15:17,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:15:17,209 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 5 states. [2018-01-24 16:15:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:17,394 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-01-24 16:15:17,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:15:17,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 16:15:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:17,395 INFO L225 Difference]: With dead ends: 153 [2018-01-24 16:15:17,396 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 16:15:17,396 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:15:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 16:15:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 123. [2018-01-24 16:15:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 16:15:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-01-24 16:15:17,405 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 19 [2018-01-24 16:15:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:17,405 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-01-24 16:15:17,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:15:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-01-24 16:15:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:15:17,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:17,406 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:15:17,406 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1871552874, now seen corresponding path program 1 times [2018-01-24 16:15:17,407 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:17,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:17,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:17,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:17,408 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:17,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:17,501 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:15:17,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:17,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:15:17,502 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:17,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:15:17,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:15:17,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:15:17,503 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 6 states. [2018-01-24 16:15:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:17,788 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2018-01-24 16:15:17,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:15:17,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 16:15:17,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:17,791 INFO L225 Difference]: With dead ends: 187 [2018-01-24 16:15:17,791 INFO L226 Difference]: Without dead ends: 186 [2018-01-24 16:15:17,791 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:15:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-24 16:15:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 122. [2018-01-24 16:15:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-24 16:15:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-01-24 16:15:17,800 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 22 [2018-01-24 16:15:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:17,800 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-01-24 16:15:17,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:15:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-01-24 16:15:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:15:17,801 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:17,801 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:15:17,801 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:17,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1871552875, now seen corresponding path program 1 times [2018-01-24 16:15:17,801 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:17,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:17,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:17,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:17,802 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:17,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:17,882 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:15:17,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:17,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:15:17,883 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:17,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:15:17,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:15:17,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:15:17,884 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 6 states. [2018-01-24 16:15:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:18,118 INFO L93 Difference]: Finished difference Result 206 states and 224 transitions. [2018-01-24 16:15:18,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:15:18,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 16:15:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:18,120 INFO L225 Difference]: With dead ends: 206 [2018-01-24 16:15:18,120 INFO L226 Difference]: Without dead ends: 199 [2018-01-24 16:15:18,121 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:15:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-24 16:15:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 117. [2018-01-24 16:15:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 16:15:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-01-24 16:15:18,128 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 22 [2018-01-24 16:15:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:18,128 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-01-24 16:15:18,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:15:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-01-24 16:15:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:15:18,130 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:18,130 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:18,130 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1255187673, now seen corresponding path program 1 times [2018-01-24 16:15:18,130 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:18,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:18,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:18,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:18,132 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:18,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:18,194 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:15:18,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:18,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:15:18,194 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:18,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:15:18,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:15:18,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:15:18,195 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 6 states. [2018-01-24 16:15:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:18,559 INFO L93 Difference]: Finished difference Result 200 states and 223 transitions. [2018-01-24 16:15:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:15:18,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 16:15:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:18,561 INFO L225 Difference]: With dead ends: 200 [2018-01-24 16:15:18,561 INFO L226 Difference]: Without dead ends: 199 [2018-01-24 16:15:18,561 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:15:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-24 16:15:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 116. [2018-01-24 16:15:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-24 16:15:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-01-24 16:15:18,569 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 30 [2018-01-24 16:15:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:18,569 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2018-01-24 16:15:18,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:15:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2018-01-24 16:15:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:15:18,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:18,570 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:18,571 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1255187674, now seen corresponding path program 1 times [2018-01-24 16:15:18,571 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:18,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:18,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:18,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:18,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:18,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:18,689 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:15:18,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:18,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:15:18,690 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:18,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:15:18,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:15:18,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:15:18,691 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand 6 states. [2018-01-24 16:15:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:19,395 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2018-01-24 16:15:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:15:19,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 16:15:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:19,398 INFO L225 Difference]: With dead ends: 205 [2018-01-24 16:15:19,398 INFO L226 Difference]: Without dead ends: 201 [2018-01-24 16:15:19,398 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:15:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-24 16:15:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2018-01-24 16:15:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 16:15:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2018-01-24 16:15:19,403 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 30 [2018-01-24 16:15:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:19,403 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2018-01-24 16:15:19,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:15:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-01-24 16:15:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:15:19,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:19,405 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:19,405 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:19,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1382402606, now seen corresponding path program 1 times [2018-01-24 16:15:19,406 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:19,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:19,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:19,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:19,407 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:19,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:19,489 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:15:19,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:15:19,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:15:19,489 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:15:19,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:15:19,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:15:19,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:15:19,490 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 8 states. [2018-01-24 16:15:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:15:19,708 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2018-01-24 16:15:19,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:15:19,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-24 16:15:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:15:19,710 INFO L225 Difference]: With dead ends: 172 [2018-01-24 16:15:19,710 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 16:15:19,711 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:15:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 16:15:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 106. [2018-01-24 16:15:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 16:15:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-01-24 16:15:19,717 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 32 [2018-01-24 16:15:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:15:19,717 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-01-24 16:15:19,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:15:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-01-24 16:15:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:15:19,719 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:15:19,719 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:15:19,719 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:15:19,719 INFO L82 PathProgramCache]: Analyzing trace with hash -46210284, now seen corresponding path program 1 times [2018-01-24 16:15:19,720 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:15:19,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:19,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:15:19,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:15:19,721 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:15:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:15:19,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:15:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:15:19,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:15:19,891 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:15:19,892 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 16:15:19,894 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [9], [10], [13], [16], [20], [22], [25], [69], [73], [78], [82], [90], [91], [98], [102], [110], [116], [117], [118], [166], [168], [171], [224], [225], [229], [230], [231] [2018-01-24 16:15:19,956 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:15:19,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:16:19,296 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:16:19,297 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:16:19,297 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:16:19,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:16:19,298 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:16:19,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:16:19,304 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:16:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:16:19,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:16:19,357 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:16:19,358 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:16:19,363 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:16:19,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:16:19 BoogieIcfgContainer [2018-01-24 16:16:19,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:16:19,365 INFO L168 Benchmark]: Toolchain (without parser) took 64744.96 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 265.7 MB in the beginning and 1.2 GB in the end (delta: -953.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-24 16:16:19,366 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:16:19,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.36 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 252.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:16:19,366 INFO L168 Benchmark]: Boogie Preprocessor took 33.91 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 250.6 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:16:19,367 INFO L168 Benchmark]: RCFGBuilder took 538.07 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 217.0 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:16:19,367 INFO L168 Benchmark]: TraceAbstraction took 63948.43 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.0 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 975.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:16:19,369 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.16 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.36 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 252.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.91 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 538.07 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 217.0 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63948.43 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.0 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 975.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 free always succeeds (line 1063). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1063). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 53 error locations. TIMEOUT Result, 63.8s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 956 SDtfs, 2298 SDslu, 1452 SDs, 0 SdLazy, 1918 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 59.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 424 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 11408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-16-19-378.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-16-19-378.csv Completed graceful shutdown