java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:53:55,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:53:55,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:53:55,672 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:53:55,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:53:55,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:53:55,674 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:53:55,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:53:55,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:53:55,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:53:55,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:53:55,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:53:55,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:53:55,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:53:55,698 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:53:55,701 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:53:55,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:53:55,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:53:55,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:53:55,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:53:55,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:53:55,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:53:55,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:53:55,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:53:55,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:53:55,723 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:53:55,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:53:55,724 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:53:55,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:53:55,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:53:55,725 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:53:55,725 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:53:55,743 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:53:55,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:53:55,745 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:53:55,745 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:53:55,745 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:53:55,745 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:53:55,745 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:53:55,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:53:55,746 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:53:55,746 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:53:55,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:53:55,747 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:53:55,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:53:55,747 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:53:55,747 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:53:55,748 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:53:55,748 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:53:55,748 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:53:55,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:53:55,748 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:53:55,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:53:55,749 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:53:55,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:53:55,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:53:55,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:53:55,749 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:53:55,750 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:53:55,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:53:55,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:53:55,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:53:55,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:53:55,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:53:55,752 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:53:55,753 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:53:55,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:53:55,813 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:53:55,817 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:53:55,819 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:53:55,821 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:53:55,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-31 08:53:56,051 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:53:56,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:53:56,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:53:56,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:53:56,071 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:53:56,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:53:56" (1/1) ... [2018-01-31 08:53:56,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2403e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56, skipping insertion in model container [2018-01-31 08:53:56,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:53:56" (1/1) ... [2018-01-31 08:53:56,096 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:53:56,175 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:53:56,345 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:53:56,369 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:53:56,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56 WrapperNode [2018-01-31 08:53:56,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:53:56,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:53:56,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:53:56,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:53:56,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56" (1/1) ... [2018-01-31 08:53:56,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56" (1/1) ... [2018-01-31 08:53:56,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56" (1/1) ... [2018-01-31 08:53:56,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56" (1/1) ... [2018-01-31 08:53:56,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56" (1/1) ... [2018-01-31 08:53:56,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56" (1/1) ... [2018-01-31 08:53:56,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56" (1/1) ... [2018-01-31 08:53:56,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:53:56,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:53:56,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:53:56,444 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:53:56,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:53:56,513 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:53:56,513 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:53:56,513 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:53:56,513 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-31 08:53:56,513 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-31 08:53:56,513 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-31 08:53:56,513 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-01-31 08:53:56,513 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-31 08:53:56,513 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:53:56,514 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:53:56,514 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:53:56,514 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:53:56,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:53:56,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:53:56,514 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:53:56,515 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:53:56,515 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:53:56,515 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:53:56,515 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:53:56,515 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-31 08:53:56,515 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-31 08:53:56,515 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-31 08:53:56,516 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-01-31 08:53:56,516 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-31 08:53:56,516 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:53:56,516 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:53:56,516 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:53:56,516 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:53:57,139 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:53:57,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:53:57 BoogieIcfgContainer [2018-01-31 08:53:57,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:53:57,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:53:57,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:53:57,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:53:57,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:53:56" (1/3) ... [2018-01-31 08:53:57,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1e6fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:53:57, skipping insertion in model container [2018-01-31 08:53:57,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:53:56" (2/3) ... [2018-01-31 08:53:57,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1e6fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:53:57, skipping insertion in model container [2018-01-31 08:53:57,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:53:57" (3/3) ... [2018-01-31 08:53:57,149 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-31 08:53:57,159 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:53:57,170 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-31 08:53:57,233 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:53:57,233 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:53:57,234 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:53:57,234 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:53:57,234 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:53:57,234 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:53:57,234 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:53:57,234 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:53:57,235 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:53:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-01-31 08:53:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:53:57,269 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:57,273 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] [2018-01-31 08:53:57,273 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-01-31 08:53:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1450049695, now seen corresponding path program 1 times [2018-01-31 08:53:57,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:57,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:57,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:57,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:57,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:57,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:53:57,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:53:57,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:53:57,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:53:57,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:53:57,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:53:57,756 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 6 states. [2018-01-31 08:53:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:58,605 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-01-31 08:53:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:53:58,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-31 08:53:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:58,621 INFO L225 Difference]: With dead ends: 181 [2018-01-31 08:53:58,621 INFO L226 Difference]: Without dead ends: 175 [2018-01-31 08:53:58,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:53:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-31 08:53:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 125. [2018-01-31 08:53:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-31 08:53:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2018-01-31 08:53:58,685 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 20 [2018-01-31 08:53:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:58,685 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2018-01-31 08:53:58,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:53:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2018-01-31 08:53:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:53:58,688 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:58,689 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] [2018-01-31 08:53:58,689 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-01-31 08:53:58,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1450049696, now seen corresponding path program 1 times [2018-01-31 08:53:58,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:58,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:58,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:58,691 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:58,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:58,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:53:58,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:53:58,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:53:58,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:53:58,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:53:58,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:53:58,890 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 6 states. [2018-01-31 08:53:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:59,285 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2018-01-31 08:53:59,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:53:59,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-31 08:53:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:59,290 INFO L225 Difference]: With dead ends: 167 [2018-01-31 08:53:59,290 INFO L226 Difference]: Without dead ends: 164 [2018-01-31 08:53:59,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:53:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-31 08:53:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 142. [2018-01-31 08:53:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-31 08:53:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 165 transitions. [2018-01-31 08:53:59,313 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 165 transitions. Word has length 20 [2018-01-31 08:53:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:59,314 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 165 transitions. [2018-01-31 08:53:59,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:53:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 165 transitions. [2018-01-31 08:53:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:53:59,315 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:59,315 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] [2018-01-31 08:53:59,315 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-01-31 08:53:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1666557696, now seen corresponding path program 1 times [2018-01-31 08:53:59,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:59,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:59,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:59,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:59,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:59,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:53:59,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:53:59,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:53:59,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:53:59,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:53:59,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:53:59,513 INFO L87 Difference]: Start difference. First operand 142 states and 165 transitions. Second operand 8 states. [2018-01-31 08:53:59,722 WARN L143 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:54:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:00,480 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2018-01-31 08:54:00,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:54:00,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-31 08:54:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:00,483 INFO L225 Difference]: With dead ends: 195 [2018-01-31 08:54:00,483 INFO L226 Difference]: Without dead ends: 193 [2018-01-31 08:54:00,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:54:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-31 08:54:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 137. [2018-01-31 08:54:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-31 08:54:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2018-01-31 08:54:00,505 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 21 [2018-01-31 08:54:00,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:00,505 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2018-01-31 08:54:00,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:54:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2018-01-31 08:54:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:54:00,506 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:00,506 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] [2018-01-31 08:54:00,506 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-01-31 08:54:00,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1666557695, now seen corresponding path program 1 times [2018-01-31 08:54:00,507 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:00,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:00,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:00,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:00,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:00,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:00,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:00,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:54:00,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:54:00,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:54:00,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:54:00,728 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 9 states. [2018-01-31 08:54:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:01,553 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2018-01-31 08:54:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:54:01,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-31 08:54:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:01,556 INFO L225 Difference]: With dead ends: 200 [2018-01-31 08:54:01,556 INFO L226 Difference]: Without dead ends: 197 [2018-01-31 08:54:01,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:54:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-31 08:54:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 104. [2018-01-31 08:54:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 08:54:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-01-31 08:54:01,575 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 21 [2018-01-31 08:54:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:01,575 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-01-31 08:54:01,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:54:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-01-31 08:54:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:54:01,577 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:01,577 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:01,577 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-01-31 08:54:01,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1931784256, now seen corresponding path program 1 times [2018-01-31 08:54:01,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:01,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:01,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:01,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:01,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:01,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:01,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:01,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:54:01,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:54:01,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:54:01,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:54:01,694 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 8 states. [2018-01-31 08:54:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:01,932 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-01-31 08:54:01,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:54:01,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-31 08:54:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:01,934 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:54:01,934 INFO L226 Difference]: Without dead ends: 119 [2018-01-31 08:54:01,934 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-01-31 08:54:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-31 08:54:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-01-31 08:54:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-31 08:54:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-01-31 08:54:01,950 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 34 [2018-01-31 08:54:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:01,951 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-01-31 08:54:01,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:54:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-01-31 08:54:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:54:01,952 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:01,952 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:01,952 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-01-31 08:54:01,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1931784257, now seen corresponding path program 1 times [2018-01-31 08:54:01,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:01,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:01,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:01,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:01,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:01,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:02,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:02,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:54:02,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:54:02,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:54:02,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:02,021 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 6 states. [2018-01-31 08:54:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:02,107 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-01-31 08:54:02,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:54:02,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-31 08:54:02,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:02,109 INFO L225 Difference]: With dead ends: 142 [2018-01-31 08:54:02,109 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 08:54:02,110 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-01-31 08:54:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 08:54:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-31 08:54:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:54:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-01-31 08:54:02,124 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 34 [2018-01-31 08:54:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:02,125 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-01-31 08:54:02,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:54:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-01-31 08:54:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:54:02,126 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:02,126 INFO L351 BasicCegarLoop]: trace histogram [2, 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] [2018-01-31 08:54:02,127 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-01-31 08:54:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1834967219, now seen corresponding path program 1 times [2018-01-31 08:54:02,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:02,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:02,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:02,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:02,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:02,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:02,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:02,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:54:02,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:54:02,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:54:02,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:02,248 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 6 states. [2018-01-31 08:54:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:02,843 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2018-01-31 08:54:02,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:54:02,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 08:54:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:02,845 INFO L225 Difference]: With dead ends: 169 [2018-01-31 08:54:02,846 INFO L226 Difference]: Without dead ends: 167 [2018-01-31 08:54:02,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:54:02,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-31 08:54:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 113. [2018-01-31 08:54:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:54:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-31 08:54:02,871 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 35 [2018-01-31 08:54:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:02,872 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-31 08:54:02,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:54:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-31 08:54:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:54:02,873 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:02,876 INFO L351 BasicCegarLoop]: trace histogram [2, 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] [2018-01-31 08:54:02,876 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-01-31 08:54:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1834967220, now seen corresponding path program 1 times [2018-01-31 08:54:02,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:02,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:02,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:02,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:02,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:02,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:54:03,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:03,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:54:03,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:54:03,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:54:03,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:54:03,033 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 8 states. [2018-01-31 08:54:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:03,423 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2018-01-31 08:54:03,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:54:03,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-31 08:54:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:03,425 INFO L225 Difference]: With dead ends: 181 [2018-01-31 08:54:03,425 INFO L226 Difference]: Without dead ends: 179 [2018-01-31 08:54:03,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:54:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-31 08:54:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 140. [2018-01-31 08:54:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-31 08:54:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2018-01-31 08:54:03,442 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 35 [2018-01-31 08:54:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:03,443 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2018-01-31 08:54:03,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:54:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2018-01-31 08:54:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:54:03,444 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:03,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:03,445 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-01-31 08:54:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash 70064691, now seen corresponding path program 1 times [2018-01-31 08:54:03,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:03,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:03,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:03,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:03,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:03,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:03,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:03,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:54:03,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:54:03,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:54:03,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:54:03,714 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand 9 states. [2018-01-31 08:54:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:04,287 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2018-01-31 08:54:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:54:04,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-31 08:54:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:04,289 INFO L225 Difference]: With dead ends: 185 [2018-01-31 08:54:04,290 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:54:04,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:54:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:54:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 115. [2018-01-31 08:54:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-31 08:54:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-01-31 08:54:04,304 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 36 [2018-01-31 08:54:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:04,304 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-01-31 08:54:04,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:54:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-01-31 08:54:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:54:04,306 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:04,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:04,306 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-01-31 08:54:04,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1675961816, now seen corresponding path program 1 times [2018-01-31 08:54:04,306 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:04,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:04,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:04,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:04,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:04,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:54:04,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:04,437 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:54:04,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:04,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:04,737 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-01-31 08:54:04,754 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-01-31 08:54:04,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:04,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:04,808 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-01-31 08:54:04,818 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-01-31 08:54:04,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:04,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:04,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:04,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-31 08:54:04,929 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-01-31 08:54:04,943 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-01-31 08:54:04,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:04,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:05,001 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-01-31 08:54:05,015 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-01-31 08:54:05,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:05,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:05,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:05,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-01-31 08:54:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:05,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:54:05,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-01-31 08:54:05,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:54:05,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:54:05,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:54:05,163 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 7 states. [2018-01-31 08:54:05,414 WARN L143 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 08:54:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:05,671 INFO L93 Difference]: Finished difference Result 214 states and 228 transitions. [2018-01-31 08:54:05,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:54:05,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-31 08:54:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:05,672 INFO L225 Difference]: With dead ends: 214 [2018-01-31 08:54:05,673 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 08:54:05,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:54:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 08:54:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-01-31 08:54:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-31 08:54:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-31 08:54:05,727 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 36 [2018-01-31 08:54:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:05,727 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-31 08:54:05,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:54:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-31 08:54:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:54:05,728 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:05,728 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-01-31 08:54:05,728 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-01-31 08:54:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1496409031, now seen corresponding path program 1 times [2018-01-31 08:54:05,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:05,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:05,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:05,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:05,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:05,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:06,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:06,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:54:06,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:54:06,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:54:06,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:54:06,143 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 8 states. [2018-01-31 08:54:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:06,541 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-01-31 08:54:06,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:54:06,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-31 08:54:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:06,544 INFO L225 Difference]: With dead ends: 155 [2018-01-31 08:54:06,544 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 08:54:06,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:54:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 08:54:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 118. [2018-01-31 08:54:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:54:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-31 08:54:06,567 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 37 [2018-01-31 08:54:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:06,568 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-31 08:54:06,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:54:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-31 08:54:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:54:06,569 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:06,569 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-01-31 08:54:06,569 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-01-31 08:54:06,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1496409030, now seen corresponding path program 1 times [2018-01-31 08:54:06,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:06,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:06,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:06,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:06,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:06,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:06,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:06,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:54:06,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:54:06,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:54:06,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:54:06,852 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 12 states. [2018-01-31 08:54:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:07,930 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-01-31 08:54:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:54:07,931 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-01-31 08:54:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:07,932 INFO L225 Difference]: With dead ends: 163 [2018-01-31 08:54:07,932 INFO L226 Difference]: Without dead ends: 161 [2018-01-31 08:54:07,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:54:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-31 08:54:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2018-01-31 08:54:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:54:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2018-01-31 08:54:07,950 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 37 [2018-01-31 08:54:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:07,951 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-01-31 08:54:07,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:54:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2018-01-31 08:54:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:54:07,952 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:07,952 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:07,952 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-01-31 08:54:07,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1047889712, now seen corresponding path program 1 times [2018-01-31 08:54:07,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:07,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:07,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:07,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:07,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:07,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:08,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:08,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:54:08,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:54:08,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:54:08,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:54:08,031 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 4 states. [2018-01-31 08:54:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:08,149 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-01-31 08:54:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:54:08,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-31 08:54:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:08,151 INFO L225 Difference]: With dead ends: 137 [2018-01-31 08:54:08,151 INFO L226 Difference]: Without dead ends: 119 [2018-01-31 08:54:08,151 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-01-31 08:54:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-31 08:54:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-01-31 08:54:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-31 08:54:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-31 08:54:08,166 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 36 [2018-01-31 08:54:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:08,166 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-31 08:54:08,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:54:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-31 08:54:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:54:08,167 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:08,167 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:08,167 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-01-31 08:54:08,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2124481135, now seen corresponding path program 1 times [2018-01-31 08:54:08,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:08,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:08,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:08,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:08,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:08,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:08,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:08,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:54:08,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:54:08,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:54:08,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:54:08,614 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 7 states. [2018-01-31 08:54:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:08,696 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-31 08:54:08,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:54:08,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-31 08:54:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:08,698 INFO L225 Difference]: With dead ends: 115 [2018-01-31 08:54:08,698 INFO L226 Difference]: Without dead ends: 101 [2018-01-31 08:54:08,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:54:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-31 08:54:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-01-31 08:54:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-31 08:54:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-31 08:54:08,710 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 37 [2018-01-31 08:54:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:08,711 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-31 08:54:08,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:54:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-31 08:54:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-31 08:54:08,712 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:08,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:08,712 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-01-31 08:54:08,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1940574048, now seen corresponding path program 1 times [2018-01-31 08:54:08,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:08,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:08,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:08,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:08,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:08,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:54:08,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:08,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:54:08,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:54:08,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:54:08,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:54:08,964 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-01-31 08:54:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:09,155 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-01-31 08:54:09,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:54:09,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-31 08:54:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:09,157 INFO L225 Difference]: With dead ends: 149 [2018-01-31 08:54:09,157 INFO L226 Difference]: Without dead ends: 109 [2018-01-31 08:54:09,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-31 08:54:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-01-31 08:54:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-31 08:54:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-01-31 08:54:09,172 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 49 [2018-01-31 08:54:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:09,172 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-01-31 08:54:09,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:54:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-01-31 08:54:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-31 08:54:09,173 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:09,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:09,174 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-01-31 08:54:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash -458430141, now seen corresponding path program 1 times [2018-01-31 08:54:09,174 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:09,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:09,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:09,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:09,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:09,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:10,085 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 15 DAG size of output 13 [2018-01-31 08:54:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:54:10,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:10,191 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:54:10,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:10,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:10,299 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-01-31 08:54:10,305 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-01-31 08:54:10,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:10,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:10,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:10,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-31 08:54:10,351 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-01-31 08:54:10,400 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-01-31 08:54:10,402 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-01-31 08:54:10,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:10,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:10,411 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-01-31 08:54:10,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-31 08:54:10,431 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-01-31 08:54:10,437 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-01-31 08:54:10,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:10,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:10,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:10,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-31 08:54:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:54:10,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:54:10,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-01-31 08:54:10,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:54:10,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:54:10,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-01-31 08:54:10,497 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 19 states. [2018-01-31 08:54:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:11,054 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-01-31 08:54:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:54:11,054 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-01-31 08:54:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:11,055 INFO L225 Difference]: With dead ends: 107 [2018-01-31 08:54:11,056 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 08:54:11,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=4, NotChecked=56, Total=930 [2018-01-31 08:54:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 08:54:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-31 08:54:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-31 08:54:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-01-31 08:54:11,069 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 49 [2018-01-31 08:54:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:11,070 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-01-31 08:54:11,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:54:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-01-31 08:54:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-31 08:54:11,071 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:11,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:11,071 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-01-31 08:54:11,071 INFO L82 PathProgramCache]: Analyzing trace with hash -458430140, now seen corresponding path program 1 times [2018-01-31 08:54:11,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:11,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:11,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:11,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:11,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:11,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:11,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:11,457 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:54:11,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:11,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:11,500 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-01-31 08:54:11,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:11,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:11,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:54:11,513 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-01-31 08:54:11,515 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-01-31 08:54:11,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:11,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:11,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:11,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-31 08:54:11,645 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-01-31 08:54:11,654 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-01-31 08:54:11,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-31 08:54:11,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-31 08:54:11,687 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-01-31 08:54:11,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-01-31 08:54:11,753 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-01-31 08:54:11,771 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-01-31 08:54:11,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:54:11,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:54:11,794 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-01-31 08:54:11,797 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-01-31 08:54:11,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:11,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:11,810 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-01-31 08:54:11,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-01-31 08:54:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:11,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:54:11,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-01-31 08:54:11,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:54:11,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:54:11,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-01-31 08:54:11,870 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 23 states. [2018-01-31 08:54:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:12,953 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-01-31 08:54:12,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:54:12,953 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-01-31 08:54:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:12,954 INFO L225 Difference]: With dead ends: 139 [2018-01-31 08:54:12,954 INFO L226 Difference]: Without dead ends: 138 [2018-01-31 08:54:12,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-01-31 08:54:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-31 08:54:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2018-01-31 08:54:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-31 08:54:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-31 08:54:12,969 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 49 [2018-01-31 08:54:12,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:12,969 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-31 08:54:12,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:54:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-31 08:54:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:54:12,970 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:12,970 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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-01-31 08:54:12,970 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-01-31 08:54:12,971 INFO L82 PathProgramCache]: Analyzing trace with hash 488581789, now seen corresponding path program 1 times [2018-01-31 08:54:12,971 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:12,971 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:12,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:12,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:12,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:12,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:54:13,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:13,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:54:13,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:54:13,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:54:13,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:54:13,075 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 7 states. [2018-01-31 08:54:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:13,126 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2018-01-31 08:54:13,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:54:13,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-31 08:54:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:13,127 INFO L225 Difference]: With dead ends: 177 [2018-01-31 08:54:13,128 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 08:54:13,128 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-01-31 08:54:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 08:54:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-31 08:54:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:54:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-01-31 08:54:13,142 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 50 [2018-01-31 08:54:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:13,143 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-01-31 08:54:13,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:54:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-01-31 08:54:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:54:13,144 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:13,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:13,144 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-01-31 08:54:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1248900333, now seen corresponding path program 1 times [2018-01-31 08:54:13,144 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:13,144 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:13,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:13,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:13,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:13,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:54:13,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:13,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:54:13,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:54:13,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:54:13,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:13,233 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 6 states. [2018-01-31 08:54:13,452 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:54:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:13,696 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-01-31 08:54:13,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:54:13,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-01-31 08:54:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:13,697 INFO L225 Difference]: With dead ends: 172 [2018-01-31 08:54:13,697 INFO L226 Difference]: Without dead ends: 111 [2018-01-31 08:54:13,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:54:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-31 08:54:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-31 08:54:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:54:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-31 08:54:13,716 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 60 [2018-01-31 08:54:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:13,716 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-31 08:54:13,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:54:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-31 08:54:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:54:13,719 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:13,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:13,719 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-01-31 08:54:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 634445456, now seen corresponding path program 1 times [2018-01-31 08:54:13,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:13,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:13,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:13,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:13,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:13,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:14,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:14,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:54:14,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:54:14,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:54:14,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:14,099 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 6 states. [2018-01-31 08:54:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:14,514 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-31 08:54:14,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:54:14,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-01-31 08:54:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:14,515 INFO L225 Difference]: With dead ends: 128 [2018-01-31 08:54:14,515 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 08:54:14,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:54:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 08:54:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-01-31 08:54:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-31 08:54:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-01-31 08:54:14,530 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 60 [2018-01-31 08:54:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:14,531 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-01-31 08:54:14,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:54:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-01-31 08:54:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:54:14,532 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:14,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:14,532 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-01-31 08:54:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash 634445457, now seen corresponding path program 1 times [2018-01-31 08:54:14,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:14,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:14,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:14,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:14,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:14,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:54:14,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:14,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:54:14,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:54:14,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:54:14,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:54:14,734 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 5 states. [2018-01-31 08:54:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:14,805 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-01-31 08:54:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:54:14,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-01-31 08:54:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:14,807 INFO L225 Difference]: With dead ends: 170 [2018-01-31 08:54:14,807 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 08:54:14,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 08:54:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-31 08:54:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:54:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-01-31 08:54:14,821 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 60 [2018-01-31 08:54:14,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:14,821 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-01-31 08:54:14,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:54:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-01-31 08:54:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:54:14,823 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:14,823 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-01-31 08:54:14,823 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-01-31 08:54:14,823 INFO L82 PathProgramCache]: Analyzing trace with hash -375592934, now seen corresponding path program 1 times [2018-01-31 08:54:14,823 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:14,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:14,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:14,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:14,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:14,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:54:14,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:14,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:54:14,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:54:14,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:54:14,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:54:14,996 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 8 states. [2018-01-31 08:54:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:15,319 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-01-31 08:54:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:54:15,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-31 08:54:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:15,321 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:54:15,321 INFO L226 Difference]: Without dead ends: 119 [2018-01-31 08:54:15,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:54:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-31 08:54:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2018-01-31 08:54:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:54:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-31 08:54:15,335 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 61 [2018-01-31 08:54:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:15,335 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-31 08:54:15,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:54:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-31 08:54:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:54:15,336 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:15,337 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-01-31 08:54:15,337 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-01-31 08:54:15,337 INFO L82 PathProgramCache]: Analyzing trace with hash -375592933, now seen corresponding path program 1 times [2018-01-31 08:54:15,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:15,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:15,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:15,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:15,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:15,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:54:15,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:15,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:54:15,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:54:15,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:54:15,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:54:15,611 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 11 states. [2018-01-31 08:54:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:16,038 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-01-31 08:54:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:54:16,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-31 08:54:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:16,072 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:54:16,072 INFO L226 Difference]: Without dead ends: 119 [2018-01-31 08:54:16,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:54:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-31 08:54:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-01-31 08:54:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-31 08:54:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-01-31 08:54:16,086 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 61 [2018-01-31 08:54:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:16,086 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-01-31 08:54:16,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:54:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-01-31 08:54:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:54:16,087 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:16,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:16,087 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-01-31 08:54:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1423740632, now seen corresponding path program 1 times [2018-01-31 08:54:16,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:16,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:16,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:16,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:16,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:16,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:54:16,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:16,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:54:16,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:54:16,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:54:16,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:54:16,193 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 8 states. [2018-01-31 08:54:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:16,319 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2018-01-31 08:54:16,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:54:16,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-31 08:54:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:16,320 INFO L225 Difference]: With dead ends: 157 [2018-01-31 08:54:16,320 INFO L226 Difference]: Without dead ends: 129 [2018-01-31 08:54:16,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:54:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-31 08:54:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-01-31 08:54:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-31 08:54:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-01-31 08:54:16,336 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 60 [2018-01-31 08:54:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:16,350 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-01-31 08:54:16,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:54:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-01-31 08:54:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:54:16,351 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:16,351 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-01-31 08:54:16,351 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-01-31 08:54:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1241520919, now seen corresponding path program 1 times [2018-01-31 08:54:16,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:16,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:16,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:16,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:16,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:16,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:54:16,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:16,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:54:16,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:54:16,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:54:16,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:54:16,823 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 11 states. [2018-01-31 08:54:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:17,020 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-01-31 08:54:17,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:54:17,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-31 08:54:17,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:17,021 INFO L225 Difference]: With dead ends: 129 [2018-01-31 08:54:17,021 INFO L226 Difference]: Without dead ends: 128 [2018-01-31 08:54:17,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:54:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-31 08:54:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2018-01-31 08:54:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-31 08:54:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-01-31 08:54:17,036 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 62 [2018-01-31 08:54:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:17,036 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-01-31 08:54:17,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:54:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-01-31 08:54:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:54:17,037 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:17,038 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-01-31 08:54:17,038 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-01-31 08:54:17,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1241520918, now seen corresponding path program 1 times [2018-01-31 08:54:17,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:17,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:17,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:17,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:17,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:17,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:54:17,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:17,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:54:17,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:54:17,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:54:17,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:54:17,167 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 11 states. [2018-01-31 08:54:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:17,270 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2018-01-31 08:54:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:54:17,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-31 08:54:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:17,271 INFO L225 Difference]: With dead ends: 126 [2018-01-31 08:54:17,272 INFO L226 Difference]: Without dead ends: 125 [2018-01-31 08:54:17,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:54:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-31 08:54:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-31 08:54:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-31 08:54:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-01-31 08:54:17,281 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 62 [2018-01-31 08:54:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:17,281 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-01-31 08:54:17,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:54:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-01-31 08:54:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:54:17,282 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:17,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:17,282 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-01-31 08:54:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1850728504, now seen corresponding path program 1 times [2018-01-31 08:54:17,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:17,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:17,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:17,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:17,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:17,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:17,847 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 21 DAG size of output 16 [2018-01-31 08:54:18,151 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 29 DAG size of output 20 [2018-01-31 08:54:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:54:18,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:18,554 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:54:18,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:18,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:18,775 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-01-31 08:54:18,778 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-01-31 08:54:18,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:18,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:18,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:18,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-01-31 08:54:18,910 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-01-31 08:54:18,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:18,914 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-01-31 08:54:18,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:18,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:18,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:18,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-31 08:54:18,942 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-01-31 08:54:18,944 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-01-31 08:54:18,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:18,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:18,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:18,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-01-31 08:54:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:54:19,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:54:19,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-01-31 08:54:19,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:54:19,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:54:19,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=645, Unknown=20, NotChecked=0, Total=756 [2018-01-31 08:54:19,149 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 28 states. [2018-01-31 08:54:19,635 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 25 DAG size of output 20 [2018-01-31 08:54:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:20,525 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-01-31 08:54:20,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:54:20,525 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-01-31 08:54:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:20,526 INFO L225 Difference]: With dead ends: 131 [2018-01-31 08:54:20,526 INFO L226 Difference]: Without dead ends: 99 [2018-01-31 08:54:20,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=170, Invalid=1287, Unknown=25, NotChecked=0, Total=1482 [2018-01-31 08:54:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-31 08:54:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-31 08:54:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:54:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-01-31 08:54:20,539 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 62 [2018-01-31 08:54:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:20,539 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-01-31 08:54:20,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:54:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-01-31 08:54:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 08:54:20,540 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:20,540 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-01-31 08:54:20,540 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-01-31 08:54:20,540 INFO L82 PathProgramCache]: Analyzing trace with hash -945121096, now seen corresponding path program 1 times [2018-01-31 08:54:20,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:20,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:20,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:20,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:20,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:20,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:21,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:21,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-31 08:54:21,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:54:21,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:54:21,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:54:21,013 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 13 states. [2018-01-31 08:54:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:21,314 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-01-31 08:54:21,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:54:21,315 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-01-31 08:54:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:21,315 INFO L225 Difference]: With dead ends: 99 [2018-01-31 08:54:21,316 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 08:54:21,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:54:21,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 08:54:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-31 08:54:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:54:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-01-31 08:54:21,329 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 66 [2018-01-31 08:54:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:21,329 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-01-31 08:54:21,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:54:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-01-31 08:54:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-31 08:54:21,330 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:21,330 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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-01-31 08:54:21,331 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-01-31 08:54:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash 766017186, now seen corresponding path program 1 times [2018-01-31 08:54:21,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:21,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:21,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:21,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:21,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:21,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:22,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:22,002 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:54:22,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:22,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:22,055 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-01-31 08:54:22,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:22,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:22,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:54:22,095 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-01-31 08:54:22,096 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-01-31 08:54:22,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:22,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:22,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:22,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-31 08:54:22,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:22,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:22,773 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-01-31 08:54:22,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:22,785 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-01-31 08:54:22,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:22,788 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-01-31 08:54:22,789 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:22,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:22,800 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-01-31 08:54:22,800 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-01-31 08:54:23,021 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-01-31 08:54:23,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:23,026 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-01-31 08:54:23,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-01-31 08:54:27,385 WARN L143 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 08:54:27,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:27,761 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-01-31 08:54:27,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:27,770 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-01-31 08:54:27,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-01-31 08:54:27,856 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-01-31 08:54:27,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:27,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:27,872 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-01-31 08:54:27,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:54:27,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:54:27,883 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-01-31 08:54:27,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-01-31 08:54:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:27,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:54:27,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-01-31 08:54:27,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-31 08:54:27,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-31 08:54:27,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-01-31 08:54:27,944 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 36 states. [2018-01-31 08:54:29,632 WARN L146 SmtUtils]: Spent 343ms on a formula simplification. DAG size of input: 48 DAG size of output 36 [2018-01-31 08:54:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:33,068 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-01-31 08:54:33,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:54:33,069 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-01-31 08:54:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:33,069 INFO L225 Difference]: With dead ends: 113 [2018-01-31 08:54:33,069 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 08:54:33,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-01-31 08:54:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 08:54:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2018-01-31 08:54:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 08:54:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-01-31 08:54:33,087 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 67 [2018-01-31 08:54:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:33,087 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-01-31 08:54:33,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-31 08:54:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-01-31 08:54:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-31 08:54:33,088 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:33,088 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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-01-31 08:54:33,088 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-01-31 08:54:33,088 INFO L82 PathProgramCache]: Analyzing trace with hash 498775454, now seen corresponding path program 1 times [2018-01-31 08:54:33,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:33,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:33,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:33,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:33,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:33,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:54:33,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:33,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:54:33,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:54:33,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:54:33,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:54:33,307 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 10 states. [2018-01-31 08:54:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:33,419 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-01-31 08:54:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:54:33,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-01-31 08:54:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:33,420 INFO L225 Difference]: With dead ends: 112 [2018-01-31 08:54:33,420 INFO L226 Difference]: Without dead ends: 111 [2018-01-31 08:54:33,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:54:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-31 08:54:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-01-31 08:54:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-31 08:54:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-31 08:54:33,429 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 67 [2018-01-31 08:54:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:33,429 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-31 08:54:33,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:54:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-31 08:54:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-31 08:54:33,430 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:33,430 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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-01-31 08:54:33,430 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-01-31 08:54:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash 498775455, now seen corresponding path program 1 times [2018-01-31 08:54:33,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:33,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:33,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:33,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:33,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:33,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:33,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:33,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-31 08:54:33,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:54:33,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:54:33,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:54:33,848 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 15 states. [2018-01-31 08:54:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:34,272 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-01-31 08:54:34,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:54:34,272 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-01-31 08:54:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:34,273 INFO L225 Difference]: With dead ends: 106 [2018-01-31 08:54:34,273 INFO L226 Difference]: Without dead ends: 105 [2018-01-31 08:54:34,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:54:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-31 08:54:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-31 08:54:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 08:54:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-01-31 08:54:34,287 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 67 [2018-01-31 08:54:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:34,288 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-01-31 08:54:34,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:54:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-01-31 08:54:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 08:54:34,288 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:34,289 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1] [2018-01-31 08:54:34,289 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-01-31 08:54:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1717830136, now seen corresponding path program 1 times [2018-01-31 08:54:34,290 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:34,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:34,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:34,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:34,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:34,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:35,167 WARN L146 SmtUtils]: Spent 611ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-01-31 08:54:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-31 08:54:35,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:35,572 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:54:35,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:35,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:35,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-01-31 08:54:35,676 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-01-31 08:54:35,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:35,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:35,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:35,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-31 08:54:35,749 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-01-31 08:54:35,764 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-01-31 08:54:35,766 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-01-31 08:54:35,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:35,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:35,773 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-01-31 08:54:35,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-31 08:54:35,892 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-01-31 08:54:35,893 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-01-31 08:54:35,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:35,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:35,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:35,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-31 08:54:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:54:35,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:54:35,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-01-31 08:54:35,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:54:35,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:54:35,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-01-31 08:54:35,921 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 31 states. [2018-01-31 08:54:40,538 WARN L146 SmtUtils]: Spent 4079ms on a formula simplification. DAG size of input: 34 DAG size of output 31 [2018-01-31 08:54:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:40,880 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-01-31 08:54:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:54:40,880 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-01-31 08:54:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:40,881 INFO L225 Difference]: With dead ends: 113 [2018-01-31 08:54:40,881 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 08:54:40,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-01-31 08:54:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 08:54:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-31 08:54:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:54:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-01-31 08:54:40,899 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 68 [2018-01-31 08:54:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:40,899 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-01-31 08:54:40,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:54:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-01-31 08:54:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 08:54:40,900 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:40,900 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1] [2018-01-31 08:54:40,900 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-01-31 08:54:40,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1717830135, now seen corresponding path program 1 times [2018-01-31 08:54:40,900 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:40,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:40,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:40,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:40,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:40,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:41,715 WARN L146 SmtUtils]: Spent 527ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-01-31 08:54:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:42,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:42,408 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:54:42,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:42,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:42,468 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-01-31 08:54:42,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:54:42,529 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-01-31 08:54:42,540 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-01-31 08:54:42,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-31 08:54:42,649 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-01-31 08:54:42,676 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-01-31 08:54:42,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,683 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-01-31 08:54:42,721 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-01-31 08:54:42,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-31 08:54:42,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,732 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-01-31 08:54:42,733 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-01-31 08:54:42,877 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-01-31 08:54:42,878 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-01-31 08:54:42,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:42,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-31 08:54:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:42,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:54:42,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-01-31 08:54:42,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 08:54:42,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 08:54:42,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-01-31 08:54:42,908 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 37 states. [2018-01-31 08:54:48,139 WARN L146 SmtUtils]: Spent 4115ms on a formula simplification. DAG size of input: 50 DAG size of output 44 [2018-01-31 08:54:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:48,555 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-01-31 08:54:48,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:54:48,555 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2018-01-31 08:54:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:48,556 INFO L225 Difference]: With dead ends: 115 [2018-01-31 08:54:48,556 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 08:54:48,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-01-31 08:54:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 08:54:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-01-31 08:54:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:54:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2018-01-31 08:54:48,569 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 68 [2018-01-31 08:54:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:48,569 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2018-01-31 08:54:48,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 08:54:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2018-01-31 08:54:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:54:48,570 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:48,570 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2018-01-31 08:54:48,570 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-01-31 08:54:48,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1684034290, now seen corresponding path program 1 times [2018-01-31 08:54:48,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:48,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:48,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:48,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:48,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:48,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:54:48,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:48,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:54:48,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:54:48,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:54:48,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:54:48,810 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 5 states. [2018-01-31 08:54:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:49,112 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-01-31 08:54:49,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:54:49,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-01-31 08:54:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:49,115 INFO L225 Difference]: With dead ends: 123 [2018-01-31 08:54:49,115 INFO L226 Difference]: Without dead ends: 117 [2018-01-31 08:54:49,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-31 08:54:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-31 08:54:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:54:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-01-31 08:54:49,132 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 69 [2018-01-31 08:54:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:49,133 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-01-31 08:54:49,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:54:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-01-31 08:54:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 08:54:49,133 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:49,133 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2018-01-31 08:54:49,134 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-01-31 08:54:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1339337568, now seen corresponding path program 1 times [2018-01-31 08:54:49,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:49,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:49,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:49,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:49,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:49,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:50,045 WARN L146 SmtUtils]: Spent 464ms on a formula simplification. DAG size of input: 21 DAG size of output 15 [2018-01-31 08:54:50,385 WARN L146 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 23 DAG size of output 21 [2018-01-31 08:54:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:50,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:50,843 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:54:50,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:50,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:50,883 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-01-31 08:54:50,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:50,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:50,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:54:50,996 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-01-31 08:54:50,998 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-01-31 08:54:50,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:50,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:51,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:51,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-31 08:54:51,108 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-01-31 08:54:51,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:51,112 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-01-31 08:54:51,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:51,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:51,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:51,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-01-31 08:54:51,156 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-01-31 08:54:51,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:51,160 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-01-31 08:54:51,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-31 08:54:57,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:57,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:57,242 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-01-31 08:54:57,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:57,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:57,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-31 08:54:57,337 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-01-31 08:54:57,339 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-01-31 08:54:57,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:57,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:57,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:54:57,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-01-31 08:54:57,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:54:57,379 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-01-31 08:54:57,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:57,384 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-01-31 08:54:57,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-31 08:54:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:54:57,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:54:57,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-01-31 08:54:57,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:54:57,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:54:57,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1379, Unknown=5, NotChecked=0, Total=1482 [2018-01-31 08:54:57,548 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 39 states. [2018-01-31 08:55:04,116 WARN L146 SmtUtils]: Spent 2022ms on a formula simplification. DAG size of input: 38 DAG size of output 24 [2018-01-31 08:55:23,520 WARN L143 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:55:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:24,270 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2018-01-31 08:55:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-31 08:55:24,271 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-01-31 08:55:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:24,271 INFO L225 Difference]: With dead ends: 122 [2018-01-31 08:55:24,272 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 08:55:24,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=334, Invalid=4079, Unknown=9, NotChecked=0, Total=4422 [2018-01-31 08:55:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 08:55:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-01-31 08:55:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-31 08:55:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-01-31 08:55:24,284 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 72 [2018-01-31 08:55:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:24,284 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-01-31 08:55:24,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:55:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-01-31 08:55:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 08:55:24,285 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:24,285 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2018-01-31 08:55:24,285 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-01-31 08:55:24,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1339337569, now seen corresponding path program 1 times [2018-01-31 08:55:24,286 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:24,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:24,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:24,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:24,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:24,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:55:24,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:24,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:55:24,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:55:24,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:55:24,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:55:24,547 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 8 states. [2018-01-31 08:55:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:24,852 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-01-31 08:55:24,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:55:24,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-31 08:55:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:24,853 INFO L225 Difference]: With dead ends: 117 [2018-01-31 08:55:24,853 INFO L226 Difference]: Without dead ends: 116 [2018-01-31 08:55:24,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:55:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-31 08:55:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-31 08:55:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:55:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-31 08:55:24,863 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 72 [2018-01-31 08:55:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:24,864 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-31 08:55:24,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:55:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-31 08:55:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-31 08:55:24,865 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:24,865 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:24,865 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-01-31 08:55:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1430208367, now seen corresponding path program 1 times [2018-01-31 08:55:24,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:24,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:24,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:24,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:24,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:24,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:25,415 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 18 DAG size of output 7 [2018-01-31 08:55:25,886 WARN L146 SmtUtils]: Spent 398ms on a formula simplification. DAG size of input: 20 DAG size of output 17 [2018-01-31 08:55:26,405 WARN L146 SmtUtils]: Spent 347ms on a formula simplification. DAG size of input: 28 DAG size of output 16 [2018-01-31 08:55:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:26,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:26,797 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:55:26,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:26,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:26,837 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-01-31 08:55:26,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:26,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:26,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-31 08:55:26,920 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-01-31 08:55:26,922 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-01-31 08:55:26,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:26,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:26,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:26,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-31 08:55:27,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:27,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:27,180 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-01-31 08:55:27,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:27,218 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-01-31 08:55:27,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:27,220 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-01-31 08:55:27,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:27,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:27,232 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-01-31 08:55:27,233 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:45 [2018-01-31 08:55:27,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:27,525 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-01-31 08:55:27,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:27,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:27,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:34 [2018-01-31 08:55:27,642 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-01-31 08:55:27,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:27,644 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-01-31 08:55:27,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:55:27,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:55:27,653 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-01-31 08:55:27,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2018-01-31 08:55:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:27,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:55:27,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 43 [2018-01-31 08:55:27,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-31 08:55:27,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-31 08:55:27,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1756, Unknown=8, NotChecked=0, Total=1892 [2018-01-31 08:55:27,728 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 44 states. [2018-01-31 08:55:28,635 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 08:55:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:29,705 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-01-31 08:55:29,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:55:29,705 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 73 [2018-01-31 08:55:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:29,706 INFO L225 Difference]: With dead ends: 119 [2018-01-31 08:55:29,706 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:55:29,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=277, Invalid=3497, Unknown=8, NotChecked=0, Total=3782 [2018-01-31 08:55:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:55:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-01-31 08:55:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-31 08:55:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-01-31 08:55:29,722 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 73 [2018-01-31 08:55:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:29,723 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-01-31 08:55:29,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-31 08:55:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-01-31 08:55:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-31 08:55:29,726 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:29,726 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:29,726 INFO L371 AbstractCegarLoop]: === Iteration 38 === [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-01-31 08:55:29,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1430208368, now seen corresponding path program 1 times [2018-01-31 08:55:29,726 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:29,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:29,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:29,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:29,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:29,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:55:30,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:30,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-31 08:55:30,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:55:30,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:55:30,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:55:30,831 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 15 states. [2018-01-31 08:55:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:31,044 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-01-31 08:55:31,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:55:31,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-01-31 08:55:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:31,045 INFO L225 Difference]: With dead ends: 117 [2018-01-31 08:55:31,045 INFO L226 Difference]: Without dead ends: 116 [2018-01-31 08:55:31,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:55:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-31 08:55:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-31 08:55:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:55:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-31 08:55:31,055 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 73 [2018-01-31 08:55:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:31,055 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-31 08:55:31,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:55:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-31 08:55:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-31 08:55:31,055 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:31,055 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:31,056 INFO L371 AbstractCegarLoop]: === Iteration 39 === [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-01-31 08:55:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1769771706, now seen corresponding path program 1 times [2018-01-31 08:55:31,056 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:31,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:31,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:31,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:31,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:31,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:55:31,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:31,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:55:31,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:55:31,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:55:31,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:55:31,406 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 6 states. [2018-01-31 08:55:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:31,475 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-01-31 08:55:31,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:55:31,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-01-31 08:55:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:31,477 INFO L225 Difference]: With dead ends: 131 [2018-01-31 08:55:31,477 INFO L226 Difference]: Without dead ends: 107 [2018-01-31 08:55:31,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:55:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-31 08:55:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-01-31 08:55:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-31 08:55:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-01-31 08:55:31,492 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 78 [2018-01-31 08:55:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:31,493 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-01-31 08:55:31,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:55:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-01-31 08:55:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:55:31,494 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:31,494 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:31,494 INFO L371 AbstractCegarLoop]: === Iteration 40 === [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-01-31 08:55:31,494 INFO L82 PathProgramCache]: Analyzing trace with hash -27348182, now seen corresponding path program 1 times [2018-01-31 08:55:31,494 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:31,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:31,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:31,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:31,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:31,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:32,425 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 21 DAG size of output 16 [2018-01-31 08:55:32,656 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 19 DAG size of output 10 [2018-01-31 08:55:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:55:33,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:33,496 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:55:33,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:33,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:33,612 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-01-31 08:55:33,614 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-01-31 08:55:33,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:33,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:33,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:33,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:45 [2018-01-31 08:55:33,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:55:33,887 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-01-31 08:55:33,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:33,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:33,891 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-01-31 08:55:33,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:33,900 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:33,914 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-01-31 08:55:33,914 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:86 [2018-01-31 08:55:33,916 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216817 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-01-31 08:55:33,919 INFO L168 Benchmark]: Toolchain (without parser) took 97867.20 ms. Allocated memory was 303.6 MB in the beginning and 746.1 MB in the end (delta: 442.5 MB). Free memory was 262.5 MB in the beginning and 375.7 MB in the end (delta: -113.2 MB). Peak memory consumption was 329.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:33,921 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:55:33,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.77 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 248.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:33,921 INFO L168 Benchmark]: Boogie Preprocessor took 54.41 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 246.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:33,921 INFO L168 Benchmark]: RCFGBuilder took 696.18 ms. Allocated memory is still 303.6 MB. Free memory was 246.5 MB in the beginning and 219.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:33,922 INFO L168 Benchmark]: TraceAbstraction took 96778.13 ms. Allocated memory was 303.6 MB in the beginning and 746.1 MB in the end (delta: 442.5 MB). Free memory was 219.6 MB in the beginning and 375.7 MB in the end (delta: -156.1 MB). Peak memory consumption was 286.4 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:33,926 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.40 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 317.77 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 248.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.41 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 246.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 696.18 ms. Allocated memory is still 303.6 MB. Free memory was 246.5 MB in the beginning and 219.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 96778.13 ms. Allocated memory was 303.6 MB in the beginning and 746.1 MB in the end (delta: 442.5 MB). Free memory was 219.6 MB in the beginning and 375.7 MB in the end (delta: -156.1 MB). Peak memory consumption was 286.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 216817 column 39: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 216817 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 /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-55-33-937.csv Received shutdown request...