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_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:38:34,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:38:34,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:38:34,781 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:38:34,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:38:34,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:38:34,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:38:34,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:38:34,787 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:38:34,788 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:38:34,789 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:38:34,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:38:34,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:38:34,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:38:34,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:38:34,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:38:34,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:38:34,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:38:34,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:38:34,803 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:38:34,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:38:34,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:38:34,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:38:34,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:38:34,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:38:34,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:38:34,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:38:34,810 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:38:34,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:38:34,810 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:38:34,811 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:38:34,811 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_preciseopt.epf [2018-01-25 03:38:34,822 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:38:34,822 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:38:34,823 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:38:34,823 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:38:34,823 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:38:34,824 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:38:34,824 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:38:34,824 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:38:34,824 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:38:34,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:38:34,825 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:38:34,825 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:38:34,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:38:34,826 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:38:34,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:38:34,826 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:38:34,826 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:38:34,827 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:38:34,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:38:34,827 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:38:34,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:38:34,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:38:34,828 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:38:34,828 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:38:34,828 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:38:34,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:38:34,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:38:34,829 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:38:34,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:38:34,829 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:38:34,829 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:38:34,830 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:38:34,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:38:34,830 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:38:34,830 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:38:34,831 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:38:34,831 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:38:34,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:38:34,881 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:38:34,885 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:38:34,887 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:38:34,887 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:38:34,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-25 03:38:35,123 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:38:35,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:38:35,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:38:35,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:38:35,134 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:38:35,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:38:35" (1/1) ... [2018-01-25 03:38:35,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c105265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35, skipping insertion in model container [2018-01-25 03:38:35,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:38:35" (1/1) ... [2018-01-25 03:38:35,151 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:38:35,202 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:38:35,326 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:38:35,347 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:38:35,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35 WrapperNode [2018-01-25 03:38:35,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:38:35,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:38:35,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:38:35,357 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:38:35,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35" (1/1) ... [2018-01-25 03:38:35,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35" (1/1) ... [2018-01-25 03:38:35,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35" (1/1) ... [2018-01-25 03:38:35,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35" (1/1) ... [2018-01-25 03:38:35,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35" (1/1) ... [2018-01-25 03:38:35,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35" (1/1) ... [2018-01-25 03:38:35,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35" (1/1) ... [2018-01-25 03:38:35,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:38:35,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:38:35,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:38:35,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:38:35,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:38:35,442 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:38:35,442 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:38:35,442 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:38:35,442 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-25 03:38:35,442 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-25 03:38:35,442 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-25 03:38:35,442 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-25 03:38:35,443 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:38:35,443 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:38:35,443 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:38:35,443 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:38:35,443 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:38:35,443 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:38:35,443 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:38:35,443 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:38:35,443 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:38:35,444 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:38:35,444 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:38:35,444 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-25 03:38:35,444 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-25 03:38:35,444 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-25 03:38:35,444 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-25 03:38:35,445 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:38:35,445 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:38:35,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:38:35,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:38:35,670 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:38:35,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:38:35 BoogieIcfgContainer [2018-01-25 03:38:35,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:38:35,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:38:35,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:38:35,673 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:38:35,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:38:35" (1/3) ... [2018-01-25 03:38:35,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345efa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:38:35, skipping insertion in model container [2018-01-25 03:38:35,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:35" (2/3) ... [2018-01-25 03:38:35,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345efa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:38:35, skipping insertion in model container [2018-01-25 03:38:35,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:38:35" (3/3) ... [2018-01-25 03:38:35,676 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-25 03:38:35,683 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:38:35,688 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 03:38:35,734 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:38:35,735 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:38:35,735 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:38:35,735 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:38:35,735 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:38:35,735 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:38:35,736 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:38:35,736 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:38:35,737 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:38:35,759 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-25 03:38:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:38:35,765 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:35,766 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:35,766 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -554404132, now seen corresponding path program 1 times [2018-01-25 03:38:35,772 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:35,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:35,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:35,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:35,823 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:35,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38: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-01-25 03:38:36,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:36,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:38:36,103 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:36,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:38:36,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:38:36,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:36,118 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-01-25 03:38:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:36,245 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-01-25 03:38:36,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:38:36,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 03:38:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:36,264 INFO L225 Difference]: With dead ends: 112 [2018-01-25 03:38:36,264 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 03:38:36,268 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 03:38:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-01-25 03:38:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 03:38:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-01-25 03:38:36,315 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 23 [2018-01-25 03:38:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:36,315 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-01-25 03:38:36,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:38:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-01-25 03:38:36,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:38:36,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:36,317 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:36,317 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:36,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293187, now seen corresponding path program 1 times [2018-01-25 03:38:36,318 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:36,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:36,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:36,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:36,323 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:36,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:36,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:36,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:38:36,475 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:36,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:36,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:36,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:36,478 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-01-25 03:38:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:36,808 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-25 03:38:36,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:38:36,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 03:38:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:36,813 INFO L225 Difference]: With dead ends: 76 [2018-01-25 03:38:36,813 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 03:38:36,814 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:38:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 03:38:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-01-25 03:38:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 03:38:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-01-25 03:38:36,833 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 23 [2018-01-25 03:38:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:36,834 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-01-25 03:38:36,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-01-25 03:38:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:38:36,838 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:36,838 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:36,838 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293188, now seen corresponding path program 1 times [2018-01-25 03:38:36,839 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:36,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:36,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:36,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:36,843 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:36,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:36,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:36,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:38:36,949 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:36,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:36,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:36,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:36,951 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 6 states. [2018-01-25 03:38:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:37,029 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-01-25 03:38:37,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:38:37,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 03:38:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:37,031 INFO L225 Difference]: With dead ends: 95 [2018-01-25 03:38:37,031 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 03:38:37,032 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-25 03:38:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 03:38:37,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-01-25 03:38:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 03:38:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-01-25 03:38:37,038 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2018-01-25 03:38:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:37,038 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-01-25 03:38:37,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-01-25 03:38:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:38:37,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:37,039 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] [2018-01-25 03:38:37,039 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash 787364094, now seen corresponding path program 1 times [2018-01-25 03:38:37,040 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:37,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:37,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:37,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:37,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:37,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:38:37,110 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:37,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:37,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:37,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:37,111 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-01-25 03:38:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:37,143 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-25 03:38:37,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:38:37,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 03:38:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:37,144 INFO L225 Difference]: With dead ends: 67 [2018-01-25 03:38:37,145 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 03:38:37,145 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-25 03:38:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 03:38:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-25 03:38:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 03:38:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-25 03:38:37,153 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 25 [2018-01-25 03:38:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:37,154 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-25 03:38:37,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-25 03:38:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:38:37,154 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:37,155 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] [2018-01-25 03:38:37,155 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash 787364095, now seen corresponding path program 1 times [2018-01-25 03:38:37,155 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:37,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:37,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,156 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:37,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:37,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:37,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:38:37,231 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:37,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:37,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:37,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:37,232 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-01-25 03:38:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:37,363 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-25 03:38:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:38:37,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 03:38:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:37,365 INFO L225 Difference]: With dead ends: 70 [2018-01-25 03:38:37,365 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 03:38:37,366 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-25 03:38:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 03:38:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-01-25 03:38:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-25 03:38:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-25 03:38:37,374 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2018-01-25 03:38:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:37,375 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-25 03:38:37,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-25 03:38:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:38:37,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:37,376 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] [2018-01-25 03:38:37,377 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:37,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1459091407, now seen corresponding path program 1 times [2018-01-25 03:38:37,377 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:37,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:37,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:37,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:37,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:37,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:38:37,488 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:37,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:38:37,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:38:37,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:38:37,490 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2018-01-25 03:38:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:37,599 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-01-25 03:38:37,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:38:37,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-25 03:38:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:37,601 INFO L225 Difference]: With dead ends: 75 [2018-01-25 03:38:37,601 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 03:38:37,601 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 03:38:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 03:38:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 03:38:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-01-25 03:38:37,609 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 25 [2018-01-25 03:38:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:37,610 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-01-25 03:38:37,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:38:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-01-25 03:38:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:38:37,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:37,611 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:37,611 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:37,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1886799503, now seen corresponding path program 1 times [2018-01-25 03:38:37,612 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:37,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:37,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,614 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:37,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:37,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:37,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:38:37,681 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:37,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:37,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:37,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:37,688 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-01-25 03:38:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:37,723 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-01-25 03:38:37,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:38:37,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-25 03:38:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:37,725 INFO L225 Difference]: With dead ends: 67 [2018-01-25 03:38:37,725 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 03:38:37,725 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-25 03:38:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 03:38:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 03:38:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 03:38:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-25 03:38:37,732 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 27 [2018-01-25 03:38:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:37,732 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-25 03:38:37,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-25 03:38:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:38:37,733 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:37,734 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] [2018-01-25 03:38:37,734 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash 725932211, now seen corresponding path program 1 times [2018-01-25 03:38:37,734 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:37,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:37,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:37,736 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:37,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:37,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:37,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:38:37,950 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:37,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:38:37,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:38:37,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:38:37,950 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-01-25 03:38:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:38,177 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-25 03:38:38,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:38:38,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-25 03:38:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:38,181 INFO L225 Difference]: With dead ends: 63 [2018-01-25 03:38:38,182 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 03:38:38,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:38:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 03:38:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-01-25 03:38:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 03:38:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-25 03:38:38,195 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 31 [2018-01-25 03:38:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:38,196 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-25 03:38:38,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:38:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-25 03:38:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:38:38,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:38,197 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:38,197 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash 725932212, now seen corresponding path program 1 times [2018-01-25 03:38:38,198 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:38,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:38,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:38,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:38,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:38,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:38,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:38,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:38:38,410 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:38,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:38:38,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:38:38,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:38:38,411 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 9 states. [2018-01-25 03:38:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:38,678 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-01-25 03:38:38,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:38:38,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-25 03:38:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:38,679 INFO L225 Difference]: With dead ends: 58 [2018-01-25 03:38:38,679 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 03:38:38,679 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:38:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 03:38:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-01-25 03:38:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 03:38:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-25 03:38:38,689 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2018-01-25 03:38:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:38,690 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-25 03:38:38,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:38:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-25 03:38:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 03:38:38,691 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:38,691 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:38,691 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:38,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2094593310, now seen corresponding path program 1 times [2018-01-25 03:38:38,692 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:38,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:38,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:38,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:38,694 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:38,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:38,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:38,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:38:38,820 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:38,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:38,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:38,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:38,821 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2018-01-25 03:38:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:38,940 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-01-25 03:38:38,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:38:38,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-25 03:38:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:38,946 INFO L225 Difference]: With dead ends: 80 [2018-01-25 03:38:38,947 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 03:38:38,947 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-25 03:38:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 03:38:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-01-25 03:38:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 03:38:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-25 03:38:38,958 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 33 [2018-01-25 03:38:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:38,958 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-25 03:38:38,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-25 03:38:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 03:38:38,959 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:38,960 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] [2018-01-25 03:38:38,960 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1386851478, now seen corresponding path program 1 times [2018-01-25 03:38:38,960 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:38,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:38,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:38,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:38,962 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:38,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:39,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:39,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:38:39,302 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:39,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:38:39,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:38:39,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:38:39,303 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 9 states. [2018-01-25 03:38:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:39,584 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-01-25 03:38:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:38:39,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-25 03:38:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:39,586 INFO L225 Difference]: With dead ends: 65 [2018-01-25 03:38:39,586 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 03:38:39,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:38:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 03:38:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 03:38:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 03:38:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-01-25 03:38:39,595 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 35 [2018-01-25 03:38:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:39,595 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-01-25 03:38:39,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:38:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-01-25 03:38:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 03:38:39,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:39,597 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-25 03:38:39,597 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:39,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935703, now seen corresponding path program 1 times [2018-01-25 03:38:39,597 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:39,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:39,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:39,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:39,599 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:39,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:39,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:39,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:38:39,672 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:39,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:38:39,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:38:39,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:38:39,673 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 7 states. [2018-01-25 03:38:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:39,749 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-01-25 03:38:39,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:38:39,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-25 03:38:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:39,750 INFO L225 Difference]: With dead ends: 54 [2018-01-25 03:38:39,750 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 03:38:39,751 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:38:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 03:38:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-01-25 03:38:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 03:38:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-01-25 03:38:39,758 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 39 [2018-01-25 03:38:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:39,759 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-01-25 03:38:39,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:38:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-01-25 03:38:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 03:38:39,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:39,760 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-25 03:38:39,760 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935704, now seen corresponding path program 1 times [2018-01-25 03:38:39,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:39,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:39,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:39,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:39,762 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:39,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:39,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:39,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:38:39,911 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:39,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:38:39,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:38:39,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:38:39,911 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-01-25 03:38:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:39,974 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-01-25 03:38:39,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:38:39,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-01-25 03:38:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:39,975 INFO L225 Difference]: With dead ends: 52 [2018-01-25 03:38:39,976 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 03:38:39,976 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:38:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 03:38:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 03:38:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 03:38:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-01-25 03:38:39,984 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 39 [2018-01-25 03:38:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:39,984 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-01-25 03:38:39,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:38:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-01-25 03:38:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 03:38:39,985 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:39,985 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, 1] [2018-01-25 03:38:39,985 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502653, now seen corresponding path program 1 times [2018-01-25 03:38:39,986 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:39,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:39,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:39,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:39,987 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:40,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:40,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:40,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 03:38:40,116 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:40,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 03:38:40,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 03:38:40,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:38:40,116 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 12 states. [2018-01-25 03:38:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:40,205 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-01-25 03:38:40,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:38:40,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-01-25 03:38:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:40,206 INFO L225 Difference]: With dead ends: 51 [2018-01-25 03:38:40,206 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 03:38:40,207 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:38:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 03:38:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 03:38:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 03:38:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-01-25 03:38:40,213 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 40 [2018-01-25 03:38:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:40,213 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-01-25 03:38:40,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 03:38:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-01-25 03:38:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 03:38:40,214 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:40,214 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, 1] [2018-01-25 03:38:40,214 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502652, now seen corresponding path program 1 times [2018-01-25 03:38:40,214 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:40,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:40,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:40,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:40,216 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:40,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:40,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:40,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 03:38:40,361 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:40,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 03:38:40,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 03:38:40,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:38:40,361 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 12 states. [2018-01-25 03:38:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:40,502 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-01-25 03:38:40,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:38:40,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-01-25 03:38:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:40,503 INFO L225 Difference]: With dead ends: 51 [2018-01-25 03:38:40,503 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 03:38:40,503 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:38:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 03:38:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-25 03:38:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 03:38:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-01-25 03:38:40,510 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 40 [2018-01-25 03:38:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:40,510 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-01-25 03:38:40,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 03:38:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-01-25 03:38:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 03:38:40,510 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:40,511 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, 1, 1] [2018-01-25 03:38:40,511 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash 901697635, now seen corresponding path program 1 times [2018-01-25 03:38:40,511 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:40,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:40,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:40,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:40,512 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:40,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:40,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:40,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:38:40,563 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:40,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:38:40,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:38:40,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:40,564 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2018-01-25 03:38:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:40,582 INFO L93 Difference]: Finished difference Result 55 states and 54 transitions. [2018-01-25 03:38:40,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:38:40,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-25 03:38:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:40,583 INFO L225 Difference]: With dead ends: 55 [2018-01-25 03:38:40,583 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 03:38:40,584 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-25 03:38:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 03:38:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 03:38:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 03:38:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-01-25 03:38:40,592 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 41 [2018-01-25 03:38:40,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:40,593 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-01-25 03:38:40,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:38:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-01-25 03:38:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-25 03:38:40,594 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:40,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:40,594 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 03:38:40,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1792979891, now seen corresponding path program 1 times [2018-01-25 03:38:40,594 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:40,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:40,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:40,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:40,597 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:40,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:41,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:41,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 03:38:41,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:41,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 03:38:41,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 03:38:41,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:38:41,185 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 15 states. [2018-01-25 03:38:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:41,670 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-01-25 03:38:41,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 03:38:41,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-01-25 03:38:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:41,671 INFO L225 Difference]: With dead ends: 49 [2018-01-25 03:38:41,671 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 03:38:41,671 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:38:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 03:38:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 03:38:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 03:38:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 03:38:41,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-01-25 03:38:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:41,672 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 03:38:41,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 03:38:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 03:38:41,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 03:38:41,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 03:38:42,042 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 62 DAG size of output 44 [2018-01-25 03:38:42,172 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 65 DAG size of output 47 [2018-01-25 03:38:42,239 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-25 03:38:42,239 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-25 03:38:42,239 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-25 03:38:42,239 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-25 03:38:42,239 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-25 03:38:42,239 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-25 03:38:42,239 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 03:38:42,239 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 03:38:42,239 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-25 03:38:42,240 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,240 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1476) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:38:42,240 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,240 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1476) the Hoare annotation is: true [2018-01-25 03:38:42,240 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,240 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1476) the Hoare annotation is: true [2018-01-25 03:38:42,240 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,240 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1474 1476) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-25 03:38:42,240 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1474 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,240 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1474 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,240 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1474 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L397 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (not (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)) 1)) (not (= (select |old(#valid)| |disconnect_6_#in~a.base|) 1)) (not (= 0 |disconnect_6_#in~a.offset|)) (not (= 0 (select (select |#memory_$Pointer$.offset| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|))) (< (select |#length| |disconnect_6_#in~a.base|) 4)) [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err1RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err3RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err2RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-25 03:38:42,241 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1466 1472) no Hoare annotation was computed. [2018-01-25 03:38:42,242 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-25 03:38:42,242 INFO L397 ceAbstractionStarter]: At program point L1470(line 1470) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |entry_point_~#a7~11.base|) |entry_point_~#a7~11.offset|))) (let ((.cse1 (select |old(#valid)| |entry_point_~#a7~11.base|)) (.cse2 (select |old(#valid)| .cse0))) (and (<= 4 (select |#length| |entry_point_~#a7~11.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_~#a7~11.base|) |entry_point_~#a7~11.offset|)) (= 1 (select |#valid| .cse0)) (= 0 .cse1) (= 0 |entry_point_~#a7~11.offset|) (= (store (store |#valid| .cse0 .cse2) |entry_point_~#a7~11.base| .cse1) |old(#valid)|) (= 0 .cse2) (not (= 0 .cse0)) (not (= |entry_point_~#a7~11.base| .cse0)) (= 1 (select |#valid| |entry_point_~#a7~11.base|)) (= entry_point_~ret~11 0)))) [2018-01-25 03:38:42,242 INFO L401 ceAbstractionStarter]: For program point L1469'(lines 1469 1471) no Hoare annotation was computed. [2018-01-25 03:38:42,242 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1466 1472) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-25 03:38:42,242 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-25 03:38:42,242 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1466 1472) no Hoare annotation was computed. [2018-01-25 03:38:42,243 INFO L397 ceAbstractionStarter]: At program point L1467(line 1467) the Hoare annotation is: (let ((.cse0 (@diff |old(#length)| |#length|))) (and (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (= 0 |entry_point_~#a7~11.offset|) (= 4 (select |#length| |entry_point_~#a7~11.base|)) (= (select |old(#valid)| |entry_point_~#a7~11.base|) 0) (= 1 (select |#valid| |entry_point_~#a7~11.base|)) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) [2018-01-25 03:38:42,243 INFO L401 ceAbstractionStarter]: For program point L1468(line 1468) no Hoare annotation was computed. [2018-01-25 03:38:42,243 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-25 03:38:42,243 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-25 03:38:42,243 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-25 03:38:42,243 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-25 03:38:42,243 INFO L401 ceAbstractionStarter]: For program point probe1_6Err1RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,243 INFO L397 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (= 1 (select |#valid| probe1_6_~a.base)) (= (store |#valid| probe1_6_~p~9.base 0) |old(#valid)|) (not (= 0 probe1_6_~p~9.base)) (<= (+ probe1_6_~ret~9 1) 0) (= 1 (select |#valid| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= (select |#length| probe1_6_~a.base) 4) (= probe1_6_~p~9.offset 0) (= probe1_6_~a.offset 0))) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 03:38:42,243 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-25 03:38:42,244 INFO L397 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (not (= 0 probe1_6_~p~9.base)) (= 1 (select |#valid| probe1_6_~p~9.base)) (= 0 (select |old(#valid)| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~p~9.offset 0) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 03:38:42,244 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-25 03:38:42,244 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-25 03:38:42,244 INFO L397 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 03:38:42,244 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-25 03:38:42,244 INFO L401 ceAbstractionStarter]: For program point probe1_6Err2RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,244 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-25 03:38:42,244 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-25 03:38:42,244 INFO L401 ceAbstractionStarter]: For program point probe1_6Err3RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,244 INFO L397 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: (or (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (and (= |#valid| |old(#valid)|) (= probe1_6_~a.base |probe1_6_#in~a.base|) (<= 3 probe1_6_~ret~9) (= probe1_6_~a.offset 0) (= |old(#length)| |#length|)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 03:38:42,244 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-25 03:38:42,245 INFO L397 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (not (= 0 probe1_6_~p~9.base)) (= 1 (select |#valid| probe1_6_~p~9.base)) (= 0 (select |old(#valid)| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (<= 3 probe1_6_~ret~9) (= probe1_6_~p~9.offset 0) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 03:38:42,245 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-25 03:38:42,245 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-25 03:38:42,245 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 03:38:42,245 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-25 03:38:42,248 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:506) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:277) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:107) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:488) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:219) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-25 03:38:42,250 INFO L168 Benchmark]: Toolchain (without parser) took 7126.64 ms. Allocated memory was 305.1 MB in the beginning and 556.3 MB in the end (delta: 251.1 MB). Free memory was 264.1 MB in the beginning and 379.8 MB in the end (delta: -115.7 MB). Peak memory consumption was 135.4 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:42,251 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:38:42,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.54 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 250.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:42,252 INFO L168 Benchmark]: Boogie Preprocessor took 34.67 ms. Allocated memory is still 305.1 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:42,252 INFO L168 Benchmark]: RCFGBuilder took 278.87 ms. Allocated memory is still 305.1 MB. Free memory was 248.8 MB in the beginning and 229.7 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:42,252 INFO L168 Benchmark]: TraceAbstraction took 6578.27 ms. Allocated memory was 305.1 MB in the beginning and 556.3 MB in the end (delta: 251.1 MB). Free memory was 229.7 MB in the beginning and 379.8 MB in the end (delta: -150.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:42,254 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.22 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.54 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 250.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.67 ms. Allocated memory is still 305.1 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 278.87 ms. Allocated memory is still 305.1 MB. Free memory was 248.8 MB in the beginning and 229.7 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6578.27 ms. Allocated memory was 305.1 MB in the beginning and 556.3 MB in the end (delta: 251.1 MB). Free memory was 229.7 MB in the beginning and 379.8 MB in the end (delta: -150.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1474]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:506) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-38-42-260.csv Received shutdown request...