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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:41:34,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:41:35,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:41:35,011 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:41:35,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:41:35,012 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:41:35,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:41:35,014 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:41:35,015 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:41:35,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:41:35,017 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:41:35,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:41:35,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:41:35,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:41:35,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:41:35,020 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:41:35,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:41:35,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:41:35,024 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:41:35,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:41:35,027 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:41:35,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:41:35,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:41:35,028 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:41:35,028 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:41:35,029 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:41:35,029 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:41:35,030 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:41:35,030 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:41:35,030 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:41:35,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:41:35,031 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:41:35,040 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:41:35,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:41:35,041 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:41:35,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:41:35,041 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:41:35,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:41:35,042 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:41:35,042 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:41:35,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:41:35,042 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:41:35,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:41:35,042 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:41:35,043 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:41:35,043 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:41:35,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:41:35,043 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:41:35,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:41:35,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:41:35,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:41:35,044 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:41:35,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:41:35,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:41:35,044 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:41:35,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:41:35,044 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:41:35,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:41:35,085 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:41:35,089 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:41:35,090 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:41:35,090 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:41:35,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-04 00:41:35,256 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:41:35,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:41:35,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:41:35,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:41:35,264 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:41:35,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:41:35" (1/1) ... [2018-02-04 00:41:35,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35, skipping insertion in model container [2018-02-04 00:41:35,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:41:35" (1/1) ... [2018-02-04 00:41:35,277 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:41:35,313 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:41:35,398 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:41:35,412 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:41:35,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35 WrapperNode [2018-02-04 00:41:35,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:41:35,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:41:35,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:41:35,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:41:35,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35" (1/1) ... [2018-02-04 00:41:35,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35" (1/1) ... [2018-02-04 00:41:35,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35" (1/1) ... [2018-02-04 00:41:35,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35" (1/1) ... [2018-02-04 00:41:35,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35" (1/1) ... [2018-02-04 00:41:35,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35" (1/1) ... [2018-02-04 00:41:35,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35" (1/1) ... [2018-02-04 00:41:35,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:41:35,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:41:35,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:41:35,444 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:41:35,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 00:41:35,476 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:41:35,476 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:41:35,477 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:41:35,477 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 00:41:35,477 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 00:41:35,477 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-02-04 00:41:35,477 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 00:41:35,477 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:41:35,477 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:41:35,477 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:41:35,477 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:41:35,477 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:41:35,477 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:41:35,477 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:41:35,477 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:41:35,478 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:41:35,623 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:41:35,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:41:35 BoogieIcfgContainer [2018-02-04 00:41:35,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:41:35,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:41:35,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:41:35,626 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:41:35,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:41:35" (1/3) ... [2018-02-04 00:41:35,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a28c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:41:35, skipping insertion in model container [2018-02-04 00:41:35,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:35" (2/3) ... [2018-02-04 00:41:35,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a28c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:41:35, skipping insertion in model container [2018-02-04 00:41:35,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:41:35" (3/3) ... [2018-02-04 00:41:35,628 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-04 00:41:35,634 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:41:35,638 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 00:41:35,672 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:41:35,672 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:41:35,672 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:41:35,672 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:41:35,672 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:41:35,673 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:41:35,673 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:41:35,673 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:41:35,673 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:41:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-04 00:41:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 00:41:35,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:35,694 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 00:41:35,694 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-02-04 00:41:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash 3232357, now seen corresponding path program 1 times [2018-02-04 00:41:35,700 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:35,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:35,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:35,751 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:35,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:35,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:35,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:35,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:41:35,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:41:35,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:41:35,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:41:35,849 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-04 00:41:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:35,993 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 00:41:35,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:41:35,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 00:41:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:36,005 INFO L225 Difference]: With dead ends: 79 [2018-02-04 00:41:36,005 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 00:41:36,007 INFO L554 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-02-04 00:41:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 00:41:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-04 00:41:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 00:41:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 00:41:36,044 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-04 00:41:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:36,044 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 00:41:36,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:41:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 00:41:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 00:41:36,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:36,045 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 00:41:36,045 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-02-04 00:41:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash 3232358, now seen corresponding path program 1 times [2018-02-04 00:41:36,046 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:36,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:36,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,047 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:36,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:36,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:36,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:36,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:41:36,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:41:36,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:41:36,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:41:36,102 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-02-04 00:41:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:36,147 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-04 00:41:36,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:41:36,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 00:41:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:36,149 INFO L225 Difference]: With dead ends: 116 [2018-02-04 00:41:36,150 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 00:41:36,150 INFO L554 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-02-04 00:41:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 00:41:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-04 00:41:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 00:41:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-04 00:41:36,160 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-04 00:41:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:36,160 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-04 00:41:36,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:41:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-04 00:41:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:41:36,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:36,162 INFO L351 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-02-04 00:41:36,162 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-02-04 00:41:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash -293037669, now seen corresponding path program 1 times [2018-02-04 00:41:36,162 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:36,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:36,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,164 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:36,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:36,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:36,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:36,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:41:36,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:41:36,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:41:36,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:41:36,263 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-02-04 00:41:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:36,450 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-02-04 00:41:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:41:36,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 00:41:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:36,451 INFO L225 Difference]: With dead ends: 122 [2018-02-04 00:41:36,451 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 00:41:36,451 INFO L554 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-02-04 00:41:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 00:41:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-02-04 00:41:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 00:41:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-04 00:41:36,459 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-02-04 00:41:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:36,460 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-04 00:41:36,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:41:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-04 00:41:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:41:36,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:36,460 INFO L351 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-02-04 00:41:36,460 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-02-04 00:41:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash -293037668, now seen corresponding path program 1 times [2018-02-04 00:41:36,461 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:36,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:36,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,462 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:36,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:36,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:36,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:36,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:41:36,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:41:36,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:41:36,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:41:36,511 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-02-04 00:41:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:36,535 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2018-02-04 00:41:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:41:36,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 00:41:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:36,537 INFO L225 Difference]: With dead ends: 120 [2018-02-04 00:41:36,537 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 00:41:36,538 INFO L554 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-02-04 00:41:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 00:41:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 00:41:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 00:41:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-04 00:41:36,549 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-02-04 00:41:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:36,550 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-04 00:41:36,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:41:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-04 00:41:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:41:36,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:36,553 INFO L351 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-02-04 00:41:36,553 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-02-04 00:41:36,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2126392044, now seen corresponding path program 1 times [2018-02-04 00:41:36,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:36,553 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:36,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:36,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:36,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:36,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:36,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:41:36,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:41:36,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:41:36,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:41:36,643 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-02-04 00:41:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:36,655 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 00:41:36,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:41:36,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 00:41:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:36,656 INFO L225 Difference]: With dead ends: 77 [2018-02-04 00:41:36,656 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 00:41:36,657 INFO L554 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-02-04 00:41:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 00:41:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 00:41:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 00:41:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-04 00:41:36,661 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-02-04 00:41:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:36,661 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-04 00:41:36,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:41:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-04 00:41:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:41:36,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:36,662 INFO L351 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-02-04 00:41:36,662 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-02-04 00:41:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1815899569, now seen corresponding path program 1 times [2018-02-04 00:41:36,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:36,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:36,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:36,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:36,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:36,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:36,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:41:36,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:41:36,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:41:36,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:41:36,711 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-02-04 00:41:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:36,737 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-02-04 00:41:36,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:41:36,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 00:41:36,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:36,738 INFO L225 Difference]: With dead ends: 69 [2018-02-04 00:41:36,738 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 00:41:36,738 INFO L554 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-02-04 00:41:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 00:41:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 00:41:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 00:41:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 00:41:36,743 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-02-04 00:41:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:36,743 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 00:41:36,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:41:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 00:41:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 00:41:36,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:36,744 INFO L351 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-02-04 00:41:36,745 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-02-04 00:41:36,745 INFO L82 PathProgramCache]: Analyzing trace with hash -510641866, now seen corresponding path program 1 times [2018-02-04 00:41:36,745 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:36,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:36,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,747 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:36,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:36,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:36,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:36,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:41:36,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:41:36,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:41:36,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:41:36,792 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-04 00:41:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:36,809 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-04 00:41:36,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:41:36,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 00:41:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:36,811 INFO L225 Difference]: With dead ends: 68 [2018-02-04 00:41:36,811 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 00:41:36,811 INFO L554 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-02-04 00:41:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 00:41:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 00:41:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 00:41:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-04 00:41:36,815 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-02-04 00:41:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:36,816 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-04 00:41:36,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:41:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-04 00:41:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 00:41:36,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:36,817 INFO L351 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-02-04 00:41:36,817 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-02-04 00:41:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash -510641865, now seen corresponding path program 1 times [2018-02-04 00:41:36,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:36,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:36,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:36,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:36,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:36,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:36,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:41:36,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:41:36,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:41:36,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:41:36,862 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-02-04 00:41:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:36,926 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-04 00:41:36,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:41:36,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 00:41:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:36,927 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:41:36,927 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 00:41:36,928 INFO L554 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-02-04 00:41:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 00:41:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 00:41:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 00:41:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 00:41:36,936 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-02-04 00:41:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:36,936 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 00:41:36,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:41:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 00:41:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:41:36,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:36,937 INFO L351 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-02-04 00:41:36,937 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-02-04 00:41:36,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419564, now seen corresponding path program 1 times [2018-02-04 00:41:36,937 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:36,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:36,939 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,939 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:36,939 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:36,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:37,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:37,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:41:37,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:41:37,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:41:37,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:41:37,048 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-02-04 00:41:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:37,269 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-04 00:41:37,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:41:37,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 00:41:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:37,270 INFO L225 Difference]: With dead ends: 75 [2018-02-04 00:41:37,271 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 00:41:37,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:41:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 00:41:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 00:41:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 00:41:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 00:41:37,274 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-02-04 00:41:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:37,280 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 00:41:37,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:41:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 00:41:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:41:37,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:37,281 INFO L351 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-02-04 00:41:37,282 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-02-04 00:41:37,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419565, now seen corresponding path program 1 times [2018-02-04 00:41:37,282 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:37,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:37,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:37,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:37,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:37,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:37,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:37,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 00:41:37,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:41:37,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:41:37,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:41:37,413 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 10 states. [2018-02-04 00:41:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:37,710 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-02-04 00:41:37,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:41:37,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-04 00:41:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:37,711 INFO L225 Difference]: With dead ends: 70 [2018-02-04 00:41:37,711 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 00:41:37,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:41:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 00:41:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-02-04 00:41:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 00:41:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-04 00:41:37,714 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-02-04 00:41:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:37,714 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-04 00:41:37,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:41:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-04 00:41:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:41:37,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:37,715 INFO L351 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-02-04 00:41:37,715 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-02-04 00:41:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash 758520105, now seen corresponding path program 1 times [2018-02-04 00:41:37,716 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:37,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:37,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:37,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:37,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:37,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:37,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:37,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:41:37,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:41:37,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:41:37,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:41:37,881 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-02-04 00:41:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:38,138 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-04 00:41:38,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:41:38,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 00:41:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:38,139 INFO L225 Difference]: With dead ends: 68 [2018-02-04 00:41:38,140 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 00:41:38,140 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:41:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 00:41:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 00:41:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 00:41:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 00:41:38,143 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 32 [2018-02-04 00:41:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:38,143 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 00:41:38,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:41:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 00:41:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:41:38,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:38,144 INFO L351 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-02-04 00:41:38,145 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-02-04 00:41:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1206669578, now seen corresponding path program 1 times [2018-02-04 00:41:38,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:38,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:38,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:38,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:38,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:38,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:38,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:38,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:41:38,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:41:38,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:41:38,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:41:38,188 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-04 00:41:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:38,204 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-04 00:41:38,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:41:38,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 00:41:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:38,205 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:41:38,205 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 00:41:38,205 INFO L554 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-02-04 00:41:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 00:41:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-02-04 00:41:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 00:41:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-02-04 00:41:38,207 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 34 [2018-02-04 00:41:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:38,208 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-02-04 00:41:38,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:41:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-02-04 00:41:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 00:41:38,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:38,209 INFO L351 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-02-04 00:41:38,209 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-02-04 00:41:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227651, now seen corresponding path program 1 times [2018-02-04 00:41:38,209 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:38,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:38,210 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:38,210 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:38,210 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:41:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:41:38,257 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 00:41:38,269 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 00:41:38,273 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 00:41:38,274 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 00:41:38,274 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 00:41:38,275 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 00:41:38,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:41:38 BoogieIcfgContainer [2018-02-04 00:41:38,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:41:38,285 INFO L168 Benchmark]: Toolchain (without parser) took 3027.91 ms. Allocated memory was 404.2 MB in the beginning and 664.3 MB in the end (delta: 260.0 MB). Free memory was 361.1 MB in the beginning and 567.2 MB in the end (delta: -206.1 MB). Peak memory consumption was 53.9 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:38,286 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:41:38,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.58 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 347.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:38,286 INFO L168 Benchmark]: Boogie Preprocessor took 25.17 ms. Allocated memory is still 404.2 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:38,287 INFO L168 Benchmark]: RCFGBuilder took 180.06 ms. Allocated memory is still 404.2 MB. Free memory was 346.5 MB in the beginning and 324.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:38,287 INFO L168 Benchmark]: TraceAbstraction took 2659.93 ms. Allocated memory was 404.2 MB in the beginning and 664.3 MB in the end (delta: 260.0 MB). Free memory was 324.5 MB in the beginning and 567.2 MB in the end (delta: -242.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:38,288 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.20 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.58 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 347.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.17 ms. Allocated memory is still 404.2 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 180.06 ms. Allocated memory is still 404.2 MB. Free memory was 346.5 MB in the beginning and 324.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2659.93 ms. Allocated memory was 404.2 MB in the beginning and 664.3 MB in the end (delta: 260.0 MB). Free memory was 324.5 MB in the beginning and 567.2 MB in the end (delta: -242.7 MB). Peak memory consumption was 17.4 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 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$# * 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, 2.6s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 650 SDtfs, 550 SDslu, 1695 SDs, 0 SdLazy, 929 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 33523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-41-38-294.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-41-38-294.csv Received shutdown request...