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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:43:46,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:43:46,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:43:46,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:43:46,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:43:46,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:43:46,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:43:46,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:43:46,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:43:46,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:43:46,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:43:46,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:43:46,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:43:46,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:43:46,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:43:46,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:43:46,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:43:46,760 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:43:46,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:43:46,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:43:46,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:43:46,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:43:46,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:43:46,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:43:46,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:43:46,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:43:46,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:43:46,770 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:43:46,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:43:46,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:43:46,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:43:46,772 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:43:46,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:43:46,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:43:46,782 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:43:46,782 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:43:46,783 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:43:46,783 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:43:46,783 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:43:46,784 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:43:46,784 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:43:46,784 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:43:46,784 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:43:46,784 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:43:46,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:43:46,785 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:43:46,785 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:43:46,785 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:43:46,785 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:43:46,785 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:43:46,785 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:43:46,786 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:43:46,786 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:43:46,786 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:43:46,786 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:43:46,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:43:46,787 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:43:46,787 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:43:46,787 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:43:46,787 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:43:46,787 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:43:46,787 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:43:46,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:43:46,788 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:43:46,789 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:43:46,789 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:43:46,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:43:46,832 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:43:46,835 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:43:46,837 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:43:46,837 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:43:46,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-01-28 22:43:47,034 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:43:47,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:43:47,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:43:47,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:43:47,050 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:43:47,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:43:47" (1/1) ... [2018-01-28 22:43:47,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f5e0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47, skipping insertion in model container [2018-01-28 22:43:47,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:43:47" (1/1) ... [2018-01-28 22:43:47,071 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:43:47,120 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:43:47,230 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:43:47,248 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:43:47,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47 WrapperNode [2018-01-28 22:43:47,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:43:47,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:43:47,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:43:47,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:43:47,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47" (1/1) ... [2018-01-28 22:43:47,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47" (1/1) ... [2018-01-28 22:43:47,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47" (1/1) ... [2018-01-28 22:43:47,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47" (1/1) ... [2018-01-28 22:43:47,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47" (1/1) ... [2018-01-28 22:43:47,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47" (1/1) ... [2018-01-28 22:43:47,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47" (1/1) ... [2018-01-28 22:43:47,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:43:47,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:43:47,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:43:47,292 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:43:47,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47" (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-28 22:43:47,338 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:43:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:43:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:43:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-28 22:43:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-28 22:43:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-28 22:43:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-28 22:43:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:43:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:43:47,339 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:43:47,339 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-28 22:43:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-28 22:43:47,341 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-28 22:43:47,341 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:43:47,341 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:43:47,341 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:43:47,341 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:43:47,607 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:43:47,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:43:47 BoogieIcfgContainer [2018-01-28 22:43:47,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:43:47,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:43:47,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:43:47,612 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:43:47,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:43:47" (1/3) ... [2018-01-28 22:43:47,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f89831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:43:47, skipping insertion in model container [2018-01-28 22:43:47,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:43:47" (2/3) ... [2018-01-28 22:43:47,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f89831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:43:47, skipping insertion in model container [2018-01-28 22:43:47,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:43:47" (3/3) ... [2018-01-28 22:43:47,616 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-01-28 22:43:47,623 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:43:47,629 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-28 22:43:47,676 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:43:47,676 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:43:47,676 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:43:47,676 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:43:47,676 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:43:47,676 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:43:47,676 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:43:47,677 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:43:47,677 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:43:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-28 22:43:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 22:43:47,702 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:47,703 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 22:43:47,704 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:47,709 INFO L82 PathProgramCache]: Analyzing trace with hash 117996226, now seen corresponding path program 1 times [2018-01-28 22:43:47,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:47,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:47,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:47,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:47,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:47,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:47,859 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-28 22:43:47,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:47,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:43:47,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:43:47,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:43:47,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:43:47,882 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2018-01-28 22:43:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:48,078 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-01-28 22:43:48,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:43:48,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-28 22:43:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:48,094 INFO L225 Difference]: With dead ends: 101 [2018-01-28 22:43:48,094 INFO L226 Difference]: Without dead ends: 96 [2018-01-28 22:43:48,098 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:43:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-28 22:43:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-01-28 22:43:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 22:43:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-01-28 22:43:48,148 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 5 [2018-01-28 22:43:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:48,149 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-01-28 22:43:48,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:43:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-01-28 22:43:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 22:43:48,149 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:48,150 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 22:43:48,150 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash 117996227, now seen corresponding path program 1 times [2018-01-28 22:43:48,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:48,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:48,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:48,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:48,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:48,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:48,237 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-28 22:43:48,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:48,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:43:48,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:43:48,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:43:48,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:43:48,240 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 3 states. [2018-01-28 22:43:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:48,304 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-01-28 22:43:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:43:48,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-28 22:43:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:48,307 INFO L225 Difference]: With dead ends: 152 [2018-01-28 22:43:48,307 INFO L226 Difference]: Without dead ends: 150 [2018-01-28 22:43:48,308 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:43:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-28 22:43:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2018-01-28 22:43:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-28 22:43:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-01-28 22:43:48,324 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 5 [2018-01-28 22:43:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:48,324 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-01-28 22:43:48,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:43:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-01-28 22:43:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 22:43:48,325 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:48,325 INFO L330 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-28 22:43:48,325 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash 239661080, now seen corresponding path program 1 times [2018-01-28 22:43:48,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:48,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:48,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:48,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:48,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:48,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:48,482 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-28 22:43:48,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:48,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:43:48,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:43:48,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:43:48,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:48,484 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 6 states. [2018-01-28 22:43:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:48,857 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2018-01-28 22:43:48,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:43:48,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-28 22:43:48,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:48,859 INFO L225 Difference]: With dead ends: 158 [2018-01-28 22:43:48,859 INFO L226 Difference]: Without dead ends: 152 [2018-01-28 22:43:48,860 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:43:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-28 22:43:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-01-28 22:43:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-28 22:43:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 165 transitions. [2018-01-28 22:43:48,876 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 165 transitions. Word has length 33 [2018-01-28 22:43:48,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:48,877 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 165 transitions. [2018-01-28 22:43:48,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:43:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 165 transitions. [2018-01-28 22:43:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 22:43:48,879 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:48,879 INFO L330 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-28 22:43:48,879 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash 239661081, now seen corresponding path program 1 times [2018-01-28 22:43:48,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:48,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:48,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:48,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:48,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:48,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:48,971 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-28 22:43:48,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:48,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:43:48,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:43:48,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:43:48,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:48,973 INFO L87 Difference]: Start difference. First operand 142 states and 165 transitions. Second operand 6 states. [2018-01-28 22:43:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:49,036 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2018-01-28 22:43:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:43:49,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-28 22:43:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:49,039 INFO L225 Difference]: With dead ends: 183 [2018-01-28 22:43:49,039 INFO L226 Difference]: Without dead ends: 151 [2018-01-28 22:43:49,040 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-28 22:43:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-01-28 22:43:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-28 22:43:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2018-01-28 22:43:49,061 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 33 [2018-01-28 22:43:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:49,061 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2018-01-28 22:43:49,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:43:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2018-01-28 22:43:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 22:43:49,063 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:49,063 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:49,064 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:49,064 INFO L82 PathProgramCache]: Analyzing trace with hash 176960396, now seen corresponding path program 1 times [2018-01-28 22:43:49,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:49,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:49,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:49,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:49,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:49,169 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-28 22:43:49,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:49,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:43:49,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:43:49,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:43:49,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:49,171 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 6 states. [2018-01-28 22:43:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:49,225 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2018-01-28 22:43:49,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:43:49,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-28 22:43:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:49,228 INFO L225 Difference]: With dead ends: 156 [2018-01-28 22:43:49,228 INFO L226 Difference]: Without dead ends: 143 [2018-01-28 22:43:49,229 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-28 22:43:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-28 22:43:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-28 22:43:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-01-28 22:43:49,243 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 32 [2018-01-28 22:43:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:49,244 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-01-28 22:43:49,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:43:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-01-28 22:43:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:43:49,245 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:49,245 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:49,245 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1303163576, now seen corresponding path program 1 times [2018-01-28 22:43:49,246 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:49,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:49,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:49,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:49,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:49,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:49,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:43:49,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:43:49,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:43:49,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:43:49,325 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 5 states. [2018-01-28 22:43:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:49,363 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2018-01-28 22:43:49,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:43:49,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-28 22:43:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:49,364 INFO L225 Difference]: With dead ends: 144 [2018-01-28 22:43:49,365 INFO L226 Difference]: Without dead ends: 143 [2018-01-28 22:43:49,365 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-28 22:43:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-28 22:43:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-28 22:43:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2018-01-28 22:43:49,379 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 160 transitions. Word has length 34 [2018-01-28 22:43:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:49,380 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 160 transitions. [2018-01-28 22:43:49,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:43:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2018-01-28 22:43:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:43:49,381 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:49,382 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:49,382 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1303163577, now seen corresponding path program 1 times [2018-01-28 22:43:49,382 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:49,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:49,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:49,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:49,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:49,457 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-28 22:43:49,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:49,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:43:49,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:43:49,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:43:49,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:43:49,459 INFO L87 Difference]: Start difference. First operand 140 states and 160 transitions. Second operand 5 states. [2018-01-28 22:43:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:49,506 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-01-28 22:43:49,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:43:49,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-28 22:43:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:49,511 INFO L225 Difference]: With dead ends: 143 [2018-01-28 22:43:49,511 INFO L226 Difference]: Without dead ends: 142 [2018-01-28 22:43:49,512 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-28 22:43:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-01-28 22:43:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-28 22:43:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2018-01-28 22:43:49,527 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 34 [2018-01-28 22:43:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:49,527 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-01-28 22:43:49,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:43:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2018-01-28 22:43:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:43:49,529 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:49,529 INFO L330 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-28 22:43:49,529 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash 69584848, now seen corresponding path program 1 times [2018-01-28 22:43:49,530 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:49,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:49,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:49,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:49,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:49,609 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-28 22:43:49,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:49,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:43:49,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:43:49,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:43:49,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:49,610 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand 6 states. [2018-01-28 22:43:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:49,661 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2018-01-28 22:43:49,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:43:49,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-28 22:43:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:49,662 INFO L225 Difference]: With dead ends: 140 [2018-01-28 22:43:49,662 INFO L226 Difference]: Without dead ends: 139 [2018-01-28 22:43:49,663 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-28 22:43:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-01-28 22:43:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-28 22:43:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2018-01-28 22:43:49,672 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 35 [2018-01-28 22:43:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:49,672 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2018-01-28 22:43:49,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:43:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2018-01-28 22:43:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:43:49,673 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:49,674 INFO L330 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-28 22:43:49,674 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash 69584849, now seen corresponding path program 1 times [2018-01-28 22:43:49,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:49,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:49,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,676 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:49,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:49,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:49,756 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-28 22:43:49,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:49,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:43:49,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:43:49,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:43:49,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:49,757 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand 6 states. [2018-01-28 22:43:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:49,895 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-28 22:43:49,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:43:49,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-28 22:43:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:49,896 INFO L225 Difference]: With dead ends: 141 [2018-01-28 22:43:49,897 INFO L226 Difference]: Without dead ends: 140 [2018-01-28 22:43:49,897 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-28 22:43:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-01-28 22:43:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-28 22:43:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2018-01-28 22:43:49,907 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 35 [2018-01-28 22:43:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:49,908 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2018-01-28 22:43:49,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:43:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2018-01-28 22:43:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:43:49,909 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:49,909 INFO L330 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] [2018-01-28 22:43:49,909 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1356739710, now seen corresponding path program 1 times [2018-01-28 22:43:49,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:49,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:49,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:49,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:49,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:50,001 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-28 22:43:50,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:50,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:43:50,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:43:50,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:43:50,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:43:50,003 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand 5 states. [2018-01-28 22:43:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:50,030 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2018-01-28 22:43:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:43:50,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-28 22:43:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:50,031 INFO L225 Difference]: With dead ends: 149 [2018-01-28 22:43:50,032 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 22:43:50,032 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 22:43:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-28 22:43:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 22:43:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-28 22:43:50,039 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 42 [2018-01-28 22:43:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:50,040 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-28 22:43:50,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:43:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-28 22:43:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:43:50,041 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:50,041 INFO L330 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] [2018-01-28 22:43:50,041 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1612728474, now seen corresponding path program 1 times [2018-01-28 22:43:50,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:50,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:50,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:50,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:50,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:50,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:50,328 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-28 22:43:50,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:50,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:43:50,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:43:50,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:43:50,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:50,329 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 8 states. [2018-01-28 22:43:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:50,771 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-01-28 22:43:50,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:43:50,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-28 22:43:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:50,772 INFO L225 Difference]: With dead ends: 92 [2018-01-28 22:43:50,772 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 22:43:50,773 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:43:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 22:43:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-01-28 22:43:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 22:43:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-28 22:43:50,780 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 43 [2018-01-28 22:43:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:50,780 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-28 22:43:50,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:43:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-28 22:43:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:43:50,780 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:50,781 INFO L330 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] [2018-01-28 22:43:50,781 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:50,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1612728475, now seen corresponding path program 1 times [2018-01-28 22:43:50,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:50,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:50,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:50,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:50,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:50,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:50,923 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-28 22:43:50,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:50,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:43:50,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:43:50,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:43:50,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:43:50,924 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 7 states. [2018-01-28 22:43:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:51,160 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-01-28 22:43:51,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:43:51,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-01-28 22:43:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:51,161 INFO L225 Difference]: With dead ends: 89 [2018-01-28 22:43:51,162 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 22:43:51,162 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:43:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 22:43:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-01-28 22:43:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 22:43:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-28 22:43:51,172 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 43 [2018-01-28 22:43:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:51,172 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-28 22:43:51,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:43:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-28 22:43:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:43:51,173 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:51,173 INFO L330 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] [2018-01-28 22:43:51,173 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash -651172529, now seen corresponding path program 1 times [2018-01-28 22:43:51,174 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:51,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:51,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:51,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:51,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:51,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:51,250 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-28 22:43:51,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:51,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:43:51,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:43:51,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:43:51,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:51,251 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 6 states. [2018-01-28 22:43:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:51,292 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-01-28 22:43:51,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:43:51,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-28 22:43:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:51,293 INFO L225 Difference]: With dead ends: 96 [2018-01-28 22:43:51,293 INFO L226 Difference]: Without dead ends: 71 [2018-01-28 22:43:51,294 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-28 22:43:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-28 22:43:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-28 22:43:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-01-28 22:43:51,301 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 45 [2018-01-28 22:43:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:51,301 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-01-28 22:43:51,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:43:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-01-28 22:43:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:43:51,302 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:51,302 INFO L330 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] [2018-01-28 22:43:51,302 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:51,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1396533477, now seen corresponding path program 1 times [2018-01-28 22:43:51,303 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:51,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:51,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:51,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:51,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:51,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:51,454 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-28 22:43:51,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:51,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:43:51,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:43:51,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:43:51,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:51,455 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 8 states. [2018-01-28 22:43:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:51,660 INFO L93 Difference]: Finished difference Result 75 states and 74 transitions. [2018-01-28 22:43:51,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:43:51,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-28 22:43:51,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:51,661 INFO L225 Difference]: With dead ends: 75 [2018-01-28 22:43:51,661 INFO L226 Difference]: Without dead ends: 74 [2018-01-28 22:43:51,661 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:43:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-28 22:43:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-01-28 22:43:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-28 22:43:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-01-28 22:43:51,667 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 45 [2018-01-28 22:43:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:51,668 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-01-28 22:43:51,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:43:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-01-28 22:43:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:43:51,668 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:51,668 INFO L330 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] [2018-01-28 22:43:51,668 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1396533478, now seen corresponding path program 1 times [2018-01-28 22:43:51,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:51,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:51,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:51,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:51,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:51,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:51,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:51,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:43:51,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:43:51,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:43:51,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:43:51,835 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 10 states. [2018-01-28 22:43:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:52,109 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-01-28 22:43:52,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:43:52,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-28 22:43:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:52,110 INFO L225 Difference]: With dead ends: 70 [2018-01-28 22:43:52,110 INFO L226 Difference]: Without dead ends: 69 [2018-01-28 22:43:52,111 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:43:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-28 22:43:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-28 22:43:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-28 22:43:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-01-28 22:43:52,117 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 45 [2018-01-28 22:43:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:52,117 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-01-28 22:43:52,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:43:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-01-28 22:43:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-28 22:43:52,118 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:52,118 INFO L330 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:52,118 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:52,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1316017239, now seen corresponding path program 1 times [2018-01-28 22:43:52,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:52,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:52,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:52,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:52,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:52,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:52,429 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-28 22:43:52,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:52,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:43:52,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:43:52,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:43:52,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:52,430 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 8 states. [2018-01-28 22:43:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:52,678 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-01-28 22:43:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:43:52,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-01-28 22:43:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:52,679 INFO L225 Difference]: With dead ends: 69 [2018-01-28 22:43:52,680 INFO L226 Difference]: Without dead ends: 68 [2018-01-28 22:43:52,680 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:43:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-28 22:43:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-28 22:43:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-28 22:43:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-01-28 22:43:52,688 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 55 [2018-01-28 22:43:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:52,688 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-01-28 22:43:52,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:43:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-01-28 22:43:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:43:52,689 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:52,689 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:52,690 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:52,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2141828769, now seen corresponding path program 1 times [2018-01-28 22:43:52,690 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:52,690 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:52,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:52,691 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:52,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:52,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:52,870 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-28 22:43:52,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:52,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:43:52,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:43:52,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:43:52,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:43:52,871 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 12 states. [2018-01-28 22:43:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:53,115 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-01-28 22:43:53,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:43:53,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-28 22:43:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:53,116 INFO L225 Difference]: With dead ends: 68 [2018-01-28 22:43:53,116 INFO L226 Difference]: Without dead ends: 67 [2018-01-28 22:43:53,116 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-01-28 22:43:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-28 22:43:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-28 22:43:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-28 22:43:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-01-28 22:43:53,121 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 56 [2018-01-28 22:43:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:53,121 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-01-28 22:43:53,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:43:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-01-28 22:43:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:43:53,122 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:53,122 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:53,122 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2141828768, now seen corresponding path program 1 times [2018-01-28 22:43:53,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:53,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:53,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:53,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:53,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:53,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:53,293 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-28 22:43:53,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:53,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:43:53,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:43:53,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:43:53,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:43:53,294 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 12 states. [2018-01-28 22:43:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:53,432 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-01-28 22:43:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:43:53,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-28 22:43:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:53,433 INFO L225 Difference]: With dead ends: 67 [2018-01-28 22:43:53,433 INFO L226 Difference]: Without dead ends: 66 [2018-01-28 22:43:53,433 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:43:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-28 22:43:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-28 22:43:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-28 22:43:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-01-28 22:43:53,441 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 56 [2018-01-28 22:43:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:53,441 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-01-28 22:43:53,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:43:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-01-28 22:43:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:43:53,442 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:53,442 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:53,442 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2140494007, now seen corresponding path program 1 times [2018-01-28 22:43:53,443 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:53,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:53,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:53,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:53,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:53,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:53,495 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-28 22:43:53,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:53,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:43:53,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:43:53,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:43:53,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:43:53,496 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 5 states. [2018-01-28 22:43:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:53,525 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2018-01-28 22:43:53,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:43:53,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-28 22:43:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:53,527 INFO L225 Difference]: With dead ends: 70 [2018-01-28 22:43:53,527 INFO L226 Difference]: Without dead ends: 65 [2018-01-28 22:43:53,527 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-28 22:43:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-28 22:43:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-28 22:43:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 64 transitions. [2018-01-28 22:43:53,536 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 64 transitions. Word has length 56 [2018-01-28 22:43:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:53,536 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 64 transitions. [2018-01-28 22:43:53,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:43:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 64 transitions. [2018-01-28 22:43:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:43:53,537 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:53,537 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:53,537 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1867071438, now seen corresponding path program 1 times [2018-01-28 22:43:53,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:53,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:53,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:53,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:53,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:53,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:53,922 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-28 22:43:53,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:53,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-28 22:43:53,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 22:43:53,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 22:43:53,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:43:53,924 INFO L87 Difference]: Start difference. First operand 65 states and 64 transitions. Second operand 14 states. [2018-01-28 22:43:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:54,371 INFO L93 Difference]: Finished difference Result 65 states and 64 transitions. [2018-01-28 22:43:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:43:54,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-01-28 22:43:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:54,371 INFO L225 Difference]: With dead ends: 65 [2018-01-28 22:43:54,372 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 22:43:54,372 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2018-01-28 22:43:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 22:43:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-28 22:43:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-28 22:43:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2018-01-28 22:43:54,379 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 60 [2018-01-28 22:43:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:54,379 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2018-01-28 22:43:54,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 22:43:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2018-01-28 22:43:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-28 22:43:54,380 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:54,380 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:54,381 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:43:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2098753230, now seen corresponding path program 1 times [2018-01-28 22:43:54,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:54,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:54,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:54,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:54,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:54,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:54,667 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-28 22:43:54,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:54,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 22:43:54,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:43:54,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:43:54,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:43:54,702 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand 13 states. [2018-01-28 22:43:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:54,959 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-01-28 22:43:54,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:43:54,960 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-01-28 22:43:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:54,960 INFO L225 Difference]: With dead ends: 64 [2018-01-28 22:43:54,960 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 22:43:54,961 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-01-28 22:43:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 22:43:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 22:43:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 22:43:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 22:43:54,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-01-28 22:43:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:54,961 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 22:43:54,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:43:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 22:43:54,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 22:43:54,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 22:43:55,260 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 67 DAG size of output 51 [2018-01-28 22:43:55,557 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 76 DAG size of output 62 [2018-01-28 22:43:55,663 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 76 DAG size of output 50 [2018-01-28 22:43:55,776 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 97 DAG size of output 70 [2018-01-28 22:43:55,932 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 100 DAG size of output 73 [2018-01-28 22:43:56,004 INFO L402 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-28 22:43:56,004 INFO L399 ceAbstractionStarter]: For program point L1435(line 1435) no Hoare annotation was computed. [2018-01-28 22:43:56,004 INFO L399 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-28 22:43:56,004 INFO L399 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-28 22:43:56,004 INFO L399 ceAbstractionStarter]: For program point L1435'(line 1435) no Hoare annotation was computed. [2018-01-28 22:43:56,004 INFO L395 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (or (not (= (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4))) [2018-01-28 22:43:56,004 INFO L399 ceAbstractionStarter]: For program point L1073(line 1073) no Hoare annotation was computed. [2018-01-28 22:43:56,004 INFO L399 ceAbstractionStarter]: For program point L1073''(line 1073) no Hoare annotation was computed. [2018-01-28 22:43:56,004 INFO L399 ceAbstractionStarter]: For program point L1073'''(line 1073) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point L1073'(lines 1073 1077) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point L1076(line 1076) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point L1466'(line 1466) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initErr1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initErr0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point L1466(line 1466) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,005 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1478) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-28 22:43:56,005 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,006 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1478) the Hoare annotation is: true [2018-01-28 22:43:56,006 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,006 INFO L395 ceAbstractionStarter]: At program point L1(lines 1 1478) the Hoare annotation is: (and (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 1 (select |#valid| |~#a6.base|)) (= |~#a6.offset| 0) (= (select |#length| |~#a6.base|) 4)) [2018-01-28 22:43:56,006 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,006 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 1476 1478) the Hoare annotation is: (or (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (and (= |#valid| |old(#valid)|) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= |old(#length)| |#length|)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4))) [2018-01-28 22:43:56,006 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 1476 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,006 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 1476 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,006 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1476 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,006 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,006 INFO L395 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|))) (or (= |#valid| |old(#valid)|) (not (= 0 |~#a6.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|) 0)) (= 0 .cse0) (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) (not (= (select |#length| |~#a6.base|) 4)) (= |~#a6.base| .cse0) (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 (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#valid)| .cse0) 1)))) [2018-01-28 22:43:56,006 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err3RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err2RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point L1470'(lines 1470 1472) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point entry_pointErr1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,007 INFO L399 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1468 1474) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point L1469'(line 1469) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point L1470(lines 1470 1472) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L395 ceAbstractionStarter]: At program point L1471(line 1471) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|)) (.cse1 (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (= 1 (select |#valid| .cse1)) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (not (= 0 .cse1)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= (select |old(#valid)| .cse1) 0) (= entry_point_~ret~11 0) (= |#valid| (let ((.cse2 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse2 (select |#valid| .cse2)))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4))) [2018-01-28 22:43:56,008 INFO L395 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1468 1474) the Hoare annotation is: (or (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (and (= |#valid| |old(#valid)|) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= |old(#length)| |#length|)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4))) [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point L1469(line 1469) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point entry_pointErr0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1468 1474) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point L1469''(line 1469) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point L1439(line 1439) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-28 22:43:56,008 INFO L399 ceAbstractionStarter]: For program point L1439'(line 1439) no Hoare annotation was computed. [2018-01-28 22:43:56,009 INFO L402 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-28 22:43:56,009 INFO L399 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-28 22:43:56,009 INFO L399 ceAbstractionStarter]: For program point L1450''(line 1450) no Hoare annotation was computed. [2018-01-28 22:43:56,009 INFO L399 ceAbstractionStarter]: For program point probe1_6Err1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,009 INFO L399 ceAbstractionStarter]: For program point L1447'''(line 1447) no Hoare annotation was computed. [2018-01-28 22:43:56,009 INFO L395 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))) (not (= 0 probe1_6_~p~9.base)) (<= (+ probe1_6_~ret~9 1) 0) (= 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_~p~9.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-28 22:43:56,009 INFO L399 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-28 22:43:56,009 INFO L395 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)) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 1 (select |#valid| probe1_6_~p~9.base)) (= probe1_6_~p~9.offset 0) (= 0 (select |old(#valid)| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-28 22:43:56,009 INFO L399 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-28 22:43:56,009 INFO L399 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-28 22:43:56,009 INFO L395 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: (or (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (and (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-28 22:43:56,010 INFO L399 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-28 22:43:56,010 INFO L399 ceAbstractionStarter]: For program point probe1_6Err2RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,010 INFO L399 ceAbstractionStarter]: For program point L1450'''(line 1450) no Hoare annotation was computed. [2018-01-28 22:43:56,010 INFO L399 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-28 22:43:56,010 INFO L399 ceAbstractionStarter]: For program point L1444''(line 1444) no Hoare annotation was computed. [2018-01-28 22:43:56,010 INFO L399 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-28 22:43:56,010 INFO L399 ceAbstractionStarter]: For program point probe1_6Err3RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,010 INFO L399 ceAbstractionStarter]: For program point L1443(line 1443) no Hoare annotation was computed. [2018-01-28 22:43:56,010 INFO L395 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: (or (and (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)) (= |#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 (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-28 22:43:56,010 INFO L399 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-28 22:43:56,010 INFO L395 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)) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 1 (select |#valid| probe1_6_~p~9.base)) (= probe1_6_~p~9.offset 0) (= 0 (select |old(#valid)| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (<= 3 probe1_6_~ret~9) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-28 22:43:56,011 INFO L399 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-28 22:43:56,011 INFO L399 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-28 22:43:56,011 INFO L399 ceAbstractionStarter]: For program point probe1_6Err0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-28 22:43:56,011 INFO L399 ceAbstractionStarter]: For program point L1446(line 1446) no Hoare annotation was computed. [2018-01-28 22:43:56,011 INFO L399 ceAbstractionStarter]: For program point L1447''(line 1447) no Hoare annotation was computed. [2018-01-28 22:43:56,011 INFO L399 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-28 22:43:56,014 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:486) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) 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-28 22:43:56,017 INFO L168 Benchmark]: Toolchain (without parser) took 8982.27 ms. Allocated memory was 305.7 MB in the beginning and 587.7 MB in the end (delta: 282.1 MB). Free memory was 264.7 MB in the beginning and 540.1 MB in the end (delta: -275.4 MB). Peak memory consumption was 230.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:43:56,018 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:43:56,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.15 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 250.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:43:56,019 INFO L168 Benchmark]: Boogie Preprocessor took 34.14 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 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-28 22:43:56,019 INFO L168 Benchmark]: RCFGBuilder took 316.04 ms. Allocated memory is still 305.7 MB. Free memory was 248.8 MB in the beginning and 228.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-28 22:43:56,019 INFO L168 Benchmark]: TraceAbstraction took 8407.46 ms. Allocated memory was 305.7 MB in the beginning and 587.7 MB in the end (delta: 282.1 MB). Free memory was 228.1 MB in the beginning and 540.1 MB in the end (delta: -312.0 MB). Peak memory consumption was 194.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:43:56,022 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.12 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.15 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 250.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.14 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 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 316.04 ms. Allocated memory is still 305.7 MB. Free memory was 248.8 MB in the beginning and 228.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8407.46 ms. Allocated memory was 305.7 MB in the beginning and 587.7 MB in the end (delta: 282.1 MB). Free memory was 228.1 MB in the beginning and 540.1 MB in the end (delta: -312.0 MB). Peak memory consumption was 194.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 1476]: 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]: pointer dereference always succeeds For all program executions holds that pointer dereference 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 13 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_test6_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-43-56-030.csv Received shutdown request...