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_smtcomp.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-25 06:14:37,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:14:37,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:14:37,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:14:37,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:14:37,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:14:37,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:14:37,925 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:14:37,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:14:37,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:14:37,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:14:37,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:14:37,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:14:37,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:14:37,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:14:37,936 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:14:37,938 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:14:37,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:14:37,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:14:37,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:14:37,946 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:14:37,946 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:14:37,946 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:14:37,947 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:14:37,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:14:37,950 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:14:37,950 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:14:37,951 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:14:37,951 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:14:37,951 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:14:37,952 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:14:37,952 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_smtcomp.epf [2018-01-25 06:14:37,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:14:37,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:14:37,961 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:14:37,961 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:14:37,961 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:14:37,962 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:14:37,962 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:14:37,962 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:14:37,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:14:37,963 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:14:37,963 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:14:37,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:14:37,963 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:14:37,963 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:14:37,963 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:14:37,963 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:14:37,964 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:14:37,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:14:37,964 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:14:37,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:14:37,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:14:37,964 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:14:37,964 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:14:37,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:14:37,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:14:37,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:14:37,965 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:14:37,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:14:37,966 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:14:37,966 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:14:37,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:14:37,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:14:37,966 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:14:37,966 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:14:37,967 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:14:37,967 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:14:38,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:14:38,015 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:14:38,019 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:14:38,020 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:14:38,020 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:14:38,021 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-25 06:14:38,217 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:14:38,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:14:38,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:14:38,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:14:38,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:14:38,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:14:38" (1/1) ... [2018-01-25 06:14:38,258 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 25.01 06:14:38, skipping insertion in model container [2018-01-25 06:14:38,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:14:38" (1/1) ... [2018-01-25 06:14:38,272 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:14:38,311 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:14:38,440 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:14:38,463 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:14:38,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38 WrapperNode [2018-01-25 06:14:38,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:14:38,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:14:38,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:14:38,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:14:38,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38" (1/1) ... [2018-01-25 06:14:38,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38" (1/1) ... [2018-01-25 06:14:38,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38" (1/1) ... [2018-01-25 06:14:38,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38" (1/1) ... [2018-01-25 06:14:38,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38" (1/1) ... [2018-01-25 06:14:38,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38" (1/1) ... [2018-01-25 06:14:38,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38" (1/1) ... [2018-01-25 06:14:38,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:14:38,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:14:38,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:14:38,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:14:38,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38" (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-25 06:14:38,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:14:38,572 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:14:38,572 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:14:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:14:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:14:38,573 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:14:38,573 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:14:38,573 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:14:38,573 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:14:38,573 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:14:38,573 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:14:38,574 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:14:38,574 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:14:38,574 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:14:38,574 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:14:38,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:14:38,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:14:39,022 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:14:39,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:14:39 BoogieIcfgContainer [2018-01-25 06:14:39,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:14:39,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:14:39,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:14:39,027 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:14:39,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:14:38" (1/3) ... [2018-01-25 06:14:39,029 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 25.01 06:14:39, skipping insertion in model container [2018-01-25 06:14:39,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:38" (2/3) ... [2018-01-25 06:14:39,029 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 25.01 06:14:39, skipping insertion in model container [2018-01-25 06:14:39,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:14:39" (3/3) ... [2018-01-25 06:14:39,032 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-25 06:14:39,039 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:14:39,045 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-25 06:14:39,084 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:14:39,085 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:14:39,085 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:14:39,085 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:14:39,085 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:14:39,085 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:14:39,085 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:14:39,085 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:14:39,086 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:14:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-01-25 06:14:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:14:39,109 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:39,110 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:39,111 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-25 06:14:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash 805618339, now seen corresponding path program 1 times [2018-01-25 06:14:39,116 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:39,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:39,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:39,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:39,157 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:39,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:39,265 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-25 06:14:39,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:39,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:39,267 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:39,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:39,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:39,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:39,282 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2018-01-25 06:14:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:39,617 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2018-01-25 06:14:39,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:14:39,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:14:39,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:39,631 INFO L225 Difference]: With dead ends: 232 [2018-01-25 06:14:39,631 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 06:14:39,635 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-25 06:14:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 06:14:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2018-01-25 06:14:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-25 06:14:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-25 06:14:39,679 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 8 [2018-01-25 06:14:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:39,680 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-25 06:14:39,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-25 06:14:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:14:39,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:39,680 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:39,680 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-25 06:14:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash 805618340, now seen corresponding path program 1 times [2018-01-25 06:14:39,681 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:39,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:39,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:39,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:39,682 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:39,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:39,752 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-25 06:14:39,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:39,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:39,752 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:39,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:39,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:39,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:39,754 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 4 states. [2018-01-25 06:14:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:39,896 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-25 06:14:39,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:14:39,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:14:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:39,898 INFO L225 Difference]: With dead ends: 131 [2018-01-25 06:14:39,898 INFO L226 Difference]: Without dead ends: 129 [2018-01-25 06:14:39,899 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-25 06:14:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-25 06:14:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2018-01-25 06:14:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 06:14:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-25 06:14:39,911 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 8 [2018-01-25 06:14:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:39,911 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-25 06:14:39,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-25 06:14:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:14:39,912 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:39,912 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:39,912 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-25 06:14:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash -86961810, now seen corresponding path program 1 times [2018-01-25 06:14:39,913 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:39,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:39,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:39,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:39,914 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:39,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:40,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:40,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:40,000 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:40,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:40,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:40,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:40,001 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 4 states. [2018-01-25 06:14:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:40,143 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-01-25 06:14:40,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:14:40,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 06:14:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:40,144 INFO L225 Difference]: With dead ends: 119 [2018-01-25 06:14:40,144 INFO L226 Difference]: Without dead ends: 103 [2018-01-25 06:14:40,145 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-25 06:14:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-25 06:14:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-01-25 06:14:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 06:14:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-01-25 06:14:40,156 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 15 [2018-01-25 06:14:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:40,157 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-01-25 06:14:40,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-01-25 06:14:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:14:40,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:40,158 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:40,158 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-25 06:14:40,158 INFO L82 PathProgramCache]: Analyzing trace with hash -86961809, now seen corresponding path program 1 times [2018-01-25 06:14:40,158 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:40,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:40,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:40,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:40,160 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:40,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:40,294 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-25 06:14:40,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:40,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:14:40,294 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:40,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:14:40,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:14:40,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:14:40,295 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 7 states. [2018-01-25 06:14:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:40,633 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2018-01-25 06:14:40,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:14:40,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 06:14:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:40,635 INFO L225 Difference]: With dead ends: 173 [2018-01-25 06:14:40,635 INFO L226 Difference]: Without dead ends: 160 [2018-01-25 06:14:40,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:14:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-25 06:14:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2018-01-25 06:14:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-25 06:14:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2018-01-25 06:14:40,648 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 15 [2018-01-25 06:14:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:40,649 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2018-01-25 06:14:40,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:14:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2018-01-25 06:14:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:14:40,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:40,649 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-25 06:14:40,650 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-25 06:14:40,650 INFO L82 PathProgramCache]: Analyzing trace with hash -854983682, now seen corresponding path program 1 times [2018-01-25 06:14:40,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:40,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:40,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:40,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:40,651 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:40,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:40,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:40,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:40,690 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:40,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:40,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:40,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:40,691 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 4 states. [2018-01-25 06:14:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:40,816 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2018-01-25 06:14:40,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:14:40,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-25 06:14:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:40,818 INFO L225 Difference]: With dead ends: 152 [2018-01-25 06:14:40,818 INFO L226 Difference]: Without dead ends: 151 [2018-01-25 06:14:40,818 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-25 06:14:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-25 06:14:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2018-01-25 06:14:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:14:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2018-01-25 06:14:40,829 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 18 [2018-01-25 06:14:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:40,829 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2018-01-25 06:14:40,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2018-01-25 06:14:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:14:40,830 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:40,830 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-25 06:14:40,830 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-25 06:14:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash -854983681, now seen corresponding path program 1 times [2018-01-25 06:14:40,830 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:40,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:40,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:40,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:40,832 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:40,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:40,893 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-25 06:14:40,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:40,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:40,893 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:40,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:40,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:40,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:40,894 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand 4 states. [2018-01-25 06:14:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:41,026 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2018-01-25 06:14:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:14:41,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-25 06:14:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:41,028 INFO L225 Difference]: With dead ends: 154 [2018-01-25 06:14:41,028 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 06:14:41,028 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-25 06:14:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 06:14:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2018-01-25 06:14:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 06:14:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2018-01-25 06:14:41,040 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 18 [2018-01-25 06:14:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:41,041 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2018-01-25 06:14:41,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2018-01-25 06:14:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:14:41,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:41,042 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-25 06:14:41,042 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-25 06:14:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash -814008083, now seen corresponding path program 1 times [2018-01-25 06:14:41,042 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:41,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:41,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:41,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:41,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:41,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:41,087 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-25 06:14:41,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:41,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:14:41,087 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:41,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:14:41,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:14:41,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:14:41,088 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand 6 states. [2018-01-25 06:14:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:41,318 INFO L93 Difference]: Finished difference Result 229 states and 272 transitions. [2018-01-25 06:14:41,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:14:41,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 06:14:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:41,321 INFO L225 Difference]: With dead ends: 229 [2018-01-25 06:14:41,321 INFO L226 Difference]: Without dead ends: 228 [2018-01-25 06:14:41,322 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-25 06:14:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-25 06:14:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 132. [2018-01-25 06:14:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-25 06:14:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2018-01-25 06:14:41,332 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 18 [2018-01-25 06:14:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:41,332 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2018-01-25 06:14:41,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:14:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2018-01-25 06:14:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:14:41,333 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:41,333 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-25 06:14:41,333 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-25 06:14:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash -814008082, now seen corresponding path program 1 times [2018-01-25 06:14:41,333 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:41,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:41,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:41,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:41,334 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:41,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:41,431 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-25 06:14:41,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:41,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:14:41,431 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:41,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:14:41,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:14:41,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:14:41,432 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand 6 states. [2018-01-25 06:14:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:41,728 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2018-01-25 06:14:41,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:14:41,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 06:14:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:41,729 INFO L225 Difference]: With dead ends: 236 [2018-01-25 06:14:41,729 INFO L226 Difference]: Without dead ends: 232 [2018-01-25 06:14:41,730 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-25 06:14:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-25 06:14:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 122. [2018-01-25 06:14:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 06:14:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2018-01-25 06:14:41,739 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 18 [2018-01-25 06:14:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:41,739 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2018-01-25 06:14:41,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:14:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2018-01-25 06:14:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:14:41,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:41,740 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-25 06:14:41,740 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-25 06:14:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1060549093, now seen corresponding path program 1 times [2018-01-25 06:14:41,741 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:41,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:41,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:41,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:41,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:41,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:41,853 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-25 06:14:41,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:41,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:14:41,854 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:41,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:14:41,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:14:41,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:41,855 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 5 states. [2018-01-25 06:14:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:41,969 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2018-01-25 06:14:41,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:14:41,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 06:14:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:41,970 INFO L225 Difference]: With dead ends: 210 [2018-01-25 06:14:41,970 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 06:14:41,971 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-25 06:14:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 06:14:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-01-25 06:14:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 06:14:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-01-25 06:14:41,978 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 23 [2018-01-25 06:14:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:41,979 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-01-25 06:14:41,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:14:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-01-25 06:14:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:14:41,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:41,979 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-25 06:14:41,980 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-25 06:14:41,980 INFO L82 PathProgramCache]: Analyzing trace with hash -212541728, now seen corresponding path program 1 times [2018-01-25 06:14:41,980 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:41,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:41,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:41,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:41,981 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:41,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:42,048 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-25 06:14:42,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:42,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:14:42,049 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:42,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:14:42,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:14:42,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:42,050 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 5 states. [2018-01-25 06:14:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:42,307 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-01-25 06:14:42,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:14:42,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 06:14:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:42,308 INFO L225 Difference]: With dead ends: 167 [2018-01-25 06:14:42,308 INFO L226 Difference]: Without dead ends: 162 [2018-01-25 06:14:42,309 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-25 06:14:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-25 06:14:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2018-01-25 06:14:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 06:14:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2018-01-25 06:14:42,315 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 23 [2018-01-25 06:14:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:42,315 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2018-01-25 06:14:42,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:14:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-01-25 06:14:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:14:42,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:42,317 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-25 06:14:42,317 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-25 06:14:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1439904849, now seen corresponding path program 1 times [2018-01-25 06:14:42,318 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:42,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:42,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:42,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:42,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:42,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:42,409 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-25 06:14:42,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:14:42,410 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:14:42,411 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 06:14:42,412 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-25 06:14:42,457 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:14:42,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:15:42,819 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:15:42,820 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:15:42,820 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:15:42,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:15:42,821 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-25 06:15:42,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:42,827 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:15:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:42,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:15:42,873 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:15:42,874 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:15:42,879 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:15:42,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:15:42 BoogieIcfgContainer [2018-01-25 06:15:42,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:15:42,880 INFO L168 Benchmark]: Toolchain (without parser) took 64662.26 ms. Allocated memory was 304.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 264.1 MB in the beginning and 378.0 MB in the end (delta: -113.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-25 06:15:42,881 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:15:42,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.15 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 251.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:42,881 INFO L168 Benchmark]: Boogie Preprocessor took 41.75 ms. Allocated memory is still 304.1 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:42,882 INFO L168 Benchmark]: RCFGBuilder took 507.62 ms. Allocated memory is still 304.1 MB. Free memory was 249.1 MB in the beginning and 219.5 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:42,882 INFO L168 Benchmark]: TraceAbstraction took 63854.78 ms. Allocated memory was 304.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 218.5 MB in the beginning and 378.0 MB in the end (delta: -159.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 06:15:42,884 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.15 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.15 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 251.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.75 ms. Allocated memory is still 304.1 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 507.62 ms. Allocated memory is still 304.1 MB. Free memory was 249.1 MB in the beginning and 219.5 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63854.78 ms. Allocated memory was 304.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 218.5 MB in the beginning and 378.0 MB in the end (delta: -159.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 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, 63.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.1s 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.3s 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, 60.4s 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-15-42-895.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-15-42-895.csv Completed graceful shutdown