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-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:05:38,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:05:38,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:05:38,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:05:38,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:05:38,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:05:38,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:05:38,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:05:38,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:05:38,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:05:38,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:05:38,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:05:38,725 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:05:38,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:05:38,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:05:38,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:05:38,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:05:38,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:05:38,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:05:38,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:05:38,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:05:38,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:05:38,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:05:38,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:05:38,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:05:38,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:05:38,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:05:38,744 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:05:38,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:05:38,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:05:38,745 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:05:38,746 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:05:38,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:05:38,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:05:38,757 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:05:38,757 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:05:38,758 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:05:38,758 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:05:38,758 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:05:38,759 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:05:38,759 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:05:38,759 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:05:38,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:05:38,760 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:05:38,760 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:05:38,760 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:05:38,760 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:05:38,760 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:05:38,761 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:05:38,761 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:05:38,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:05:38,761 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:05:38,761 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:05:38,762 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:05:38,762 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:05:38,762 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:05:38,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:05:38,763 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:05:38,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:05:38,763 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:05:38,763 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:05:38,763 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:05:38,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:05:38,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:05:38,764 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:05:38,765 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:05:38,765 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:05:38,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:05:38,809 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:05:38,812 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:05:38,813 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:05:38,813 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:05:38,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-24 16:05:38,979 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:05:38,986 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:05:38,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:05:38,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:05:38,995 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:05:38,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:05:38" (1/1) ... [2018-01-24 16:05:38,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:38, skipping insertion in model container [2018-01-24 16:05:39,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:05:38" (1/1) ... [2018-01-24 16:05:39,013 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:05:39,054 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:05:39,172 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:05:39,192 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:05:39,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39 WrapperNode [2018-01-24 16:05:39,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:05:39,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:05:39,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:05:39,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:05:39,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39" (1/1) ... [2018-01-24 16:05:39,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39" (1/1) ... [2018-01-24 16:05:39,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39" (1/1) ... [2018-01-24 16:05:39,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39" (1/1) ... [2018-01-24 16:05:39,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39" (1/1) ... [2018-01-24 16:05:39,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39" (1/1) ... [2018-01-24 16:05:39,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39" (1/1) ... [2018-01-24 16:05:39,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:05:39,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:05:39,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:05:39,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:05:39,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39" (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:05:39,293 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:05:39,293 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:05:39,293 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:05:39,293 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:05:39,294 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:05:39,294 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:05:39,294 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:05:39,294 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:05:39,294 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:05:39,294 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:05:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:05:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:05:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:05:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:05:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:05:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:05:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:05:39,756 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:05:39,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:05:39 BoogieIcfgContainer [2018-01-24 16:05:39,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:05:39,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:05:39,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:05:39,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:05:39,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:05:38" (1/3) ... [2018-01-24 16:05:39,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fab9e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:05:39, skipping insertion in model container [2018-01-24 16:05:39,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:39" (2/3) ... [2018-01-24 16:05:39,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fab9e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:05:39, skipping insertion in model container [2018-01-24 16:05:39,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:05:39" (3/3) ... [2018-01-24 16:05:39,764 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-24 16:05:39,772 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:05:39,779 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-24 16:05:39,825 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:05:39,825 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:05:39,826 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:05:39,826 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:05:39,826 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:05:39,826 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:05:39,826 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:05:39,826 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:05:39,827 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:05:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-01-24 16:05:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:05:39,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:39,850 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:39,850 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 805618339, now seen corresponding path program 1 times [2018-01-24 16:05:39,856 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:39,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:39,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:39,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:39,899 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:39,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:40,028 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:05:40,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:40,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:40,032 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:40,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:40,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:40,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:40,056 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2018-01-24 16:05:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:40,406 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2018-01-24 16:05:40,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:05:40,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:05:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:40,423 INFO L225 Difference]: With dead ends: 232 [2018-01-24 16:05:40,423 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 16:05:40,428 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:05:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 16:05:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2018-01-24 16:05:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-24 16:05:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-24 16:05:40,479 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 8 [2018-01-24 16:05:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:40,480 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-24 16:05:40,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-24 16:05:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:05:40,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:40,481 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:40,481 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:40,481 INFO L82 PathProgramCache]: Analyzing trace with hash 805618340, now seen corresponding path program 1 times [2018-01-24 16:05:40,481 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:40,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:40,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:40,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:40,482 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:40,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:40,569 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:05:40,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:40,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:40,570 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:40,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:40,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:40,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:40,572 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 4 states. [2018-01-24 16:05:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:40,752 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-24 16:05:40,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:05:40,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:05:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:40,754 INFO L225 Difference]: With dead ends: 131 [2018-01-24 16:05:40,755 INFO L226 Difference]: Without dead ends: 129 [2018-01-24 16:05:40,756 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:05:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-24 16:05:40,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2018-01-24 16:05:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 16:05:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-24 16:05:40,768 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 8 [2018-01-24 16:05:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:40,769 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-24 16:05:40,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-24 16:05:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:05:40,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:40,770 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:40,770 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash -86961810, now seen corresponding path program 1 times [2018-01-24 16:05:40,770 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:40,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:40,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:40,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:40,772 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:40,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:40,866 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:05:40,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:40,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:40,867 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:40,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:40,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:40,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:40,870 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 4 states. [2018-01-24 16:05:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:41,018 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-01-24 16:05:41,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:05:41,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 16:05:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:41,020 INFO L225 Difference]: With dead ends: 119 [2018-01-24 16:05:41,020 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 16:05:41,020 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 16:05:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-01-24 16:05:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 16:05:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-01-24 16:05:41,032 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 15 [2018-01-24 16:05:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:41,032 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-01-24 16:05:41,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-01-24 16:05:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:05:41,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:41,034 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:41,034 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash -86961809, now seen corresponding path program 1 times [2018-01-24 16:05:41,034 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:41,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:41,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:41,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:41,036 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:41,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:41,150 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:05:41,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:41,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:05:41,150 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:41,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:05:41,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:05:41,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:05:41,152 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 7 states. [2018-01-24 16:05:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:41,556 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2018-01-24 16:05:41,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:05:41,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-24 16:05:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:41,558 INFO L225 Difference]: With dead ends: 173 [2018-01-24 16:05:41,558 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 16:05:41,559 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:05:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 16:05:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2018-01-24 16:05:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 16:05:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2018-01-24 16:05:41,575 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 15 [2018-01-24 16:05:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:41,575 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2018-01-24 16:05:41,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:05:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2018-01-24 16:05:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:05:41,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:41,577 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:41,577 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:41,577 INFO L82 PathProgramCache]: Analyzing trace with hash -854983682, now seen corresponding path program 1 times [2018-01-24 16:05:41,577 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:41,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:41,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:41,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:41,579 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:41,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:41,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:41,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:41,624 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:41,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:41,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:41,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:41,626 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 4 states. [2018-01-24 16:05:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:41,753 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2018-01-24 16:05:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:05:41,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-24 16:05:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:41,754 INFO L225 Difference]: With dead ends: 152 [2018-01-24 16:05:41,755 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 16:05:41,755 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:05:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 16:05:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2018-01-24 16:05:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 16:05:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2018-01-24 16:05:41,771 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 18 [2018-01-24 16:05:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:41,771 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2018-01-24 16:05:41,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2018-01-24 16:05:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:05:41,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:41,772 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:41,772 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash -854983681, now seen corresponding path program 1 times [2018-01-24 16:05:41,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:41,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:41,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:41,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:41,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:41,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:41,841 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:05:41,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:41,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:41,841 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:41,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:41,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:41,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:41,842 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand 4 states. [2018-01-24 16:05:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:41,978 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2018-01-24 16:05:41,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:05:41,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-24 16:05:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:41,979 INFO L225 Difference]: With dead ends: 154 [2018-01-24 16:05:41,979 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 16:05:41,979 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:05:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 16:05:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2018-01-24 16:05:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 16:05:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2018-01-24 16:05:41,991 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 18 [2018-01-24 16:05:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:41,991 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2018-01-24 16:05:41,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2018-01-24 16:05:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:05:41,992 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:41,993 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:41,993 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash -814008083, now seen corresponding path program 1 times [2018-01-24 16:05:41,993 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:41,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:41,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:41,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:41,994 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:42,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:42,041 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:05:42,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:42,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:05:42,041 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:42,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:05:42,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:05:42,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:05:42,042 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand 6 states. [2018-01-24 16:05:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:42,294 INFO L93 Difference]: Finished difference Result 229 states and 272 transitions. [2018-01-24 16:05:42,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:05:42,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 16:05:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:42,297 INFO L225 Difference]: With dead ends: 229 [2018-01-24 16:05:42,298 INFO L226 Difference]: Without dead ends: 228 [2018-01-24 16:05:42,298 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:05:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-24 16:05:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 132. [2018-01-24 16:05:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 16:05:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2018-01-24 16:05:42,309 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 18 [2018-01-24 16:05:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:42,309 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2018-01-24 16:05:42,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:05:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2018-01-24 16:05:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:05:42,310 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:42,310 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:42,310 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:42,310 INFO L82 PathProgramCache]: Analyzing trace with hash -814008082, now seen corresponding path program 1 times [2018-01-24 16:05:42,310 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:42,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:42,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:42,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:42,311 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:42,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:42,401 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:05:42,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:42,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:05:42,401 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:42,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:05:42,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:05:42,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:05:42,402 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand 6 states. [2018-01-24 16:05:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:42,714 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2018-01-24 16:05:42,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:05:42,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 16:05:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:42,716 INFO L225 Difference]: With dead ends: 236 [2018-01-24 16:05:42,716 INFO L226 Difference]: Without dead ends: 232 [2018-01-24 16:05:42,716 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:05:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-24 16:05:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 122. [2018-01-24 16:05:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-24 16:05:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2018-01-24 16:05:42,725 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 18 [2018-01-24 16:05:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:42,726 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2018-01-24 16:05:42,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:05:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2018-01-24 16:05:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:05:42,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:42,727 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:42,727 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:42,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1060549093, now seen corresponding path program 1 times [2018-01-24 16:05:42,727 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:42,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:42,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:42,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:42,728 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:42,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:42,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:42,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:05:42,939 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:42,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:05:42,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:05:42,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:42,940 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 5 states. [2018-01-24 16:05:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:43,053 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2018-01-24 16:05:43,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:05:43,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 16:05:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:43,054 INFO L225 Difference]: With dead ends: 210 [2018-01-24 16:05:43,055 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 16:05:43,055 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:05:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 16:05:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-01-24 16:05:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 16:05:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-01-24 16:05:43,063 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 23 [2018-01-24 16:05:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:43,064 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-01-24 16:05:43,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:05:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-01-24 16:05:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:05:43,064 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:43,064 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] [2018-01-24 16:05:43,064 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash -212541728, now seen corresponding path program 1 times [2018-01-24 16:05:43,065 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:43,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:43,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:43,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:43,066 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:43,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:43,141 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:05:43,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:43,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:05:43,141 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:43,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:05:43,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:05:43,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:43,143 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 5 states. [2018-01-24 16:05:43,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:43,442 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-01-24 16:05:43,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:05:43,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 16:05:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:43,444 INFO L225 Difference]: With dead ends: 167 [2018-01-24 16:05:43,444 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 16:05:43,444 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:05:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 16:05:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2018-01-24 16:05:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 16:05:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2018-01-24 16:05:43,454 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 23 [2018-01-24 16:05:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:43,454 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2018-01-24 16:05:43,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:05:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-01-24 16:05:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:05:43,456 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:43,456 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:43,456 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1439904849, now seen corresponding path program 1 times [2018-01-24 16:05:43,457 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:43,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:43,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:43,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:43,458 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:43,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:43,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:05:43,590 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:05:43,591 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 16:05:43,593 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [12], [14], [17], [37], [40], [41], [42], [43], [46], [49], [92], [96], [98], [99], [105], [106], [109], [185], [186], [190], [191], [192] [2018-01-24 16:05:43,644 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:05:43,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:06:45,929 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:06:45,930 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:06:45,931 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:06:45,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:06:45,931 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:06:45,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:45,937 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:06:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:45,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:06:45,998 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:06:45,998 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:06:46,005 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:06:46,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:06:46 BoogieIcfgContainer [2018-01-24 16:06:46,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:06:46,007 INFO L168 Benchmark]: Toolchain (without parser) took 67027.00 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 267.1 MB in the beginning and 1.3 GB in the end (delta: -996.0 MB). Peak memory consumption was 990.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:06:46,008 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:06:46,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.09 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 254.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:06:46,009 INFO L168 Benchmark]: Boogie Preprocessor took 41.36 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 252.0 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:06:46,009 INFO L168 Benchmark]: RCFGBuilder took 514.97 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 222.0 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:06:46,009 INFO L168 Benchmark]: TraceAbstraction took 66248.26 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 221.0 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 944.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:06:46,011 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.09 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 254.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.36 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 514.97 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 222.0 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66248.26 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 221.0 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 944.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 985]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 985). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 109 locations, 43 error locations. TIMEOUT Result, 66.1s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 763 SDtfs, 1322 SDslu, 1042 SDs, 0 SdLazy, 1681 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 62.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 407 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 10166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-06-46-022.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-06-46-022.csv Completed graceful shutdown