java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:16:22,137 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:16:22,139 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:16:22,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:16:22,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:16:22,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:16:22,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:16:22,159 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:16:22,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:16:22,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:16:22,162 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:16:22,162 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:16:22,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:16:22,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:16:22,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:16:22,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:16:22,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:16:22,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:16:22,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:16:22,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:16:22,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:16:22,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:16:22,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:16:22,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:16:22,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:16:22,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:16:22,182 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:16:22,183 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:16:22,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:16:22,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:16:22,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:16:22,184 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 16:16:22,194 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:16:22,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:16:22,195 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:16:22,196 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:16:22,196 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:16:22,196 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:16:22,196 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:16:22,197 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:16:22,197 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:16:22,198 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:16:22,198 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:16:22,198 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:16:22,198 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:16:22,198 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:16:22,199 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:16:22,199 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:16:22,199 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:16:22,199 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:16:22,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:16:22,200 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:16:22,200 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:16:22,200 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:16:22,200 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:16:22,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:16:22,201 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:16:22,201 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:16:22,201 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:16:22,201 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:16:22,202 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:16:22,202 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:16:22,202 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:16:22,202 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:16:22,202 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:16:22,203 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:16:22,204 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:16:22,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:16:22,253 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:16:22,257 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:16:22,259 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:16:22,259 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:16:22,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:16:22,438 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:16:22,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:16:22,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:16:22,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:16:22,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:16:22,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:16:22" (1/1) ... [2018-01-24 16:16:22,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a76578b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22, skipping insertion in model container [2018-01-24 16:16:22,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:16:22" (1/1) ... [2018-01-24 16:16:22,534 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:16:22,575 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:16:22,691 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:16:22,712 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:16:22,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22 WrapperNode [2018-01-24 16:16:22,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:16:22,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:16:22,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:16:22,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:16:22,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22" (1/1) ... [2018-01-24 16:16:22,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22" (1/1) ... [2018-01-24 16:16:22,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22" (1/1) ... [2018-01-24 16:16:22,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22" (1/1) ... [2018-01-24 16:16:22,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22" (1/1) ... [2018-01-24 16:16:22,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22" (1/1) ... [2018-01-24 16:16:22,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22" (1/1) ... [2018-01-24 16:16:22,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:16:22,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:16:22,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:16:22,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:16:22,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:16:22,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:16:22,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:16:22,819 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:16:22,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:16:22,819 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:16:22,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:16:22,819 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:16:22,819 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:16:22,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:16:22,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:16:22,820 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:16:22,820 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:16:22,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:16:22,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:16:22,821 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:16:22,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:16:22,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:16:23,384 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:16:23,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:16:23 BoogieIcfgContainer [2018-01-24 16:16:23,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:16:23,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:16:23,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:16:23,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:16:23,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:16:22" (1/3) ... [2018-01-24 16:16:23,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eecb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:16:23, skipping insertion in model container [2018-01-24 16:16:23,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:16:22" (2/3) ... [2018-01-24 16:16:23,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eecb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:16:23, skipping insertion in model container [2018-01-24 16:16:23,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:16:23" (3/3) ... [2018-01-24 16:16:23,393 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:16:23,400 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:16:23,407 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-01-24 16:16:23,450 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:16:23,450 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:16:23,451 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:16:23,451 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:16:23,451 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:16:23,451 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:16:23,451 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:16:23,451 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:16:23,452 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:16:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-01-24 16:16:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:16:23,479 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:16:23,480 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:16:23,481 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:16:23,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1406208534, now seen corresponding path program 1 times [2018-01-24 16:16:23,486 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:16:23,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:23,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:16:23,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:23,529 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:16:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:16:23,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:16:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:16:23,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:16:23,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:16:23,652 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:16:23,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:16:23,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:16:23,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:16:23,774 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2018-01-24 16:16:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:16:24,032 INFO L93 Difference]: Finished difference Result 314 states and 388 transitions. [2018-01-24 16:16:24,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:16:24,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:16:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:16:24,045 INFO L225 Difference]: With dead ends: 314 [2018-01-24 16:16:24,045 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 16:16:24,049 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:16:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 16:16:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2018-01-24 16:16:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-24 16:16:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-01-24 16:16:24,095 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 8 [2018-01-24 16:16:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:16:24,096 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-01-24 16:16:24,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:16:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-01-24 16:16:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:16:24,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:16:24,097 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:16:24,097 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:16:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1406208535, now seen corresponding path program 1 times [2018-01-24 16:16:24,097 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:16:24,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:24,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:16:24,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:24,099 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:16:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:16:24,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:16:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:16:24,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:16:24,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:16:24,189 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:16:24,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:16:24,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:16:24,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:16:24,192 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 4 states. [2018-01-24 16:16:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:16:24,489 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2018-01-24 16:16:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:16:24,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:16:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:16:24,492 INFO L225 Difference]: With dead ends: 169 [2018-01-24 16:16:24,492 INFO L226 Difference]: Without dead ends: 167 [2018-01-24 16:16:24,493 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:16:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-24 16:16:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2018-01-24 16:16:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 16:16:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-01-24 16:16:24,508 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 8 [2018-01-24 16:16:24,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:16:24,509 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-01-24 16:16:24,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:16:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-01-24 16:16:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:16:24,510 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:16:24,510 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:16:24,510 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:16:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1461588635, now seen corresponding path program 1 times [2018-01-24 16:16:24,510 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:16:24,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:24,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:16:24,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:24,512 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:16:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:16:24,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:16:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:16:24,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:16:24,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:16:24,594 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:16:24,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:16:24,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:16:24,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:16:24,595 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 4 states. [2018-01-24 16:16:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:16:24,755 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2018-01-24 16:16:24,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:16:24,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 16:16:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:16:24,757 INFO L225 Difference]: With dead ends: 194 [2018-01-24 16:16:24,757 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 16:16:24,758 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:16:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 16:16:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2018-01-24 16:16:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 16:16:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2018-01-24 16:16:24,775 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 15 [2018-01-24 16:16:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:16:24,775 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2018-01-24 16:16:24,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:16:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2018-01-24 16:16:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:16:24,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:16:24,776 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:16:24,776 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:16:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1461588636, now seen corresponding path program 1 times [2018-01-24 16:16:24,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:16:24,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:24,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:16:24,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:24,778 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:16:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:16:24,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:16:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:16:24,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:16:24,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:16:24,908 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:16:24,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:16:24,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:16:24,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:16:24,909 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 7 states. [2018-01-24 16:16:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:16:25,493 INFO L93 Difference]: Finished difference Result 264 states and 288 transitions. [2018-01-24 16:16:25,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:16:25,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-24 16:16:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:16:25,496 INFO L225 Difference]: With dead ends: 264 [2018-01-24 16:16:25,496 INFO L226 Difference]: Without dead ends: 243 [2018-01-24 16:16:25,497 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-24 16:16:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-24 16:16:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2018-01-24 16:16:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-24 16:16:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2018-01-24 16:16:25,513 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 15 [2018-01-24 16:16:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:16:25,513 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2018-01-24 16:16:25,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:16:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2018-01-24 16:16:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:16:25,514 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:16:25,514 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:16:25,514 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:16:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash -191427424, now seen corresponding path program 1 times [2018-01-24 16:16:25,515 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:16:25,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:25,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:16:25,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:25,516 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:16:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:16:25,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:16:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:16:25,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:16:25,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:16:25,580 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:16:25,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:16:25,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:16:25,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:16:25,581 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 6 states. [2018-01-24 16:16:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:16:25,922 INFO L93 Difference]: Finished difference Result 410 states and 471 transitions. [2018-01-24 16:16:25,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:16:25,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 16:16:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:16:25,927 INFO L225 Difference]: With dead ends: 410 [2018-01-24 16:16:25,927 INFO L226 Difference]: Without dead ends: 409 [2018-01-24 16:16:25,927 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:16:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-01-24 16:16:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 218. [2018-01-24 16:16:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 16:16:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 251 transitions. [2018-01-24 16:16:25,940 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 251 transitions. Word has length 18 [2018-01-24 16:16:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:16:25,940 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 251 transitions. [2018-01-24 16:16:25,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:16:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 251 transitions. [2018-01-24 16:16:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:16:25,941 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:16:25,941 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:16:25,941 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:16:25,941 INFO L82 PathProgramCache]: Analyzing trace with hash -191427423, now seen corresponding path program 1 times [2018-01-24 16:16:25,941 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:16:25,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:25,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:16:25,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:25,942 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:16:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:16:25,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:16:26,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-24 16:16:26,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:16:26,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:16:26,049 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:16:26,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:16:26,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:16:26,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:16:26,050 INFO L87 Difference]: Start difference. First operand 218 states and 251 transitions. Second operand 6 states. [2018-01-24 16:16:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:16:26,550 INFO L93 Difference]: Finished difference Result 403 states and 465 transitions. [2018-01-24 16:16:26,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:16:26,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 16:16:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:16:26,553 INFO L225 Difference]: With dead ends: 403 [2018-01-24 16:16:26,553 INFO L226 Difference]: Without dead ends: 398 [2018-01-24 16:16:26,554 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:16:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-24 16:16:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 207. [2018-01-24 16:16:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-24 16:16:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2018-01-24 16:16:26,569 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 18 [2018-01-24 16:16:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:16:26,569 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2018-01-24 16:16:26,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:16:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2018-01-24 16:16:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:16:26,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:16:26,571 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:16:26,571 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:16:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2092077490, now seen corresponding path program 1 times [2018-01-24 16:16:26,571 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:16:26,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:26,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:16:26,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:26,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:16:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:16:26,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:16:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:16:26,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:16:26,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:16:26,605 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:16:26,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:16:26,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:16:26,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:16:26,606 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand 3 states. [2018-01-24 16:16:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:16:26,664 INFO L93 Difference]: Finished difference Result 439 states and 508 transitions. [2018-01-24 16:16:26,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:16:26,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-24 16:16:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:16:26,666 INFO L225 Difference]: With dead ends: 439 [2018-01-24 16:16:26,666 INFO L226 Difference]: Without dead ends: 242 [2018-01-24 16:16:26,668 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:16:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-24 16:16:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 218. [2018-01-24 16:16:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 16:16:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 251 transitions. [2018-01-24 16:16:26,682 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 251 transitions. Word has length 24 [2018-01-24 16:16:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:16:26,682 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 251 transitions. [2018-01-24 16:16:26,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:16:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 251 transitions. [2018-01-24 16:16:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:16:26,684 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:16:26,684 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:16:26,684 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:16:26,684 INFO L82 PathProgramCache]: Analyzing trace with hash -252118467, now seen corresponding path program 1 times [2018-01-24 16:16:26,685 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:16:26,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:26,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:16:26,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:16:26,686 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:16:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:16:26,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:16:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:16:26,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:16:26,883 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:16:26,884 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-01-24 16:16:26,885 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [12], [14], [17], [19], [20], [21], [24], [27], [28], [31], [34], [40], [41], [53], [57], [62], [66], [72], [76], [78], [81], [84], [85], [89], [358], [359], [363], [364], [365] [2018-01-24 16:16:26,932 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:16:26,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:17:28,108 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:17:28,109 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:17:28,110 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:17:28,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:17:28,110 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:17:28,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:28,117 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:17:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:28,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:17:28,170 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:17:28,171 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:17:28,178 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:17:28,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:17:28 BoogieIcfgContainer [2018-01-24 16:17:28,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:17:28,179 INFO L168 Benchmark]: Toolchain (without parser) took 65740.43 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 260.5 MB in the beginning and 1.1 GB in the end (delta: -884.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 16:17:28,180 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 301.5 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:17:28,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.77 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 248.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:17:28,181 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 301.5 MB. Free memory was 246.6 MB in the beginning and 244.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:17:28,181 INFO L168 Benchmark]: RCFGBuilder took 620.69 ms. Allocated memory is still 301.5 MB. Free memory was 244.6 MB in the beginning and 205.7 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:17:28,182 INFO L168 Benchmark]: TraceAbstraction took 64792.22 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 203.7 MB in the beginning and 1.1 GB in the end (delta: -940.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-24 16:17:28,183 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 301.5 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 275.77 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 248.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.29 ms. Allocated memory is still 301.5 MB. Free memory was 246.6 MB in the beginning and 244.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 620.69 ms. Allocated memory is still 301.5 MB. Free memory was 244.6 MB in the beginning and 205.7 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64792.22 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 203.7 MB in the beginning and 1.1 GB in the end (delta: -940.9 MB). Peak memory consumption was 1.0 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 1046). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 169 locations, 63 error locations. TIMEOUT Result, 64.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 938 SDtfs, 2205 SDslu, 1212 SDs, 0 SdLazy, 1576 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 61.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 457 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 4743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-17-28-196.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-17-28-196.csv Completed graceful shutdown