java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:13:24,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:13:24,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:13:24,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:13:24,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:13:24,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:13:24,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:13:24,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:13:24,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:13:24,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:13:24,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:13:24,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:13:24,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:13:24,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:13:24,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:13:24,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:13:24,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:13:24,259 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:13:24,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:13:24,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:13:24,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:13:24,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:13:24,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:13:24,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:13:24,267 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:13:24,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:13:24,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:13:24,270 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:13:24,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:13:24,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:13:24,271 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:13:24,271 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:13:24,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:13:24,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:13:24,282 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:13:24,282 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:13:24,282 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:13:24,282 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:13:24,283 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:13:24,283 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:13:24,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:13:24,284 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:13:24,284 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:13:24,284 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:13:24,284 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:13:24,284 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:13:24,285 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:13:24,285 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:13:24,285 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:13:24,285 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:13:24,285 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:13:24,285 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:13:24,286 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:13:24,286 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:13:24,286 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:13:24,286 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:13:24,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:13:24,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:13:24,287 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:13:24,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:13:24,287 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:13:24,287 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:13:24,288 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:13:24,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:13:24,288 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:13:24,288 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:13:24,289 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:13:24,289 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:13:24,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:13:24,336 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:13:24,340 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:13:24,341 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:13:24,342 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:13:24,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-01-25 06:13:24,528 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:13:24,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:13:24,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:13:24,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:13:24,540 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:13:24,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:13:24" (1/1) ... [2018-01-25 06:13:24,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24, skipping insertion in model container [2018-01-25 06:13:24,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:13:24" (1/1) ... [2018-01-25 06:13:24,557 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:13:24,597 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:13:24,718 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:13:24,737 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:13:24,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24 WrapperNode [2018-01-25 06:13:24,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:13:24,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:13:24,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:13:24,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:13:24,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24" (1/1) ... [2018-01-25 06:13:24,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24" (1/1) ... [2018-01-25 06:13:24,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24" (1/1) ... [2018-01-25 06:13:24,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24" (1/1) ... [2018-01-25 06:13:24,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24" (1/1) ... [2018-01-25 06:13:24,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24" (1/1) ... [2018-01-25 06:13:24,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24" (1/1) ... [2018-01-25 06:13:24,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:13:24,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:13:24,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:13:24,790 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:13:24,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:13:24,838 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:13:24,838 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:13:24,838 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:13:24,838 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:13:24,838 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:13:24,838 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:13:24,839 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:13:24,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:13:24,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:13:24,839 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:13:24,839 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:13:24,839 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:13:24,839 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:13:24,839 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:13:24,839 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:13:24,840 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:13:24,840 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:13:25,390 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:13:25,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:13:25 BoogieIcfgContainer [2018-01-25 06:13:25,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:13:25,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:13:25,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:13:25,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:13:25,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:13:24" (1/3) ... [2018-01-25 06:13:25,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf9222a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:13:25, skipping insertion in model container [2018-01-25 06:13:25,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:13:24" (2/3) ... [2018-01-25 06:13:25,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf9222a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:13:25, skipping insertion in model container [2018-01-25 06:13:25,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:13:25" (3/3) ... [2018-01-25 06:13:25,398 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-01-25 06:13:25,405 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:13:25,413 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-01-25 06:13:25,455 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:13:25,455 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:13:25,455 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:13:25,455 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:13:25,455 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:13:25,455 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:13:25,456 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:13:25,456 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:13:25,456 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:13:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-01-25 06:13:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:13:25,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:25,485 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:25,485 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash 726209746, now seen corresponding path program 1 times [2018-01-25 06:13:25,492 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:25,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:25,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:25,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:25,544 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:25,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:25,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:25,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:13:25,657 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:25,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:13:25,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:13:25,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:13:25,674 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-01-25 06:13:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:26,058 INFO L93 Difference]: Finished difference Result 316 states and 377 transitions. [2018-01-25 06:13:26,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:13:26,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:13:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:26,071 INFO L225 Difference]: With dead ends: 316 [2018-01-25 06:13:26,072 INFO L226 Difference]: Without dead ends: 177 [2018-01-25 06:13:26,076 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:13:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-25 06:13:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2018-01-25 06:13:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-25 06:13:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-01-25 06:13:26,116 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 8 [2018-01-25 06:13:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:26,117 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-01-25 06:13:26,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:13:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-01-25 06:13:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:13:26,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:26,117 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:26,117 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash 726209747, now seen corresponding path program 1 times [2018-01-25 06:13:26,118 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:26,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:26,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:26,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:26,120 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:26,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:26,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:26,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:13:26,242 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:26,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:13:26,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:13:26,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:13:26,244 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 4 states. [2018-01-25 06:13:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:26,446 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-01-25 06:13:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:13:26,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:13:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:26,448 INFO L225 Difference]: With dead ends: 154 [2018-01-25 06:13:26,448 INFO L226 Difference]: Without dead ends: 151 [2018-01-25 06:13:26,449 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:13:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-25 06:13:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-25 06:13:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 06:13:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2018-01-25 06:13:26,459 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 8 [2018-01-25 06:13:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:26,459 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2018-01-25 06:13:26,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:13:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2018-01-25 06:13:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 06:13:26,460 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:26,460 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:26,460 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:26,460 INFO L82 PathProgramCache]: Analyzing trace with hash 3311897, now seen corresponding path program 1 times [2018-01-25 06:13:26,461 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:26,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:26,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:26,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:26,463 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:26,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:26,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:26,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:13:26,521 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:26,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:13:26,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:13:26,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:13:26,522 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand 4 states. [2018-01-25 06:13:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:26,651 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2018-01-25 06:13:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:13:26,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 06:13:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:26,654 INFO L225 Difference]: With dead ends: 170 [2018-01-25 06:13:26,654 INFO L226 Difference]: Without dead ends: 162 [2018-01-25 06:13:26,654 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:13:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-25 06:13:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 147. [2018-01-25 06:13:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-25 06:13:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2018-01-25 06:13:26,664 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 13 [2018-01-25 06:13:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:26,664 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2018-01-25 06:13:26,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:13:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2018-01-25 06:13:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 06:13:26,665 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:26,665 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:26,665 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:26,666 INFO L82 PathProgramCache]: Analyzing trace with hash 3311898, now seen corresponding path program 1 times [2018-01-25 06:13:26,666 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:26,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:26,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:26,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:26,668 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:26,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:26,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:26,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:13:26,741 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:26,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:13:26,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:13:26,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:13:26,742 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 4 states. [2018-01-25 06:13:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:26,901 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2018-01-25 06:13:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:13:26,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 06:13:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:26,904 INFO L225 Difference]: With dead ends: 167 [2018-01-25 06:13:26,905 INFO L226 Difference]: Without dead ends: 159 [2018-01-25 06:13:26,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:13:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-25 06:13:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-01-25 06:13:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 06:13:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-01-25 06:13:26,917 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 13 [2018-01-25 06:13:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:26,917 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-01-25 06:13:26,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:13:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-01-25 06:13:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 06:13:26,918 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:26,918 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] [2018-01-25 06:13:26,919 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash -969711578, now seen corresponding path program 1 times [2018-01-25 06:13:26,919 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:26,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:26,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:26,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:26,922 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:26,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:27,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:27,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:13:27,030 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:27,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:13:27,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:13:27,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:13:27,032 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 4 states. [2018-01-25 06:13:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:27,185 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-01-25 06:13:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:13:27,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-25 06:13:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:27,186 INFO L225 Difference]: With dead ends: 170 [2018-01-25 06:13:27,186 INFO L226 Difference]: Without dead ends: 154 [2018-01-25 06:13:27,187 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:13:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-25 06:13:27,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2018-01-25 06:13:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-25 06:13:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-01-25 06:13:27,196 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 21 [2018-01-25 06:13:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:27,196 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-01-25 06:13:27,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:13:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-01-25 06:13:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 06:13:27,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:27,197 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] [2018-01-25 06:13:27,198 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:27,198 INFO L82 PathProgramCache]: Analyzing trace with hash -969711577, now seen corresponding path program 1 times [2018-01-25 06:13:27,198 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:27,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:27,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:27,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:27,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:27,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:27,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:27,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:13:27,324 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:27,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:13:27,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:13:27,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:13:27,325 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 7 states. [2018-01-25 06:13:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:27,660 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-01-25 06:13:27,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:13:27,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-25 06:13:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:27,662 INFO L225 Difference]: With dead ends: 182 [2018-01-25 06:13:27,662 INFO L226 Difference]: Without dead ends: 175 [2018-01-25 06:13:27,662 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:13:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-25 06:13:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2018-01-25 06:13:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-25 06:13:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-01-25 06:13:27,671 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 21 [2018-01-25 06:13:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:27,671 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-01-25 06:13:27,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:13:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-01-25 06:13:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:13:27,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:27,672 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:27,672 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash 115077033, now seen corresponding path program 1 times [2018-01-25 06:13:27,673 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:27,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:27,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:27,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:27,674 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:27,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:27,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:27,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:13:27,729 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:27,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:13:27,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:13:27,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:13:27,730 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 5 states. [2018-01-25 06:13:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:27,911 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-01-25 06:13:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:13:27,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 06:13:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:27,913 INFO L225 Difference]: With dead ends: 198 [2018-01-25 06:13:27,913 INFO L226 Difference]: Without dead ends: 197 [2018-01-25 06:13:27,913 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:13:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-25 06:13:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2018-01-25 06:13:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-25 06:13:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-01-25 06:13:27,921 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 23 [2018-01-25 06:13:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:27,922 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-01-25 06:13:27,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:13:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-01-25 06:13:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:13:27,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:27,922 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:27,923 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash 115077034, now seen corresponding path program 1 times [2018-01-25 06:13:27,923 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:27,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:27,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:27,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:27,924 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:27,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:28,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:28,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:13:28,020 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:28,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:13:28,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:13:28,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:13:28,021 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 5 states. [2018-01-25 06:13:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:28,226 INFO L93 Difference]: Finished difference Result 220 states and 238 transitions. [2018-01-25 06:13:28,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:13:28,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 06:13:28,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:28,228 INFO L225 Difference]: With dead ends: 220 [2018-01-25 06:13:28,228 INFO L226 Difference]: Without dead ends: 219 [2018-01-25 06:13:28,228 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:13:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-25 06:13:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 148. [2018-01-25 06:13:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-25 06:13:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-01-25 06:13:28,233 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 23 [2018-01-25 06:13:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:28,234 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-01-25 06:13:28,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:13:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-01-25 06:13:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:13:28,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:28,235 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:28,235 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:28,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253035, now seen corresponding path program 1 times [2018-01-25 06:13:28,235 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:28,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:28,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:28,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:28,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:28,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:28,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:28,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:13:28,398 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:28,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:13:28,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:13:28,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:13:28,399 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 9 states. [2018-01-25 06:13:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:29,000 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-01-25 06:13:29,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:13:29,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-01-25 06:13:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:29,002 INFO L225 Difference]: With dead ends: 162 [2018-01-25 06:13:29,003 INFO L226 Difference]: Without dead ends: 161 [2018-01-25 06:13:29,003 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:13:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-25 06:13:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-01-25 06:13:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-25 06:13:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-01-25 06:13:29,010 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 27 [2018-01-25 06:13:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:29,011 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-01-25 06:13:29,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:13:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-01-25 06:13:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:13:29,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:29,012 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:29,013 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253036, now seen corresponding path program 1 times [2018-01-25 06:13:29,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:29,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:29,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:29,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:29,015 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:29,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:29,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:29,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:13:29,268 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:29,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:13:29,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:13:29,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:13:29,269 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 10 states. [2018-01-25 06:13:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:29,969 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2018-01-25 06:13:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:13:29,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-25 06:13:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:29,970 INFO L225 Difference]: With dead ends: 188 [2018-01-25 06:13:29,971 INFO L226 Difference]: Without dead ends: 177 [2018-01-25 06:13:29,971 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-25 06:13:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-25 06:13:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2018-01-25 06:13:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-25 06:13:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-01-25 06:13:29,977 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 27 [2018-01-25 06:13:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:29,977 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-01-25 06:13:29,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:13:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-01-25 06:13:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 06:13:29,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:29,979 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:29,979 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:29,980 INFO L82 PathProgramCache]: Analyzing trace with hash 78293977, now seen corresponding path program 1 times [2018-01-25 06:13:29,980 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:29,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:29,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:29,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:29,981 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:29,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:30,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:30,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:13:30,098 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:30,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:13:30,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:13:30,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:13:30,099 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 8 states. [2018-01-25 06:13:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:30,345 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-01-25 06:13:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:13:30,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-01-25 06:13:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:30,346 INFO L225 Difference]: With dead ends: 216 [2018-01-25 06:13:30,346 INFO L226 Difference]: Without dead ends: 180 [2018-01-25 06:13:30,347 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:13:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-25 06:13:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2018-01-25 06:13:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-25 06:13:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-01-25 06:13:30,356 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 33 [2018-01-25 06:13:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:30,356 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-01-25 06:13:30,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:13:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-01-25 06:13:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:13:30,358 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:30,358 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:30,358 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:30,358 INFO L82 PathProgramCache]: Analyzing trace with hash -133974448, now seen corresponding path program 1 times [2018-01-25 06:13:30,358 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:30,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:30,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:30,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:30,360 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:30,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:30,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:30,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:13:30,418 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:30,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:13:30,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:13:30,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:13:30,419 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 5 states. [2018-01-25 06:13:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:30,709 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-01-25 06:13:30,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:13:30,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-25 06:13:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:30,711 INFO L225 Difference]: With dead ends: 227 [2018-01-25 06:13:30,711 INFO L226 Difference]: Without dead ends: 226 [2018-01-25 06:13:30,711 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:13:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-25 06:13:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 151. [2018-01-25 06:13:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 06:13:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-25 06:13:30,720 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-01-25 06:13:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:30,720 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-25 06:13:30,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:13:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-25 06:13:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:13:30,722 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:30,722 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:13:30,722 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash -133974447, now seen corresponding path program 1 times [2018-01-25 06:13:30,723 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:30,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:30,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:30,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:30,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:30,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:30,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:13:30,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:13:30,856 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:13:30,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:13:30,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:13:30,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:13:30,857 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 5 states. [2018-01-25 06:13:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:13:31,097 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2018-01-25 06:13:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:13:31,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-25 06:13:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:13:31,099 INFO L225 Difference]: With dead ends: 249 [2018-01-25 06:13:31,099 INFO L226 Difference]: Without dead ends: 248 [2018-01-25 06:13:31,099 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:13:31,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-25 06:13:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 150. [2018-01-25 06:13:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-25 06:13:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-25 06:13:31,106 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-01-25 06:13:31,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:13:31,106 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-25 06:13:31,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:13:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-25 06:13:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:13:31,108 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:13:31,108 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-25 06:13:31,108 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:13:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1586747252, now seen corresponding path program 1 times [2018-01-25 06:13:31,108 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:13:31,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:31,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:13:31,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:13:31,110 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:13:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:13:31,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:13:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:13:31,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:13:31,262 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:13:31,263 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-01-25 06:13:31,265 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [12], [13], [16], [19], [22], [26], [28], [31], [146], [150], [155], [159], [167], [168], [175], [179], [187], [193], [194], [195], [243], [245], [248], [298], [299], [303], [304], [305] [2018-01-25 06:13:31,314 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:13:31,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:14:23,567 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:14:23,568 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:14:23,569 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:14:23,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:14:23,569 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:14:23,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:23,575 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:14:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:23,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:14:23,655 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:14:23,656 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:14:23,663 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:14:23,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:14:23 BoogieIcfgContainer [2018-01-25 06:14:23,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:14:23,664 INFO L168 Benchmark]: Toolchain (without parser) took 59135.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 259.4 MB in the beginning and 399.0 MB in the end (delta: -139.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 06:14:23,666 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 301.5 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:14:23,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.33 ms. Allocated memory is still 301.5 MB. Free memory was 258.4 MB in the beginning and 246.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:14:23,666 INFO L168 Benchmark]: Boogie Preprocessor took 43.71 ms. Allocated memory is still 301.5 MB. Free memory was 246.2 MB in the beginning and 244.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:14:23,667 INFO L168 Benchmark]: RCFGBuilder took 600.96 ms. Allocated memory is still 301.5 MB. Free memory was 244.2 MB in the beginning and 204.0 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:14:23,667 INFO L168 Benchmark]: TraceAbstraction took 58271.34 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 204.0 MB in the beginning and 399.0 MB in the end (delta: -195.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 06:14:23,668 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.18 ms. Allocated memory is still 301.5 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.33 ms. Allocated memory is still 301.5 MB. Free memory was 258.4 MB in the beginning and 246.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.71 ms. Allocated memory is still 301.5 MB. Free memory was 246.2 MB in the beginning and 244.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 600.96 ms. Allocated memory is still 301.5 MB. Free memory was 244.2 MB in the beginning and 204.0 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58271.34 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 204.0 MB in the beginning and 399.0 MB in the end (delta: -195.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 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 6 known predicates. - TimeoutResultAtElement [Line: 985]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 985). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 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 6 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1056). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1057). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). 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 6 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1056). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1052). 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 6 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). 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 6 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1057). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1052). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). 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 6 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 6 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 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). 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 6 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 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 160 locations, 67 error locations. TIMEOUT Result, 58.2s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1319 SDtfs, 3215 SDslu, 1999 SDs, 0 SdLazy, 2972 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 52.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 445 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 20498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-14-23-677.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-14-23-677.csv Completed graceful shutdown