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_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:23:48,513 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:23:48,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:23:48,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:23:48,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:23:48,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:23:48,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:23:48,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:23:48,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:23:48,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:23:48,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:23:48,537 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:23:48,538 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:23:48,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:23:48,540 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:23:48,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:23:48,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:23:48,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:23:48,549 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:23:48,550 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:23:48,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:23:48,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:23:48,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:23:48,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:23:48,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:23:48,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:23:48,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:23:48,558 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:23:48,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:23:48,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:23:48,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:23:48,559 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_imprecise.epf [2018-01-24 17:23:48,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:23:48,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:23:48,571 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:23:48,571 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:23:48,571 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:23:48,571 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:23:48,571 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:23:48,572 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:23:48,572 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:23:48,573 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:23:48,573 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:23:48,573 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:23:48,573 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:23:48,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:23:48,574 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:23:48,574 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:23:48,574 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:23:48,574 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:23:48,574 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:23:48,575 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:23:48,575 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:23:48,575 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:23:48,575 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:23:48,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:23:48,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:23:48,576 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:23:48,576 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:23:48,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:23:48,577 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:23:48,577 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:23:48,577 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:23:48,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:23:48,577 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:23:48,578 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:23:48,578 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:23:48,579 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:23:48,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:23:48,625 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:23:48,629 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:23:48,631 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:23:48,631 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:23:48,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-01-24 17:23:48,815 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:23:48,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:23:48,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:23:48,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:23:48,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:23:48,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:23:48" (1/1) ... [2018-01-24 17:23:48,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c336041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:48, skipping insertion in model container [2018-01-24 17:23:48,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:23:48" (1/1) ... [2018-01-24 17:23:48,851 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:23:48,899 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:23:49,012 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:23:49,034 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:23:49,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49 WrapperNode [2018-01-24 17:23:49,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:23:49,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:23:49,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:23:49,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:23:49,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49" (1/1) ... [2018-01-24 17:23:49,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49" (1/1) ... [2018-01-24 17:23:49,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49" (1/1) ... [2018-01-24 17:23:49,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49" (1/1) ... [2018-01-24 17:23:49,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49" (1/1) ... [2018-01-24 17:23:49,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49" (1/1) ... [2018-01-24 17:23:49,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49" (1/1) ... [2018-01-24 17:23:49,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:23:49,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:23:49,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:23:49,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:23:49,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:23:49,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:23:49,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:23:49,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:23:49,126 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-24 17:23:49,126 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-24 17:23:49,127 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-01-24 17:23:49,127 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-24 17:23:49,127 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:23:49,127 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:23:49,127 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:23:49,127 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:23:49,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:23:49,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:23:49,128 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:23:49,128 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:23:49,128 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:23:49,128 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:23:49,128 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:23:49,129 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-24 17:23:49,129 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-24 17:23:49,129 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-01-24 17:23:49,129 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-24 17:23:49,129 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:23:49,130 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:23:49,130 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:23:49,130 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:23:49,338 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:23:49,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:23:49 BoogieIcfgContainer [2018-01-24 17:23:49,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:23:49,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:23:49,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:23:49,342 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:23:49,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:23:48" (1/3) ... [2018-01-24 17:23:49,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca49d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:23:49, skipping insertion in model container [2018-01-24 17:23:49,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:49" (2/3) ... [2018-01-24 17:23:49,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca49d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:23:49, skipping insertion in model container [2018-01-24 17:23:49,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:23:49" (3/3) ... [2018-01-24 17:23:49,344 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-01-24 17:23:49,350 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:23:49,355 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 17:23:49,392 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:23:49,392 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:23:49,392 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:23:49,392 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:23:49,392 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:23:49,392 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:23:49,392 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:23:49,393 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:23:49,393 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:23:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-24 17:23:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 17:23:49,415 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:49,416 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 17:23:49,417 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 3232357, now seen corresponding path program 1 times [2018-01-24 17:23:49,422 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:49,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:49,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:49,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:49,467 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:49,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:49,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:49,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:23:49,563 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:49,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:23:49,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:23:49,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:23:49,578 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-24 17:23:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:49,771 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-24 17:23:49,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:23:49,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 17:23:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:49,785 INFO L225 Difference]: With dead ends: 81 [2018-01-24 17:23:49,785 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 17:23:49,788 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:23:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 17:23:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-01-24 17:23:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 17:23:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-24 17:23:49,823 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-01-24 17:23:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:49,823 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-24 17:23:49,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:23:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-24 17:23:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 17:23:49,824 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:49,824 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 17:23:49,824 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash 3232358, now seen corresponding path program 1 times [2018-01-24 17:23:49,825 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:49,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:49,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:49,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:49,827 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:49,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:49,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:49,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:23:49,888 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:49,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:23:49,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:23:49,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:23:49,890 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-01-24 17:23:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:49,959 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-01-24 17:23:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:23:49,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 17:23:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:50,000 INFO L225 Difference]: With dead ends: 118 [2018-01-24 17:23:50,001 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 17:23:50,002 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:23:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 17:23:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-01-24 17:23:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 17:23:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-01-24 17:23:50,019 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-01-24 17:23:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:50,019 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-01-24 17:23:50,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:23:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-01-24 17:23:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:23:50,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:50,021 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:50,022 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash -293037669, now seen corresponding path program 1 times [2018-01-24 17:23:50,022 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:50,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:50,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,024 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:50,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:50,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:50,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:23:50,154 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:50,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:23:50,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:23:50,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:23:50,155 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-01-24 17:23:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:50,444 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2018-01-24 17:23:50,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:23:50,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 17:23:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:50,446 INFO L225 Difference]: With dead ends: 124 [2018-01-24 17:23:50,446 INFO L226 Difference]: Without dead ends: 118 [2018-01-24 17:23:50,447 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:23:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-24 17:23:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-01-24 17:23:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 17:23:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-01-24 17:23:50,464 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-01-24 17:23:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:50,465 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-01-24 17:23:50,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:23:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-01-24 17:23:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:23:50,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:50,466 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:50,466 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash -293037668, now seen corresponding path program 1 times [2018-01-24 17:23:50,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:50,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:50,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,468 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:50,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:50,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:50,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:23:50,578 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:50,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:23:50,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:23:50,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:23:50,579 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-01-24 17:23:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:50,627 INFO L93 Difference]: Finished difference Result 145 states and 172 transitions. [2018-01-24 17:23:50,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:23:50,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 17:23:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:50,629 INFO L225 Difference]: With dead ends: 145 [2018-01-24 17:23:50,629 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 17:23:50,629 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:23:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 17:23:50,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-24 17:23:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 17:23:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-01-24 17:23:50,647 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-01-24 17:23:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:50,647 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-01-24 17:23:50,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:23:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-01-24 17:23:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:23:50,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:50,649 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:50,649 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2126392044, now seen corresponding path program 1 times [2018-01-24 17:23:50,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:50,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:50,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:50,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:50,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:50,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:23:50,720 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:50,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:23:50,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:23:50,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:23:50,720 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-01-24 17:23:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:50,737 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-01-24 17:23:50,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:23:50,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 17:23:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:50,739 INFO L225 Difference]: With dead ends: 125 [2018-01-24 17:23:50,739 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 17:23:50,739 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:23:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 17:23:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 17:23:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 17:23:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-01-24 17:23:50,746 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-01-24 17:23:50,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:50,746 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-01-24 17:23:50,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:23:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-01-24 17:23:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:23:50,747 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:50,747 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:50,747 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:50,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1815899569, now seen corresponding path program 1 times [2018-01-24 17:23:50,747 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:50,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:50,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,748 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:50,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:50,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:50,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:23:50,813 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:50,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:23:50,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:23:50,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:23:50,814 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-01-24 17:23:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:50,837 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-24 17:23:50,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:23:50,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 17:23:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:50,839 INFO L225 Difference]: With dead ends: 79 [2018-01-24 17:23:50,839 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 17:23:50,839 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:23:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 17:23:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-24 17:23:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 17:23:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-01-24 17:23:50,847 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-01-24 17:23:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:50,848 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-01-24 17:23:50,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:23:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-01-24 17:23:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:23:50,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:50,849 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] [2018-01-24 17:23:50,849 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash -510641866, now seen corresponding path program 1 times [2018-01-24 17:23:50,849 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:50,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:50,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:50,851 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:50,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:50,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:50,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:23:50,983 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:50,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:23:50,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:23:50,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:23:50,984 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-01-24 17:23:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:51,034 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-24 17:23:51,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:23:51,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 17:23:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:51,036 INFO L225 Difference]: With dead ends: 69 [2018-01-24 17:23:51,036 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 17:23:51,037 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:23:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 17:23:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-24 17:23:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 17:23:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-01-24 17:23:51,045 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-01-24 17:23:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:51,045 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-01-24 17:23:51,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:23:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-01-24 17:23:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:23:51,047 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:51,047 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] [2018-01-24 17:23:51,047 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:51,047 INFO L82 PathProgramCache]: Analyzing trace with hash -510641865, now seen corresponding path program 1 times [2018-01-24 17:23:51,047 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:51,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:51,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:51,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:51,049 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:51,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:51,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:51,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:23:51,134 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:51,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:23:51,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:23:51,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:23:51,136 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-01-24 17:23:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:51,222 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-01-24 17:23:51,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:23:51,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 17:23:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:51,224 INFO L225 Difference]: With dead ends: 68 [2018-01-24 17:23:51,224 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 17:23:51,225 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:23:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 17:23:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-24 17:23:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 17:23:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-24 17:23:51,232 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-01-24 17:23:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:51,232 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-24 17:23:51,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:23:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-24 17:23:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:23:51,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:51,234 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:51,234 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:51,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419564, now seen corresponding path program 1 times [2018-01-24 17:23:51,235 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:51,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:51,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:51,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:51,237 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:51,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:51,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:51,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:23:51,471 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:51,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:23:51,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:23:51,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:23:51,472 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-01-24 17:23:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:51,772 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-24 17:23:51,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:23:51,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-24 17:23:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:51,774 INFO L225 Difference]: With dead ends: 76 [2018-01-24 17:23:51,774 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 17:23:51,774 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:23:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 17:23:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-01-24 17:23:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 17:23:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-24 17:23:51,781 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-01-24 17:23:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:51,781 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-24 17:23:51,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:23:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-24 17:23:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:23:51,783 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:51,783 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:51,783 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:51,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419565, now seen corresponding path program 1 times [2018-01-24 17:23:51,783 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:51,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:51,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:51,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:51,785 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:51,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:51,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:51,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:23:51,974 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:51,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:23:51,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:23:51,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:23:51,975 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 10 states. [2018-01-24 17:23:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:52,569 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-01-24 17:23:52,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:23:52,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-24 17:23:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:52,570 INFO L225 Difference]: With dead ends: 72 [2018-01-24 17:23:52,570 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 17:23:52,571 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:23:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 17:23:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-01-24 17:23:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 17:23:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-24 17:23:52,580 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-01-24 17:23:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:52,580 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-24 17:23:52,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:23:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-24 17:23:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:23:52,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:52,581 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:52,581 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:52,582 INFO L82 PathProgramCache]: Analyzing trace with hash 758520105, now seen corresponding path program 1 times [2018-01-24 17:23:52,582 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:52,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:52,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:52,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:52,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:52,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:52,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:52,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:23:52,854 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:52,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:23:52,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:23:52,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:23:52,855 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-01-24 17:23:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:53,180 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-24 17:23:53,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:23:53,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-24 17:23:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:53,181 INFO L225 Difference]: With dead ends: 70 [2018-01-24 17:23:53,181 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 17:23:53,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:23:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 17:23:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-24 17:23:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 17:23:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-24 17:23:53,191 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 32 [2018-01-24 17:23:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:53,191 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-24 17:23:53,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:23:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-24 17:23:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:23:53,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:53,192 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-24 17:23:53,192 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1206669578, now seen corresponding path program 1 times [2018-01-24 17:23:53,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:53,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:53,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:53,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:53,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:53,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:53,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:53,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:23:53,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:53,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:23:53,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:23:53,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:23:53,240 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-01-24 17:23:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:53,261 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-01-24 17:23:53,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:23:53,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-24 17:23:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:53,262 INFO L225 Difference]: With dead ends: 87 [2018-01-24 17:23:53,262 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 17:23:53,263 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:23:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 17:23:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-01-24 17:23:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 17:23:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-01-24 17:23:53,269 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 34 [2018-01-24 17:23:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:53,269 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-01-24 17:23:53,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:23:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-01-24 17:23:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 17:23:53,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:53,270 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, 1, 1, 1, 1, 1] [2018-01-24 17:23:53,271 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-24 17:23:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227651, now seen corresponding path program 1 times [2018-01-24 17:23:53,271 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:53,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:53,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:53,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:53,272 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:23:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:23:53,329 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 17:23:53,347 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 17:23:53,353 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-24 17:23:53,353 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-24 17:23:53,354 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-24 17:23:53,354 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-24 17:23:53,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:23:53 BoogieIcfgContainer [2018-01-24 17:23:53,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:23:53,370 INFO L168 Benchmark]: Toolchain (without parser) took 4553.64 ms. Allocated memory was 303.6 MB in the beginning and 510.7 MB in the end (delta: 207.1 MB). Free memory was 262.6 MB in the beginning and 326.9 MB in the end (delta: -64.2 MB). Peak memory consumption was 142.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:23:53,371 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:23:53,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.52 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 249.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-24 17:23:53,372 INFO L168 Benchmark]: Boogie Preprocessor took 33.48 ms. Allocated memory is still 303.6 MB. Free memory was 249.2 MB in the beginning and 247.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:23:53,372 INFO L168 Benchmark]: RCFGBuilder took 260.68 ms. Allocated memory is still 303.6 MB. Free memory was 247.3 MB in the beginning and 227.7 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:23:53,373 INFO L168 Benchmark]: TraceAbstraction took 4029.12 ms. Allocated memory was 303.6 MB in the beginning and 510.7 MB in the end (delta: 207.1 MB). Free memory was 227.7 MB in the beginning and 326.9 MB in the end (delta: -99.2 MB). Peak memory consumption was 107.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:23:53,375 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.52 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 249.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.48 ms. Allocated memory is still 303.6 MB. Free memory was 249.2 MB in the beginning and 247.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 260.68 ms. Allocated memory is still 303.6 MB. Free memory was 247.3 MB in the beginning and 227.7 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4029.12 ms. Allocated memory was 303.6 MB in the beginning and 510.7 MB in the end (delta: 207.1 MB). Free memory was 227.7 MB in the beginning and 326.9 MB in the end (delta: -99.2 MB). Peak memory consumption was 107.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1478]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1478. Possible FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1467] FCALL struct A a6; VAL [a6={9:0}] [L1479] CALL entry_point() VAL [a6={9:0}] [L1471] CALL, EXPR probe2_6(&a6) VAL [a={9:0}, a6={9:0}] [L1444] int ret = - -3; VAL [a={9:0}, a={9:0}, a6={9:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={9:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={9:0}, malloc(size)={7:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={7:0}, a6={9:0}, malloc(size)={7:0}, size=4] [L1445] EXPR ldv_malloc(sizeof(int)) VAL [a={9:0}, a={9:0}, a6={9:0}, ldv_malloc(sizeof(int))={7:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); [L1446] COND FALSE !(p==0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={9:0}] [L1435] RET return __VERIFIER_nondet_int(); [L1448] EXPR f6() VAL [a={9:0}, a={9:0}, a6={9:0}, f6()=0, p={7:0}, ret=3] [L1448] ret = f6() [L1449] COND FALSE !(ret<0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={9:0}] [L1439] RET return __VERIFIER_nondet_int(); [L1451] EXPR g6() VAL [a={9:0}, a={9:0}, a6={9:0}, g6()=-1, p={7:0}, ret=0] [L1451] ret = g6() [L1452] COND TRUE ret<0 [L1453] RET return ret; VAL [\result=-1, a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=-1] [L1471] EXPR probe2_6(&a6) VAL [a6={9:0}, probe2_6(&a6)=-1] [L1471] int ret = probe2_6(&a6); [L1472] COND FALSE !(ret==0) VAL [a6={9:0}, ret=-1] [L1475] RET, FCALL a6.p = 0 VAL [a6={9:0}, ret=-1] [L1479] entry_point() VAL [a6={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. UNSAFE Result, 3.9s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 650 SDtfs, 537 SDslu, 1708 SDs, 0 SdLazy, 975 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 34732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-23-53-383.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-23-53-383.csv Received shutdown request...