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-1cceb4a [2018-01-30 00:20:19,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:20:19,041 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:20:19,058 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:20:19,059 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:20:19,060 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:20:19,061 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:20:19,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:20:19,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:20:19,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:20:19,067 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:20:19,067 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:20:19,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:20:19,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:20:19,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:20:19,074 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:20:19,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:20:19,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:20:19,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:20:19,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:20:19,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:20:19,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:20:19,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:20:19,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:20:19,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:20:19,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:20:19,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:20:19,088 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:20:19,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:20:19,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:20:19,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:20:19,089 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-30 00:20:19,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:20:19,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:20:19,100 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:20:19,100 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:20:19,100 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:20:19,101 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:20:19,101 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:20:19,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:20:19,102 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:20:19,102 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:20:19,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:20:19,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:20:19,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:20:19,102 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:20:19,103 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:20:19,103 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:20:19,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:20:19,103 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:20:19,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:20:19,104 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:20:19,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:20:19,104 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:20:19,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:20:19,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:20:19,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:20:19,105 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:20:19,105 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:20:19,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:20:19,105 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:20:19,105 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:20:19,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:20:19,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:20:19,107 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:20:19,107 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:20:19,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:20:19,156 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:20:19,161 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:20:19,162 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:20:19,163 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:20:19,164 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-30 00:20:19,342 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:20:19,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:20:19,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:20:19,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:20:19,354 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:20:19,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:19" (1/1) ... [2018-01-30 00:20:19,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acb6c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19, skipping insertion in model container [2018-01-30 00:20:19,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:19" (1/1) ... [2018-01-30 00:20:19,378 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:20:19,432 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:20:19,547 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:20:19,564 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:20:19,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19 WrapperNode [2018-01-30 00:20:19,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:20:19,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:20:19,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:20:19,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:20:19,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19" (1/1) ... [2018-01-30 00:20:19,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19" (1/1) ... [2018-01-30 00:20:19,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19" (1/1) ... [2018-01-30 00:20:19,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19" (1/1) ... [2018-01-30 00:20:19,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19" (1/1) ... [2018-01-30 00:20:19,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19" (1/1) ... [2018-01-30 00:20:19,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19" (1/1) ... [2018-01-30 00:20:19,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:20:19,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:20:19,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:20:19,603 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:20:19,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19" (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-30 00:20:19,649 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:20:19,649 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:20:19,650 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:20:19,650 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-30 00:20:19,650 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-30 00:20:19,650 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-30 00:20:19,650 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-30 00:20:19,650 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:20:19,650 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:20:19,651 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:20:19,651 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:20:19,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:20:19,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:20:19,651 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:20:19,651 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:20:19,651 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:20:19,652 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:20:19,652 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:20:19,652 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-30 00:20:19,652 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-30 00:20:19,652 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-30 00:20:19,652 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-30 00:20:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:20:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:20:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:20:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:20:19,886 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:20:19,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:19 BoogieIcfgContainer [2018-01-30 00:20:19,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:20:19,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:20:19,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:20:19,890 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:20:19,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:20:19" (1/3) ... [2018-01-30 00:20:19,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2021de6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:19, skipping insertion in model container [2018-01-30 00:20:19,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:19" (2/3) ... [2018-01-30 00:20:19,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2021de6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:19, skipping insertion in model container [2018-01-30 00:20:19,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:19" (3/3) ... [2018-01-30 00:20:19,893 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-01-30 00:20:19,900 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:20:19,905 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-30 00:20:19,951 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:20:19,951 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:20:19,951 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:20:19,951 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:20:19,951 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:20:19,951 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:20:19,951 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:20:19,952 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:20:19,952 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:20:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-30 00:20:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 00:20:19,974 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:19,974 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 00:20:19,974 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-30 00:20:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash 117996226, now seen corresponding path program 1 times [2018-01-30 00:20:19,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:19,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:20,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:20,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:20,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:20,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:20,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:20,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:20:20,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:20:20,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:20:20,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:20:20,132 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2018-01-30 00:20:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:20,316 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-01-30 00:20:20,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:20:20,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-30 00:20:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:20,332 INFO L225 Difference]: With dead ends: 101 [2018-01-30 00:20:20,332 INFO L226 Difference]: Without dead ends: 96 [2018-01-30 00:20:20,336 INFO L553 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-30 00:20:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-30 00:20:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-01-30 00:20:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-30 00:20:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-01-30 00:20:20,386 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 5 [2018-01-30 00:20:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:20,387 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-01-30 00:20:20,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:20:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-01-30 00:20:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 00:20:20,387 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:20,388 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 00:20:20,388 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-30 00:20:20,388 INFO L82 PathProgramCache]: Analyzing trace with hash 117996227, now seen corresponding path program 1 times [2018-01-30 00:20:20,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:20,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:20,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:20,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:20,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:20,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:20,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:20,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:20:20,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:20:20,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:20:20,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:20:20,478 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 3 states. [2018-01-30 00:20:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:20,534 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-01-30 00:20:20,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:20:20,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-30 00:20:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:20,536 INFO L225 Difference]: With dead ends: 152 [2018-01-30 00:20:20,536 INFO L226 Difference]: Without dead ends: 150 [2018-01-30 00:20:20,537 INFO L553 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-30 00:20:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-30 00:20:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2018-01-30 00:20:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-30 00:20:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-01-30 00:20:20,554 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 5 [2018-01-30 00:20:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:20,554 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-01-30 00:20:20,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:20:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-01-30 00:20:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:20:20,555 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:20,555 INFO L350 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-30 00:20:20,555 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-30 00:20:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 239661080, now seen corresponding path program 1 times [2018-01-30 00:20:20,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:20,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:20,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:20,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:20,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:20,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:20,714 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-30 00:20:20,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:20,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:20,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:20,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:20,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:20,715 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 6 states. [2018-01-30 00:20:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:21,048 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2018-01-30 00:20:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:20:21,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-30 00:20:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:21,051 INFO L225 Difference]: With dead ends: 158 [2018-01-30 00:20:21,051 INFO L226 Difference]: Without dead ends: 152 [2018-01-30 00:20:21,052 INFO L553 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-30 00:20:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-30 00:20:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-01-30 00:20:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-30 00:20:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 165 transitions. [2018-01-30 00:20:21,071 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 165 transitions. Word has length 33 [2018-01-30 00:20:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:21,072 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 165 transitions. [2018-01-30 00:20:21,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 165 transitions. [2018-01-30 00:20:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:20:21,074 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:21,074 INFO L350 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-30 00:20:21,074 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-30 00:20:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash 239661081, now seen corresponding path program 1 times [2018-01-30 00:20:21,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:21,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:21,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:21,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:21,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:21,162 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-30 00:20:21,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:21,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:20:21,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:21,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:21,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:21,164 INFO L87 Difference]: Start difference. First operand 142 states and 165 transitions. Second operand 6 states. [2018-01-30 00:20:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:21,227 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2018-01-30 00:20:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:20:21,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-30 00:20:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:21,230 INFO L225 Difference]: With dead ends: 183 [2018-01-30 00:20:21,230 INFO L226 Difference]: Without dead ends: 151 [2018-01-30 00:20:21,232 INFO L553 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-30 00:20:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-30 00:20:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-01-30 00:20:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-30 00:20:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2018-01-30 00:20:21,251 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 33 [2018-01-30 00:20:21,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:21,252 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2018-01-30 00:20:21,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2018-01-30 00:20:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:20:21,253 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:21,254 INFO L350 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-30 00:20:21,254 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-30 00:20:21,254 INFO L82 PathProgramCache]: Analyzing trace with hash 176960396, now seen corresponding path program 1 times [2018-01-30 00:20:21,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:21,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:21,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:21,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:21,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:21,345 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-30 00:20:21,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:21,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:20:21,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:21,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:21,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:21,347 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 6 states. [2018-01-30 00:20:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:21,411 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2018-01-30 00:20:21,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:20:21,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-30 00:20:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:21,413 INFO L225 Difference]: With dead ends: 156 [2018-01-30 00:20:21,413 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 00:20:21,414 INFO L553 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-30 00:20:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 00:20:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-30 00:20:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-30 00:20:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-01-30 00:20:21,428 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 32 [2018-01-30 00:20:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:21,428 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-01-30 00:20:21,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-01-30 00:20:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:20:21,430 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:21,430 INFO L350 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-30 00:20:21,430 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-30 00:20:21,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1303163576, now seen corresponding path program 1 times [2018-01-30 00:20:21,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:21,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:21,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:21,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:21,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:21,498 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-30 00:20:21,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:21,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:20:21,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:20:21,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:20:21,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:20:21,499 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 5 states. [2018-01-30 00:20:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:21,557 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2018-01-30 00:20:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:20:21,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-30 00:20:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:21,559 INFO L225 Difference]: With dead ends: 144 [2018-01-30 00:20:21,559 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 00:20:21,560 INFO L553 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-30 00:20:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 00:20:21,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-30 00:20:21,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-30 00:20:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2018-01-30 00:20:21,575 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 160 transitions. Word has length 34 [2018-01-30 00:20:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:21,576 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 160 transitions. [2018-01-30 00:20:21,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:20:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2018-01-30 00:20:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:20:21,577 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:21,577 INFO L350 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-30 00:20:21,577 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-30 00:20:21,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1303163577, now seen corresponding path program 1 times [2018-01-30 00:20:21,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:21,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:21,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:21,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:21,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:21,632 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-30 00:20:21,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:21,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:20:21,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:20:21,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:20:21,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:20:21,634 INFO L87 Difference]: Start difference. First operand 140 states and 160 transitions. Second operand 5 states. [2018-01-30 00:20:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:21,723 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-01-30 00:20:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:20:21,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-30 00:20:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:21,725 INFO L225 Difference]: With dead ends: 143 [2018-01-30 00:20:21,725 INFO L226 Difference]: Without dead ends: 142 [2018-01-30 00:20:21,725 INFO L553 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-30 00:20:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-30 00:20:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-01-30 00:20:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-30 00:20:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2018-01-30 00:20:21,736 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 34 [2018-01-30 00:20:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:21,736 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-01-30 00:20:21,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:20:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2018-01-30 00:20:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:20:21,738 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:21,738 INFO L350 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-30 00:20:21,738 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-30 00:20:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash 69584848, now seen corresponding path program 1 times [2018-01-30 00:20:21,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:21,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:21,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:21,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:21,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:21,823 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-30 00:20:21,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:21,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:21,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:21,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:21,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:21,827 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand 6 states. [2018-01-30 00:20:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:21,868 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2018-01-30 00:20:21,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:20:21,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-30 00:20:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:21,870 INFO L225 Difference]: With dead ends: 140 [2018-01-30 00:20:21,871 INFO L226 Difference]: Without dead ends: 139 [2018-01-30 00:20:21,871 INFO L553 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-30 00:20:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-30 00:20:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-01-30 00:20:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-30 00:20:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2018-01-30 00:20:21,882 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 35 [2018-01-30 00:20:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:21,883 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2018-01-30 00:20:21,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2018-01-30 00:20:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:20:21,884 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:21,884 INFO L350 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-30 00:20:21,885 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-30 00:20:21,885 INFO L82 PathProgramCache]: Analyzing trace with hash 69584849, now seen corresponding path program 1 times [2018-01-30 00:20:21,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:21,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:21,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:21,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:21,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:21,947 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-30 00:20:21,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:21,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:21,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:21,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:21,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:21,948 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand 6 states. [2018-01-30 00:20:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:22,051 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-30 00:20:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:20:22,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-30 00:20:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:22,053 INFO L225 Difference]: With dead ends: 141 [2018-01-30 00:20:22,053 INFO L226 Difference]: Without dead ends: 140 [2018-01-30 00:20:22,054 INFO L553 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-30 00:20:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-30 00:20:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-01-30 00:20:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-30 00:20:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2018-01-30 00:20:22,063 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 35 [2018-01-30 00:20:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:22,063 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2018-01-30 00:20:22,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2018-01-30 00:20:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:20:22,065 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:22,065 INFO L350 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-30 00:20:22,065 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-30 00:20:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1356739710, now seen corresponding path program 1 times [2018-01-30 00:20:22,065 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:22,066 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:22,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:22,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:22,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:22,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:22,173 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-30 00:20:22,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:22,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:22,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:20:22,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:20:22,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:20:22,174 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand 5 states. [2018-01-30 00:20:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:22,200 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2018-01-30 00:20:22,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:20:22,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-30 00:20:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:22,201 INFO L225 Difference]: With dead ends: 149 [2018-01-30 00:20:22,201 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 00:20:22,202 INFO L553 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-30 00:20:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 00:20:22,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-30 00:20:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:20:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-30 00:20:22,208 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 42 [2018-01-30 00:20:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:22,209 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-30 00:20:22,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:20:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-30 00:20:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:20:22,210 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:22,211 INFO L350 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-30 00:20:22,211 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-30 00:20:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1612728474, now seen corresponding path program 1 times [2018-01-30 00:20:22,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:22,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:22,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:22,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:22,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:22,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:22,489 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-30 00:20:22,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:22,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:20:22,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:20:22,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:20:22,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:22,490 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 8 states. [2018-01-30 00:20:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:23,002 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-01-30 00:20:23,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:20:23,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-30 00:20:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:23,003 INFO L225 Difference]: With dead ends: 92 [2018-01-30 00:20:23,003 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 00:20:23,003 INFO L553 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-30 00:20:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 00:20:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-01-30 00:20:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 00:20:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-30 00:20:23,008 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 43 [2018-01-30 00:20:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:23,009 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-30 00:20:23,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:20:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-30 00:20:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:20:23,009 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:23,009 INFO L350 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-30 00:20:23,009 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-30 00:20:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1612728475, now seen corresponding path program 1 times [2018-01-30 00:20:23,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:23,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:23,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:23,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:23,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:23,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:23,158 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-30 00:20:23,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:23,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:20:23,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:20:23,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:20:23,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:20:23,159 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 7 states. [2018-01-30 00:20:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:23,362 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-01-30 00:20:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:20:23,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-01-30 00:20:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:23,363 INFO L225 Difference]: With dead ends: 89 [2018-01-30 00:20:23,363 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 00:20:23,364 INFO L553 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-30 00:20:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 00:20:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-01-30 00:20:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 00:20:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-30 00:20:23,372 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 43 [2018-01-30 00:20:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:23,373 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-30 00:20:23,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:20:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-30 00:20:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:20:23,374 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:23,374 INFO L350 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-30 00:20:23,374 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-30 00:20:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash -651172529, now seen corresponding path program 1 times [2018-01-30 00:20:23,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:23,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:23,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:23,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:23,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:23,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:23,443 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-30 00:20:23,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:23,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:20:23,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:23,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:23,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:23,444 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 6 states. [2018-01-30 00:20:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:23,478 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-01-30 00:20:23,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:20:23,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-30 00:20:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:23,479 INFO L225 Difference]: With dead ends: 96 [2018-01-30 00:20:23,480 INFO L226 Difference]: Without dead ends: 71 [2018-01-30 00:20:23,480 INFO L553 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-30 00:20:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-30 00:20:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-30 00:20:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-30 00:20:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-01-30 00:20:23,485 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 45 [2018-01-30 00:20:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:23,485 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-01-30 00:20:23,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-01-30 00:20:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:20:23,486 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:23,486 INFO L350 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-30 00:20:23,486 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-30 00:20:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1396533477, now seen corresponding path program 1 times [2018-01-30 00:20:23,487 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:23,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:23,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:23,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:23,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:23,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:23,595 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-30 00:20:23,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:23,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:20:23,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:20:23,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:20:23,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:23,597 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 8 states. [2018-01-30 00:20:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:23,772 INFO L93 Difference]: Finished difference Result 75 states and 74 transitions. [2018-01-30 00:20:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:20:23,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-30 00:20:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:23,774 INFO L225 Difference]: With dead ends: 75 [2018-01-30 00:20:23,774 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 00:20:23,774 INFO L553 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-30 00:20:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 00:20:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-01-30 00:20:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-30 00:20:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-01-30 00:20:23,782 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 45 [2018-01-30 00:20:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:23,782 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-01-30 00:20:23,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:20:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-01-30 00:20:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:20:23,783 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:23,783 INFO L350 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-30 00:20:23,783 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-30 00:20:23,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1396533478, now seen corresponding path program 1 times [2018-01-30 00:20:23,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:23,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:23,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:23,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:23,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:23,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:23,989 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-30 00:20:23,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:23,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:20:23,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:20:23,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:20:23,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:20:23,990 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 10 states. [2018-01-30 00:20:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:24,256 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-01-30 00:20:24,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:20:24,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-30 00:20:24,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:24,256 INFO L225 Difference]: With dead ends: 70 [2018-01-30 00:20:24,257 INFO L226 Difference]: Without dead ends: 69 [2018-01-30 00:20:24,257 INFO L553 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-30 00:20:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-30 00:20:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-30 00:20:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-30 00:20:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-01-30 00:20:24,264 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 45 [2018-01-30 00:20:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:24,264 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-01-30 00:20:24,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:20:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-01-30 00:20:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 00:20:24,265 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:24,265 INFO L350 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-30 00:20:24,265 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-30 00:20:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1316017239, now seen corresponding path program 1 times [2018-01-30 00:20:24,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:24,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:24,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:24,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:24,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:24,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:24,435 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-30 00:20:24,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:24,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:20:24,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:20:24,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:20:24,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:24,436 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 8 states. [2018-01-30 00:20:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:24,601 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-01-30 00:20:24,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:20:24,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-01-30 00:20:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:24,602 INFO L225 Difference]: With dead ends: 69 [2018-01-30 00:20:24,602 INFO L226 Difference]: Without dead ends: 68 [2018-01-30 00:20:24,602 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:20:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-30 00:20:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-30 00:20:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-30 00:20:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-01-30 00:20:24,608 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 55 [2018-01-30 00:20:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:24,608 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-01-30 00:20:24,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:20:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-01-30 00:20:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:20:24,609 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:24,609 INFO L350 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-30 00:20:24,609 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-30 00:20:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2141828769, now seen corresponding path program 1 times [2018-01-30 00:20:24,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:24,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:24,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:24,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:24,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:24,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:24,777 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-30 00:20:24,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:24,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:20:24,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:20:24,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:20:24,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:20:24,778 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 12 states. [2018-01-30 00:20:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:24,965 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-01-30 00:20:24,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:20:24,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-30 00:20:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:24,966 INFO L225 Difference]: With dead ends: 68 [2018-01-30 00:20:24,966 INFO L226 Difference]: Without dead ends: 67 [2018-01-30 00:20:24,967 INFO L553 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-30 00:20:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-30 00:20:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-30 00:20:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 00:20:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-01-30 00:20:24,972 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 56 [2018-01-30 00:20:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:24,973 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-01-30 00:20:24,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:20:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-01-30 00:20:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:20:24,973 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:24,973 INFO L350 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-30 00:20:24,973 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-30 00:20:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2141828768, now seen corresponding path program 1 times [2018-01-30 00:20:24,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:24,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:24,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:24,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:24,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:24,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:25,236 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-30 00:20:25,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:25,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:20:25,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:20:25,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:20:25,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:20:25,237 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 12 states. [2018-01-30 00:20:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:25,387 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-01-30 00:20:25,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:20:25,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-30 00:20:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:25,388 INFO L225 Difference]: With dead ends: 67 [2018-01-30 00:20:25,388 INFO L226 Difference]: Without dead ends: 66 [2018-01-30 00:20:25,388 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:20:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-30 00:20:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-30 00:20:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 00:20:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-01-30 00:20:25,396 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 56 [2018-01-30 00:20:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:25,397 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-01-30 00:20:25,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:20:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-01-30 00:20:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:20:25,397 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:25,398 INFO L350 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-30 00:20:25,398 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-30 00:20:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2140494007, now seen corresponding path program 1 times [2018-01-30 00:20:25,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:25,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:25,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:25,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:25,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:25,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:25,496 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-30 00:20:25,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:25,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:25,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:20:25,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:20:25,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:20:25,498 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 5 states. [2018-01-30 00:20:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:25,520 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2018-01-30 00:20:25,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:20:25,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-30 00:20:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:25,521 INFO L225 Difference]: With dead ends: 70 [2018-01-30 00:20:25,521 INFO L226 Difference]: Without dead ends: 65 [2018-01-30 00:20:25,521 INFO L553 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-30 00:20:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-30 00:20:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-30 00:20:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 00:20:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 64 transitions. [2018-01-30 00:20:25,525 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 64 transitions. Word has length 56 [2018-01-30 00:20:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:25,526 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 64 transitions. [2018-01-30 00:20:25,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:20:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 64 transitions. [2018-01-30 00:20:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 00:20:25,526 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:25,526 INFO L350 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-30 00:20:25,526 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-30 00:20:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1867071438, now seen corresponding path program 1 times [2018-01-30 00:20:25,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:25,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:25,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:25,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:25,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:25,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:26,105 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-30 00:20:26,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:26,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-30 00:20:26,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 00:20:26,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 00:20:26,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:20:26,106 INFO L87 Difference]: Start difference. First operand 65 states and 64 transitions. Second operand 14 states. [2018-01-30 00:20:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:26,487 INFO L93 Difference]: Finished difference Result 65 states and 64 transitions. [2018-01-30 00:20:26,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:20:26,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-01-30 00:20:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:26,488 INFO L225 Difference]: With dead ends: 65 [2018-01-30 00:20:26,488 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 00:20:26,489 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:20:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 00:20:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-30 00:20:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 00:20:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2018-01-30 00:20:26,495 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 60 [2018-01-30 00:20:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:26,496 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2018-01-30 00:20:26,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 00:20:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2018-01-30 00:20:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-30 00:20:26,497 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:26,497 INFO L350 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-30 00:20:26,497 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-30 00:20:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2098753230, now seen corresponding path program 1 times [2018-01-30 00:20:26,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:26,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:26,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:26,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:26,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:26,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:26,759 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-30 00:20:26,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:26,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-30 00:20:26,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:20:26,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:20:26,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:20:26,760 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand 13 states. [2018-01-30 00:20:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:27,017 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-01-30 00:20:27,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:20:27,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-01-30 00:20:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:27,018 INFO L225 Difference]: With dead ends: 64 [2018-01-30 00:20:27,018 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 00:20:27,018 INFO L553 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-30 00:20:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 00:20:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 00:20:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 00:20:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 00:20:27,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-01-30 00:20:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:27,019 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 00:20:27,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:20:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 00:20:27,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 00:20:27,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 00:20:27,288 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 66 DAG size of output 47 [2018-01-30 00:20:27,703 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 97 DAG size of output 70 [2018-01-30 00:20:27,874 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 100 DAG size of output 73 [2018-01-30 00:20:27,928 INFO L402 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-30 00:20:27,928 INFO L399 ceAbstractionStarter]: For program point L1435(line 1435) no Hoare annotation was computed. [2018-01-30 00:20:27,928 INFO L399 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-30 00:20:27,928 INFO L399 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-30 00:20:27,928 INFO L399 ceAbstractionStarter]: For program point L1435'(line 1435) no Hoare annotation was computed. [2018-01-30 00:20:27,929 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-30 00:20:27,929 INFO L399 ceAbstractionStarter]: For program point L1073(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:27,929 INFO L399 ceAbstractionStarter]: For program point L1073''(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:27,929 INFO L399 ceAbstractionStarter]: For program point L1073'''(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:27,929 INFO L399 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-30 00:20:27,929 INFO L399 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-30 00:20:27,929 INFO L399 ceAbstractionStarter]: For program point L1073'(lines 1073 1077) no Hoare annotation was computed. [2018-01-30 00:20:27,929 INFO L399 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L399 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L399 ceAbstractionStarter]: For program point L1076(line 1076) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L399 ceAbstractionStarter]: For program point L1466'(line 1466) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initErr1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initErr0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L399 ceAbstractionStarter]: For program point L1466(line 1466) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1478) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-30 00:20:27,930 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,930 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1478) the Hoare annotation is: true [2018-01-30 00:20:27,931 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,931 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-30 00:20:27,931 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,931 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-30 00:20:27,931 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 1476 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,931 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 1476 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,931 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1476 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,931 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,932 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-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err3RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err2RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point L1470'(lines 1470 1472) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point entry_pointErr1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1468 1474) no Hoare annotation was computed. [2018-01-30 00:20:27,932 INFO L399 ceAbstractionStarter]: For program point L1469'(line 1469) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point L1470(lines 1470 1472) no Hoare annotation was computed. [2018-01-30 00:20:27,933 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-30 00:20:27,933 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-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point L1469(line 1469) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point entry_pointErr0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1468 1474) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point L1469''(line 1469) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point L1439(line 1439) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point L1439'(line 1439) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L402 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-30 00:20:27,933 INFO L399 ceAbstractionStarter]: For program point L1450''(line 1450) no Hoare annotation was computed. [2018-01-30 00:20:27,934 INFO L399 ceAbstractionStarter]: For program point probe1_6Err1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,934 INFO L399 ceAbstractionStarter]: For program point L1447'''(line 1447) no Hoare annotation was computed. [2018-01-30 00:20:27,934 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-30 00:20:27,934 INFO L399 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-30 00:20:27,934 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-30 00:20:27,934 INFO L399 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-30 00:20:27,934 INFO L399 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-30 00:20:27,934 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-30 00:20:27,934 INFO L399 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-30 00:20:27,934 INFO L399 ceAbstractionStarter]: For program point probe1_6Err2RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,934 INFO L399 ceAbstractionStarter]: For program point L1450'''(line 1450) no Hoare annotation was computed. [2018-01-30 00:20:27,934 INFO L399 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point L1444''(line 1444) no Hoare annotation was computed. [2018-01-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point probe1_6Err3RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point L1443(line 1443) no Hoare annotation was computed. [2018-01-30 00:20:27,935 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-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-30 00:20:27,935 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-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point probe1_6Err0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point L1446(line 1446) no Hoare annotation was computed. [2018-01-30 00:20:27,935 INFO L399 ceAbstractionStarter]: For program point L1447''(line 1447) no Hoare annotation was computed. [2018-01-30 00:20:27,936 INFO L399 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-30 00:20:27,939 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-30 00:20:27,942 INFO L168 Benchmark]: Toolchain (without parser) took 8598.60 ms. Allocated memory was 308.3 MB in the beginning and 589.3 MB in the end (delta: 281.0 MB). Free memory was 267.3 MB in the beginning and 495.3 MB in the end (delta: -227.9 MB). Peak memory consumption was 223.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:27,943 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:20:27,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.47 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 253.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:27,943 INFO L168 Benchmark]: Boogie Preprocessor took 29.43 ms. Allocated memory is still 308.3 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:27,944 INFO L168 Benchmark]: RCFGBuilder took 283.96 ms. Allocated memory is still 308.3 MB. Free memory was 251.4 MB in the beginning and 230.7 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:27,944 INFO L168 Benchmark]: TraceAbstraction took 8053.48 ms. Allocated memory was 308.3 MB in the beginning and 589.3 MB in the end (delta: 281.0 MB). Free memory was 230.7 MB in the beginning and 495.3 MB in the end (delta: -264.6 MB). Peak memory consumption was 186.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:27,946 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.19 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.47 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 253.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.43 ms. Allocated memory is still 308.3 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 283.96 ms. Allocated memory is still 308.3 MB. Free memory was 251.4 MB in the beginning and 230.7 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8053.48 ms. Allocated memory was 308.3 MB in the beginning and 589.3 MB in the end (delta: 281.0 MB). Free memory was 230.7 MB in the beginning and 495.3 MB in the end (delta: -264.6 MB). Peak memory consumption was 186.8 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-30_00-20-27-953.csv Received shutdown request...