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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:30:48,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:30:48,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:30:48,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:30:48,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:30:48,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:30:48,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:30:48,231 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:30:48,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:30:48,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:30:48,234 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:30:48,234 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:30:48,234 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:30:48,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:30:48,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:30:48,238 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:30:48,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:30:48,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:30:48,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:30:48,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:30:48,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:30:48,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:30:48,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:30:48,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:30:48,248 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:30:48,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:30:48,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:30:48,251 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:30:48,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:30:48,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:30:48,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:30:48,252 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:30:48,262 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:30:48,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:30:48,264 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:30:48,264 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:30:48,265 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:30:48,265 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:30:48,265 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:30:48,265 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:30:48,265 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:30:48,266 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:30:48,266 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:30:48,266 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:30:48,266 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:30:48,266 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:30:48,266 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:30:48,266 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:30:48,267 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:30:48,267 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:30:48,267 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:30:48,268 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:30:48,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:30:48,268 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:30:48,268 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:30:48,268 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:30:48,268 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:30:48,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:30:48,308 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:30:48,312 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:30:48,313 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:30:48,313 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:30:48,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-02-02 09:30:48,476 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:30:48,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:30:48,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:30:48,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:30:48,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:30:48,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:30:48" (1/1) ... [2018-02-02 09:30:48,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d1e458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48, skipping insertion in model container [2018-02-02 09:30:48,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:30:48" (1/1) ... [2018-02-02 09:30:48,503 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:30:48,541 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:30:48,624 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:30:48,638 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:30:48,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48 WrapperNode [2018-02-02 09:30:48,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:30:48,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:30:48,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:30:48,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:30:48,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48" (1/1) ... [2018-02-02 09:30:48,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48" (1/1) ... [2018-02-02 09:30:48,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48" (1/1) ... [2018-02-02 09:30:48,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48" (1/1) ... [2018-02-02 09:30:48,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48" (1/1) ... [2018-02-02 09:30:48,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48" (1/1) ... [2018-02-02 09:30:48,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48" (1/1) ... [2018-02-02 09:30:48,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:30:48,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:30:48,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:30:48,675 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:30:48,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:30:48,715 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:30:48,715 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:30:48,715 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 09:30:48,716 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-02-02 09:30:48,716 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-02-02 09:30:48,716 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-02-02 09:30:48,716 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-02-02 09:30:48,716 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-02-02 09:30:48,716 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 09:30:48,716 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:30:48,716 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:30:48,716 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:30:48,716 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:30:48,716 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:30:48,716 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:30:48,716 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:30:48,716 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:30:48,717 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:30:48,717 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 09:30:48,717 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-02-02 09:30:48,717 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-02-02 09:30:48,717 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-02-02 09:30:48,717 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-02-02 09:30:48,717 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-02-02 09:30:48,717 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 09:30:48,717 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:30:48,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:30:48,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:30:48,899 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:30:48,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:30:48 BoogieIcfgContainer [2018-02-02 09:30:48,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:30:48,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:30:48,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:30:48,902 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:30:48,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:30:48" (1/3) ... [2018-02-02 09:30:48,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b258906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:30:48, skipping insertion in model container [2018-02-02 09:30:48,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:30:48" (2/3) ... [2018-02-02 09:30:48,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b258906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:30:48, skipping insertion in model container [2018-02-02 09:30:48,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:30:48" (3/3) ... [2018-02-02 09:30:48,905 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-02-02 09:30:48,911 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:30:48,915 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-02 09:30:48,940 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:30:48,940 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:30:48,940 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:30:48,940 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:30:48,940 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:30:48,940 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:30:48,940 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:30:48,940 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:30:48,941 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:30:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-02-02 09:30:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:30:48,962 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:48,963 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:48,963 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506467, now seen corresponding path program 1 times [2018-02-02 09:30:48,969 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:48,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:49,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:49,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:49,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:49,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:49,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:49,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:30:49,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:30:49,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:30:49,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:30:49,214 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-02-02 09:30:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:49,501 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-02-02 09:30:49,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:30:49,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-02 09:30:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:49,514 INFO L225 Difference]: With dead ends: 136 [2018-02-02 09:30:49,514 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 09:30:49,516 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:30:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 09:30:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-02-02 09:30:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 09:30:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-02 09:30:49,549 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-02 09:30:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:49,550 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-02 09:30:49,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:30:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-02 09:30:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:30:49,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:49,552 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:49,552 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506468, now seen corresponding path program 1 times [2018-02-02 09:30:49,552 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:49,553 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:49,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:49,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:49,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:49,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:49,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:49,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:30:49,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:30:49,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:30:49,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:30:49,645 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-02-02 09:30:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:49,890 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2018-02-02 09:30:49,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:30:49,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-02 09:30:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:49,892 INFO L225 Difference]: With dead ends: 126 [2018-02-02 09:30:49,892 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 09:30:49,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:30:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 09:30:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-02-02 09:30:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 09:30:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-02-02 09:30:49,903 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-02-02 09:30:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:49,903 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-02-02 09:30:49,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:30:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-02-02 09:30:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:30:49,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:49,904 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:49,904 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488357, now seen corresponding path program 1 times [2018-02-02 09:30:49,905 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:49,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:49,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:49,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:49,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:49,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:50,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:50,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:30:50,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:30:50,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:30:50,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:30:50,023 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-02-02 09:30:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:50,323 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2018-02-02 09:30:50,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:30:50,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 09:30:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:50,324 INFO L225 Difference]: With dead ends: 147 [2018-02-02 09:30:50,325 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 09:30:50,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:30:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 09:30:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-02-02 09:30:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 09:30:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-02-02 09:30:50,341 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-02-02 09:30:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:50,342 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-02-02 09:30:50,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:30:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-02-02 09:30:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:30:50,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:50,342 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:50,342 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488358, now seen corresponding path program 1 times [2018-02-02 09:30:50,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:50,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:50,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:50,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:50,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:50,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:50,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:50,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:30:50,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:30:50,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:30:50,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:30:50,443 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-02-02 09:30:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:50,747 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2018-02-02 09:30:50,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:30:50,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-02 09:30:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:50,748 INFO L225 Difference]: With dead ends: 149 [2018-02-02 09:30:50,748 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 09:30:50,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:30:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 09:30:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-02-02 09:30:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 09:30:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-02 09:30:50,753 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-02-02 09:30:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:50,753 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-02 09:30:50,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:30:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-02 09:30:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:30:50,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:50,754 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:50,755 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1193563309, now seen corresponding path program 1 times [2018-02-02 09:30:50,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:50,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:50,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:50,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:50,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:50,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:30:50,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:50,812 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:50,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:50,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:50,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:30:50,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:50,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:50,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:30:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:30:50,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:30:50,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-02-02 09:30:50,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:30:50,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:30:50,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:30:50,955 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-02-02 09:30:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:51,295 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-02 09:30:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:30:51,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-02 09:30:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:51,297 INFO L225 Difference]: With dead ends: 112 [2018-02-02 09:30:51,297 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 09:30:51,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:30:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 09:30:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2018-02-02 09:30:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 09:30:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-02-02 09:30:51,302 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 26 [2018-02-02 09:30:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:51,302 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-02-02 09:30:51,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:30:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-02-02 09:30:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:30:51,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:51,303 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:51,304 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443383, now seen corresponding path program 1 times [2018-02-02 09:30:51,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:51,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:51,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:51,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:51,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:51,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:51,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:51,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:30:51,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:30:51,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:30:51,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:30:51,371 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2018-02-02 09:30:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:51,465 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-02-02 09:30:51,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:30:51,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-02 09:30:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:51,467 INFO L225 Difference]: With dead ends: 101 [2018-02-02 09:30:51,467 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 09:30:51,467 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:30:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 09:30:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-02-02 09:30:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 09:30:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-02-02 09:30:51,471 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 26 [2018-02-02 09:30:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:51,471 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-02-02 09:30:51,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:30:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-02-02 09:30:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:30:51,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:51,472 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:51,472 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:51,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443382, now seen corresponding path program 1 times [2018-02-02 09:30:51,472 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:51,472 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:51,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:51,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:51,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:51,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:51,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:51,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:30:51,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:30:51,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:30:51,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:30:51,509 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 6 states. [2018-02-02 09:30:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:51,522 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-02-02 09:30:51,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:30:51,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 09:30:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:51,527 INFO L225 Difference]: With dead ends: 97 [2018-02-02 09:30:51,527 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 09:30:51,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:30:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 09:30:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-02-02 09:30:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 09:30:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-02 09:30:51,531 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 26 [2018-02-02 09:30:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:51,531 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-02 09:30:51,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:30:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-02 09:30:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:30:51,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:51,532 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:51,532 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:51,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265042, now seen corresponding path program 1 times [2018-02-02 09:30:51,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:51,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:51,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:51,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:51,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:51,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:51,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:51,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:30:51,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:30:51,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:30:51,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:30:51,621 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-02-02 09:30:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:51,831 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-02 09:30:51,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:30:51,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 09:30:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:51,832 INFO L225 Difference]: With dead ends: 112 [2018-02-02 09:30:51,832 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 09:30:51,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:30:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 09:30:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-02-02 09:30:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 09:30:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-02 09:30:51,838 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 28 [2018-02-02 09:30:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:51,839 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-02 09:30:51,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:30:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-02 09:30:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:30:51,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:51,839 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:51,839 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860499, now seen corresponding path program 1 times [2018-02-02 09:30:51,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:51,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:51,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:51,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:51,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:51,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:51,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:51,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:30:51,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:30:51,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:30:51,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:30:51,923 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 8 states. [2018-02-02 09:30:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:52,135 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-02-02 09:30:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:30:52,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-02 09:30:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:52,136 INFO L225 Difference]: With dead ends: 117 [2018-02-02 09:30:52,136 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 09:30:52,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:30:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 09:30:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-02-02 09:30:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 09:30:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-02-02 09:30:52,141 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 30 [2018-02-02 09:30:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:52,141 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-02-02 09:30:52,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:30:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-02-02 09:30:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:30:52,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:52,142 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:52,142 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860500, now seen corresponding path program 1 times [2018-02-02 09:30:52,142 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:52,142 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:52,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:52,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:52,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:52,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:52,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:52,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:30:52,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:30:52,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:30:52,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:30:52,280 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 12 states. [2018-02-02 09:30:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:52,739 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-02-02 09:30:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:30:52,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-02-02 09:30:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:52,740 INFO L225 Difference]: With dead ends: 124 [2018-02-02 09:30:52,740 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 09:30:52,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:30:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 09:30:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-02-02 09:30:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 09:30:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-02 09:30:52,748 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2018-02-02 09:30:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:52,748 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-02 09:30:52,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:30:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-02 09:30:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:30:52,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:52,749 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:52,749 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:52,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1708399928, now seen corresponding path program 1 times [2018-02-02 09:30:52,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:52,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:52,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:52,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:52,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:52,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:52,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:52,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:30:52,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:30:52,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:30:52,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:30:52,809 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 4 states. [2018-02-02 09:30:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:52,881 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-02 09:30:52,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:30:52,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-02 09:30:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:52,883 INFO L225 Difference]: With dead ends: 105 [2018-02-02 09:30:52,884 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 09:30:52,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:30:52,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 09:30:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-02-02 09:30:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 09:30:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-02-02 09:30:52,887 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 28 [2018-02-02 09:30:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:52,887 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-02-02 09:30:52,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:30:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-02-02 09:30:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:30:52,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:52,888 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:52,888 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash -526031434, now seen corresponding path program 1 times [2018-02-02 09:30:52,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:52,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:52,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:52,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:52,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:52,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:52,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:52,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:30:52,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:30:52,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:30:52,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:30:52,927 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-02-02 09:30:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:52,959 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-02-02 09:30:52,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:30:52,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 09:30:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:52,960 INFO L225 Difference]: With dead ends: 80 [2018-02-02 09:30:52,960 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 09:30:52,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:30:52,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 09:30:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 09:30:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 09:30:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-02-02 09:30:52,963 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 30 [2018-02-02 09:30:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:52,963 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-02-02 09:30:52,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:30:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-02-02 09:30:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:30:52,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:52,964 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:52,964 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash 850149805, now seen corresponding path program 1 times [2018-02-02 09:30:52,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:52,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:52,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:52,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:52,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:52,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:30:52,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:52,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:30:52,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:30:52,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:30:52,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:30:53,000 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 5 states. [2018-02-02 09:30:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:53,012 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-02-02 09:30:53,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:30:53,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-02 09:30:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:53,013 INFO L225 Difference]: With dead ends: 86 [2018-02-02 09:30:53,013 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 09:30:53,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:30:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 09:30:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-02 09:30:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 09:30:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-02 09:30:53,016 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 37 [2018-02-02 09:30:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:53,016 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-02 09:30:53,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:30:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-02 09:30:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:30:53,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:53,017 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:53,017 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653486, now seen corresponding path program 1 times [2018-02-02 09:30:53,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:53,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:53,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:53,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:53,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:53,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:30:53,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:53,195 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:53,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:53,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:53,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 09:30:53,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:30:53,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-02 09:30:53,305 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-02-02 09:30:53,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 09:30:53,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-02-02 09:30:53,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:30:53,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-02-02 09:30:53,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 09:30:53,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 09:30:53,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-02 09:30:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:30:53,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:30:53,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-02-02 09:30:53,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:30:53,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:30:53,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-02-02 09:30:53,361 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 19 states. [2018-02-02 09:30:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:53,717 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-02 09:30:53,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:30:53,717 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-02-02 09:30:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:53,718 INFO L225 Difference]: With dead ends: 83 [2018-02-02 09:30:53,718 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 09:30:53,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=4, NotChecked=56, Total=930 [2018-02-02 09:30:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 09:30:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 09:30:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 09:30:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-02-02 09:30:53,721 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2018-02-02 09:30:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:53,721 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-02-02 09:30:53,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:30:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-02-02 09:30:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:30:53,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:53,722 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:53,722 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653487, now seen corresponding path program 1 times [2018-02-02 09:30:53,723 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:53,723 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:53,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:53,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:53,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:53,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:53,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:53,933 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:53,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:53,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:53,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:30:53,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:30:53,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 09:30:53,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:30:53,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:53,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-02 09:30:54,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-02 09:30:54,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-02-02 09:30:54,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 09:30:54,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 09:30:54,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:30:54,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-02-02 09:30:54,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-02-02 09:30:54,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 09:30:54,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:54,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:54,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-02-02 09:30:54,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2018-02-02 09:30:54,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 09:30:54,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:30:54,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-02 09:30:54,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-02-02 09:30:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:54,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:54,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-02-02 09:30:54,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:30:54,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:30:54,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-02-02 09:30:54,208 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 23 states. [2018-02-02 09:30:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:54,624 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-02-02 09:30:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:30:54,624 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-02-02 09:30:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:54,625 INFO L225 Difference]: With dead ends: 103 [2018-02-02 09:30:54,625 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 09:30:54,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-02-02 09:30:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 09:30:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-02-02 09:30:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 09:30:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-02 09:30:54,627 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 37 [2018-02-02 09:30:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:54,627 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-02 09:30:54,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:30:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-02 09:30:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:30:54,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:54,628 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:54,628 INFO L371 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash 695150445, now seen corresponding path program 1 times [2018-02-02 09:30:54,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:54,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:54,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:54,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:54,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:54,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:30:54,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:54,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:30:54,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:30:54,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:30:54,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:30:54,664 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-02-02 09:30:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:54,695 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-02 09:30:54,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:30:54,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 09:30:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:54,696 INFO L225 Difference]: With dead ends: 90 [2018-02-02 09:30:54,696 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 09:30:54,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:30:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 09:30:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-02-02 09:30:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 09:30:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-02 09:30:54,698 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2018-02-02 09:30:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:54,698 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-02 09:30:54,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:30:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-02 09:30:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:30:54,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:54,699 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:54,699 INFO L371 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:54,699 INFO L82 PathProgramCache]: Analyzing trace with hash -200066512, now seen corresponding path program 1 times [2018-02-02 09:30:54,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:54,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:54,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:54,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:54,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:54,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:54,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:54,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:30:54,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:30:54,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:30:54,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:30:54,760 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-02-02 09:30:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:54,848 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-02 09:30:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:30:54,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 09:30:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:54,848 INFO L225 Difference]: With dead ends: 104 [2018-02-02 09:30:54,848 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 09:30:54,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:30:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 09:30:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-02 09:30:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 09:30:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-02-02 09:30:54,851 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 44 [2018-02-02 09:30:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:54,851 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-02-02 09:30:54,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:30:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-02-02 09:30:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:30:54,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:54,851 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:54,851 INFO L371 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:54,851 INFO L82 PathProgramCache]: Analyzing trace with hash -200066511, now seen corresponding path program 1 times [2018-02-02 09:30:54,851 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:54,852 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:54,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:54,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:54,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:54,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:30:54,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:54,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:30:54,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:30:54,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:30:54,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:30:54,897 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2018-02-02 09:30:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:54,936 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-02-02 09:30:54,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:30:54,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 09:30:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:54,937 INFO L225 Difference]: With dead ends: 94 [2018-02-02 09:30:54,937 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 09:30:54,937 INFO L554 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-02-02 09:30:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 09:30:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 09:30:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 09:30:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-02-02 09:30:54,940 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 44 [2018-02-02 09:30:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:54,940 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-02-02 09:30:54,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:30:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-02-02 09:30:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:30:54,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:54,941 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:54,941 INFO L371 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash -705625136, now seen corresponding path program 1 times [2018-02-02 09:30:54,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:54,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:54,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:54,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:54,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:54,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:30:54,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:54,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:30:54,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:30:54,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:30:54,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:30:54,976 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 5 states. [2018-02-02 09:30:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:54,994 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-02 09:30:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:30:54,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-02-02 09:30:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:54,995 INFO L225 Difference]: With dead ends: 92 [2018-02-02 09:30:54,995 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 09:30:54,995 INFO L554 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-02-02 09:30:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 09:30:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-02-02 09:30:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 09:30:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-02 09:30:54,998 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-02-02 09:30:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:54,998 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-02 09:30:54,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:30:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-02 09:30:54,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:30:54,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:54,999 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:54,999 INFO L371 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:54,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018930, now seen corresponding path program 1 times [2018-02-02 09:30:54,999 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:54,999 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:55,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:55,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:55,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:55,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:30:55,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:55,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:30:55,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:30:55,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:30:55,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:30:55,058 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-02-02 09:30:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:55,166 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-02 09:30:55,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:30:55,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-02 09:30:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:55,167 INFO L225 Difference]: With dead ends: 96 [2018-02-02 09:30:55,167 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 09:30:55,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:30:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 09:30:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-02-02 09:30:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 09:30:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-02-02 09:30:55,170 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 46 [2018-02-02 09:30:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:55,170 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-02-02 09:30:55,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:30:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-02-02 09:30:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:30:55,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:55,171 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:55,171 INFO L371 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018931, now seen corresponding path program 1 times [2018-02-02 09:30:55,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:55,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:55,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:55,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:55,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:55,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:30:55,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:55,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:30:55,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:30:55,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:30:55,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:30:55,289 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-02-02 09:30:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:55,409 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-02 09:30:55,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:30:55,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-02-02 09:30:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:55,410 INFO L225 Difference]: With dead ends: 96 [2018-02-02 09:30:55,411 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 09:30:55,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:30:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 09:30:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-02 09:30:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 09:30:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-02-02 09:30:55,418 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2018-02-02 09:30:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:55,418 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-02-02 09:30:55,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:30:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-02-02 09:30:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:30:55,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:55,419 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:55,419 INFO L371 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:55,419 INFO L82 PathProgramCache]: Analyzing trace with hash 529881151, now seen corresponding path program 1 times [2018-02-02 09:30:55,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:55,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:55,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:55,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:55,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:55,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:30:55,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:55,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:30:55,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:30:55,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:30:55,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:30:55,511 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 11 states. [2018-02-02 09:30:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:55,708 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-02 09:30:55,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:30:55,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 09:30:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:55,709 INFO L225 Difference]: With dead ends: 97 [2018-02-02 09:30:55,709 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 09:30:55,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:30:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 09:30:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-02-02 09:30:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 09:30:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-02-02 09:30:55,711 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 47 [2018-02-02 09:30:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:55,711 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-02-02 09:30:55,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:30:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-02-02 09:30:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:30:55,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:55,711 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:55,712 INFO L371 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash 529881150, now seen corresponding path program 1 times [2018-02-02 09:30:55,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:55,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:55,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:55,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:55,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:55,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:30:55,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:55,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:30:55,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:30:55,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:30:55,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:30:55,896 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 11 states. [2018-02-02 09:30:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:56,082 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-02 09:30:56,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:30:56,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 09:30:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:56,083 INFO L225 Difference]: With dead ends: 94 [2018-02-02 09:30:56,083 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 09:30:56,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:30:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 09:30:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 09:30:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 09:30:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-02 09:30:56,088 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 47 [2018-02-02 09:30:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:56,088 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-02 09:30:56,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:30:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-02 09:30:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:30:56,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:56,089 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:56,089 INFO L371 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:56,090 INFO L82 PathProgramCache]: Analyzing trace with hash 365897592, now seen corresponding path program 1 times [2018-02-02 09:30:56,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:56,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:56,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:56,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:56,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:56,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:56,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:56,474 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:56,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:56,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:30:56,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:30:56,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2018-02-02 09:30:56,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 09:30:56,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 09:30:56,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:30:56,690 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 25 states. [2018-02-02 09:30:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:57,645 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-02-02 09:30:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:30:57,645 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-02-02 09:30:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:57,645 INFO L225 Difference]: With dead ends: 116 [2018-02-02 09:30:57,646 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 09:30:57,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=2057, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 09:30:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 09:30:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-02-02 09:30:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 09:30:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-02-02 09:30:57,648 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 46 [2018-02-02 09:30:57,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:57,648 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-02-02 09:30:57,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 09:30:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-02-02 09:30:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 09:30:57,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:57,649 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:57,649 INFO L371 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:57,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1831313542, now seen corresponding path program 1 times [2018-02-02 09:30:57,649 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:57,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:57,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:57,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:57,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:57,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:57,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:57,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 09:30:57,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:30:57,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:30:57,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:30:57,800 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 15 states. [2018-02-02 09:30:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:58,246 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-02-02 09:30:58,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:30:58,247 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-02-02 09:30:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:58,248 INFO L225 Difference]: With dead ends: 106 [2018-02-02 09:30:58,248 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 09:30:58,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:30:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 09:30:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-02-02 09:30:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 09:30:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-02 09:30:58,251 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 50 [2018-02-02 09:30:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:58,252 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-02 09:30:58,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:30:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-02 09:30:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 09:30:58,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:58,253 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:58,253 INFO L371 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:58,253 INFO L82 PathProgramCache]: Analyzing trace with hash -522729561, now seen corresponding path program 1 times [2018-02-02 09:30:58,253 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:58,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:58,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:58,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:58,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:58,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:30:58,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:58,575 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:58,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:58,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:58,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 09:30:58,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:30:58,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:58,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:58,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:58,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-02-02 09:30:58,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-02 09:30:58,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:58,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2018-02-02 09:30:58,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:58,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:58,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:58,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-02-02 09:30:58,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-02-02 09:30:58,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-02-02 09:30:58,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:58,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:58,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:58,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-02-02 09:30:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:30:58,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:58,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-02-02 09:30:58,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:30:58,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:30:58,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=644, Unknown=21, NotChecked=0, Total=756 [2018-02-02 09:30:58,933 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 28 states. [2018-02-02 09:30:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:59,523 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-02 09:30:59,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:30:59,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-02-02 09:30:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:59,523 INFO L225 Difference]: With dead ends: 111 [2018-02-02 09:30:59,523 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 09:30:59,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=1357, Unknown=26, NotChecked=0, Total=1560 [2018-02-02 09:30:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 09:30:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-02 09:30:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 09:30:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-02 09:30:59,525 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 48 [2018-02-02 09:30:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:59,526 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-02 09:30:59,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:30:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-02 09:30:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 09:30:59,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:59,526 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:59,526 INFO L371 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:59,526 INFO L82 PathProgramCache]: Analyzing trace with hash 680328992, now seen corresponding path program 1 times [2018-02-02 09:30:59,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:59,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:59,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:59,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:59,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:59,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:59,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:59,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:30:59,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:30:59,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:30:59,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:30:59,660 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 13 states. [2018-02-02 09:30:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:59,882 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-02-02 09:30:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:30:59,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-02-02 09:30:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:59,883 INFO L225 Difference]: With dead ends: 87 [2018-02-02 09:30:59,883 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 09:30:59,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:30:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 09:30:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-02 09:30:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 09:30:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-02-02 09:30:59,885 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 51 [2018-02-02 09:30:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:59,885 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-02-02 09:30:59,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:30:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-02-02 09:30:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 09:30:59,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:59,886 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:59,886 INFO L371 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:30:59,886 INFO L82 PathProgramCache]: Analyzing trace with hash -936145011, now seen corresponding path program 1 times [2018-02-02 09:30:59,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:59,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:59,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:59,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:59,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:59,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 09:31:00,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:00,186 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:31:00,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:00,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:00,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 09:31:00,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:31:00,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:00,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:00,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:00,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-02-02 09:31:00,314 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-02-02 09:31:00,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 09:31:00,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-02-02 09:31:00,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:00,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:00,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:00,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-02-02 09:31:00,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 09:31:00,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 09:31:00,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:00,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:00,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:00,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-02 09:31:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:31:00,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:31:00,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-02-02 09:31:00,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 09:31:00,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 09:31:00,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-02-02 09:31:00,436 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 31 states. [2018-02-02 09:31:02,962 WARN L143 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-02 09:31:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:03,245 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-02 09:31:03,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:31:03,245 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-02-02 09:31:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:03,245 INFO L225 Difference]: With dead ends: 92 [2018-02-02 09:31:03,245 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 09:31:03,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-02-02 09:31:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 09:31:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-02 09:31:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 09:31:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-02 09:31:03,248 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 51 [2018-02-02 09:31:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:03,248 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-02 09:31:03,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 09:31:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-02 09:31:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 09:31:03,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:03,248 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:03,248 INFO L371 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:31:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash -936145010, now seen corresponding path program 1 times [2018-02-02 09:31:03,248 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:03,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:03,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:03,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:03,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:03,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:03,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:03,926 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:31:03,934 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:03,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:03,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:31:03,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:03,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:03,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:31:04,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 09:31:04,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:31:04,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:04,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:04,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:04,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-02 09:31:04,090 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret2.base| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) f19_~a.offset |f19_#t~ret2.base|))) (= |c_#valid| (store |c_old(#valid)| |f19_#t~ret2.base| 1)))) is different from true [2018-02-02 09:31:04,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-02 09:31:04,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:04,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-02 09:31:04,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-02-02 09:31:04,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 09:31:04,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:04,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:04,121 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-02-02 09:31:04,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-02 09:31:04,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-02-02 09:31:04,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:04,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:04,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:04,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-02 09:31:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:04,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:31:04,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-02-02 09:31:04,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 09:31:04,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 09:31:04,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-02-02 09:31:04,304 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 37 states. [2018-02-02 09:31:09,223 WARN L146 SmtUtils]: Spent 4049ms on a formula simplification. DAG size of input: 46 DAG size of output 43 [2018-02-02 09:31:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:09,551 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-02 09:31:09,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:31:09,551 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2018-02-02 09:31:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:09,552 INFO L225 Difference]: With dead ends: 94 [2018-02-02 09:31:09,552 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 09:31:09,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-02-02 09:31:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 09:31:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-02-02 09:31:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 09:31:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-02 09:31:09,555 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 51 [2018-02-02 09:31:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:09,555 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-02 09:31:09,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 09:31:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-02 09:31:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:31:09,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:09,556 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:09,556 INFO L371 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:31:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash -384637660, now seen corresponding path program 1 times [2018-02-02 09:31:09,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:09,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:09,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:09,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:09,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:09,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:09,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:09,957 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:31:09,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:09,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:09,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:31:09,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:09,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:09,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:31:10,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 09:31:10,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:31:10,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:10,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:10,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:10,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-02 09:31:10,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:10,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:10,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-02-02 09:31:10,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:10,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-02 09:31:10,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:10,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-02 09:31:10,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:10,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:10,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:10,139 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-02-02 09:31:10,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-02-02 09:31:10,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:10,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:10,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-02-02 09:31:14,365 WARN L143 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-02 09:31:14,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:14,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2018-02-02 09:31:14,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:14,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:14,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-02-02 09:31:14,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-02-02 09:31:14,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:14,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:14,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-02-02 09:31:14,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:14,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:14,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:14,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-02-02 09:31:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:14,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:31:14,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-02-02 09:31:14,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 09:31:14,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 09:31:14,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-02-02 09:31:14,529 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 36 states. [2018-02-02 09:31:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:17,396 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-02 09:31:17,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 09:31:17,396 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2018-02-02 09:31:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:17,396 INFO L225 Difference]: With dead ends: 93 [2018-02-02 09:31:17,397 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 09:31:17,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-02-02 09:31:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 09:31:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-02-02 09:31:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 09:31:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-02 09:31:17,399 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 52 [2018-02-02 09:31:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:17,399 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-02 09:31:17,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 09:31:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-02 09:31:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:31:17,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:17,400 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:17,400 INFO L371 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:31:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1081279336, now seen corresponding path program 1 times [2018-02-02 09:31:17,400 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:17,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:17,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:17,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:17,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:17,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:31:17,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:17,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:31:17,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:31:17,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:31:17,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:31:17,428 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 5 states. [2018-02-02 09:31:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:17,434 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-02-02 09:31:17,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:31:17,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-02 09:31:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:17,435 INFO L225 Difference]: With dead ends: 96 [2018-02-02 09:31:17,435 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 09:31:17,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:31:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 09:31:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-02-02 09:31:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 09:31:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-02-02 09:31:17,437 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 52 [2018-02-02 09:31:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:17,437 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-02-02 09:31:17,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:31:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-02-02 09:31:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 09:31:17,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:17,437 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:17,437 INFO L371 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:31:17,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562575, now seen corresponding path program 1 times [2018-02-02 09:31:17,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:17,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:17,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:17,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:17,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:17,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:17,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:17,922 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:31:17,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:17,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:17,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:31:17,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:17,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:17,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:31:18,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 09:31:18,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:31:18,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:18,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:18,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:18,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-02-02 09:31:18,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-02 09:31:18,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:18,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-02 09:31:18,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:18,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:18,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:18,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-02-02 09:31:18,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-02-02 09:31:18,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:18,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:18,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-02 09:31:22,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:22,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:22,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-02-02 09:31:22,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:22,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:22,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-02-02 09:31:22,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-02-02 09:31:22,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-02-02 09:31:22,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:22,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:22,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:22,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-02-02 09:31:22,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:22,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-02 09:31:22,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:22,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:22,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-02 09:31:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:23,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:31:23,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-02-02 09:31:23,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 09:31:23,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 09:31:23,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1375, Unknown=5, NotChecked=0, Total=1482 [2018-02-02 09:31:23,005 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 39 states. [2018-02-02 09:31:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:42,550 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-02-02 09:31:42,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 09:31:42,550 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 55 [2018-02-02 09:31:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:42,551 INFO L225 Difference]: With dead ends: 100 [2018-02-02 09:31:42,551 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 09:31:42,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=345, Invalid=4205, Unknown=6, NotChecked=0, Total=4556 [2018-02-02 09:31:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 09:31:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-02-02 09:31:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 09:31:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-02-02 09:31:42,554 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 55 [2018-02-02 09:31:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:42,554 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-02-02 09:31:42,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 09:31:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-02-02 09:31:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 09:31:42,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:42,583 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:42,583 INFO L371 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:31:42,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562576, now seen corresponding path program 1 times [2018-02-02 09:31:42,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:42,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:42,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:42,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:42,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:42,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:31:42,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:42,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:31:42,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:31:42,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:31:42,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:31:42,638 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 8 states. [2018-02-02 09:31:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:42,679 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-02 09:31:42,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:31:42,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-02 09:31:42,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:42,680 INFO L225 Difference]: With dead ends: 95 [2018-02-02 09:31:42,680 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 09:31:42,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:31:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 09:31:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 09:31:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 09:31:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-02 09:31:42,682 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 55 [2018-02-02 09:31:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:42,682 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-02 09:31:42,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:31:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-02 09:31:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 09:31:42,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:42,683 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:42,683 INFO L371 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:31:42,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799554, now seen corresponding path program 1 times [2018-02-02 09:31:42,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:42,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:42,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:42,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:42,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:42,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:43,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:43,328 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:31:43,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:43,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:43,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:31:43,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-02-02 09:31:43,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 09:31:43,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:31:43,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-02-02 09:31:43,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:43,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:43,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-02-02 09:31:43,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-02-02 09:31:43,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:43,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-02-02 09:31:43,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,661 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:45 [2018-02-02 09:31:43,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:43,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-02-02 09:31:43,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:43,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:34 [2018-02-02 09:31:44,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-02-02 09:31:44,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:44,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-02-02 09:31:44,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:44,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:44,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:44,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2018-02-02 09:31:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:44,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:31:44,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 44 [2018-02-02 09:31:44,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 09:31:44,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 09:31:44,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1839, Unknown=8, NotChecked=0, Total=1980 [2018-02-02 09:31:44,068 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 45 states. [2018-02-02 09:31:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:45,027 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-02 09:31:45,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 09:31:45,027 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2018-02-02 09:31:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:45,027 INFO L225 Difference]: With dead ends: 97 [2018-02-02 09:31:45,028 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 09:31:45,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=285, Invalid=3613, Unknown=8, NotChecked=0, Total=3906 [2018-02-02 09:31:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 09:31:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-02-02 09:31:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 09:31:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-02-02 09:31:45,030 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 56 [2018-02-02 09:31:45,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:45,030 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-02-02 09:31:45,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 09:31:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-02-02 09:31:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 09:31:45,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:45,031 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:45,031 INFO L371 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:31:45,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799553, now seen corresponding path program 1 times [2018-02-02 09:31:45,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:45,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:45,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:45,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:45,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:45,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:31:45,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:45,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 09:31:45,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:31:45,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:31:45,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:31:45,130 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 15 states. [2018-02-02 09:31:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:45,393 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-02 09:31:45,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:31:45,394 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-02 09:31:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:45,394 INFO L225 Difference]: With dead ends: 95 [2018-02-02 09:31:45,394 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 09:31:45,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:31:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 09:31:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 09:31:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 09:31:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-02 09:31:45,397 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 56 [2018-02-02 09:31:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:45,397 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-02 09:31:45,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:31:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-02 09:31:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 09:31:45,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:45,398 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:45,398 INFO L371 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:31:45,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1384633629, now seen corresponding path program 1 times [2018-02-02 09:31:45,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:45,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:45,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:45,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:45,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:45,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:31:45,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:45,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:31:45,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:31:45,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:31:45,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:31:45,441 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 6 states. [2018-02-02 09:31:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:45,476 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-02-02 09:31:45,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:31:45,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-02 09:31:45,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:45,477 INFO L225 Difference]: With dead ends: 86 [2018-02-02 09:31:45,477 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 09:31:45,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:31:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 09:31:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-02-02 09:31:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 09:31:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-02-02 09:31:45,479 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 61 [2018-02-02 09:31:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:45,479 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-02-02 09:31:45,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:31:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-02-02 09:31:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 09:31:45,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:45,480 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:45,480 INFO L371 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-02 09:31:45,480 INFO L82 PathProgramCache]: Analyzing trace with hash 843947090, now seen corresponding path program 1 times [2018-02-02 09:31:45,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:45,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:45,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:45,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:45,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:45,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:31:46,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:46,564 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:31:46,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:46,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:46,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 09:31:46,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:31:46,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:46,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:46,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:46,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:45 [2018-02-02 09:31:46,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:46,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-02-02 09:31:46,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:46,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:31:46,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 59 [2018-02-02 09:31:46,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:46,896 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:31:46,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:31:46,906 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:86 [2018-02-02 09:31:46,908 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 219172 column 39: unknown constant v_DerPreprocessor_1 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:95) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:105) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:297) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:239) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:198) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:1002) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:946) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:573) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) 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-02-02 09:31:46,911 INFO L168 Benchmark]: Toolchain (without parser) took 58434.31 ms. Allocated memory was 405.3 MB in the beginning and 906.0 MB in the end (delta: 500.7 MB). Free memory was 361.9 MB in the beginning and 460.5 MB in the end (delta: -98.5 MB). Peak memory consumption was 402.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:31:46,912 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:31:46,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.22 ms. Allocated memory is still 405.3 MB. Free memory was 361.9 MB in the beginning and 348.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:31:46,912 INFO L168 Benchmark]: Boogie Preprocessor took 28.88 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:31:46,912 INFO L168 Benchmark]: RCFGBuilder took 225.17 ms. Allocated memory is still 405.3 MB. Free memory was 347.4 MB in the beginning and 320.8 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:31:46,913 INFO L168 Benchmark]: TraceAbstraction took 58009.77 ms. Allocated memory was 405.3 MB in the beginning and 906.0 MB in the end (delta: 500.7 MB). Free memory was 320.8 MB in the beginning and 460.5 MB in the end (delta: -139.7 MB). Peak memory consumption was 361.0 MB. Max. memory is 5.3 GB. [2018-02-02 09:31:46,914 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.22 ms. Allocated memory is still 405.3 MB. Free memory was 361.9 MB in the beginning and 348.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.88 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 225.17 ms. Allocated memory is still 405.3 MB. Free memory was 347.4 MB in the beginning and 320.8 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58009.77 ms. Allocated memory was 405.3 MB in the beginning and 906.0 MB in the end (delta: 500.7 MB). Free memory was 320.8 MB in the beginning and 460.5 MB in the end (delta: -139.7 MB). Peak memory consumption was 361.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 219172 column 39: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 219172 column 39: unknown constant v_DerPreprocessor_1: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-31-46-920.csv Received shutdown request...