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-acfac67 [2018-01-28 22:39:14,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:39:14,769 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:39:14,781 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:39:14,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:39:14,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:39:14,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:39:14,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:39:14,787 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:39:14,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:39:14,788 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:39:14,788 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:39:14,789 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:39:14,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:39:14,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:39:14,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:39:14,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:39:14,797 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:39:14,798 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:39:14,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:39:14,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:39:14,802 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:39:14,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:39:14,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:39:14,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:39:14,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:39:14,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:39:14,806 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:39:14,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:39:14,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:39:14,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:39:14,807 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:39:14,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:39:14,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:39:14,817 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:39:14,818 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:39:14,818 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:39:14,818 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:39:14,818 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:39:14,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:39:14,819 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:39:14,819 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:39:14,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:39:14,820 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:39:14,820 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:39:14,820 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:39:14,820 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:39:14,820 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:39:14,821 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:39:14,821 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:39:14,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:39:14,821 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:39:14,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:39:14,822 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:39:14,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:39:14,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:39:14,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:39:14,822 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:39:14,823 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:39:14,823 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:39:14,823 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:39:14,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:39:14,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:39:14,823 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:39:14,824 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:39:14,825 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:39:14,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:39:14,870 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:39:14,874 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:39:14,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:39:14,876 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:39:14,876 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-28 22:39:15,074 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:39:15,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:39:15,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:39:15,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:39:15,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:39:15,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:39:15" (1/1) ... [2018-01-28 22:39:15,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f5e0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15, skipping insertion in model container [2018-01-28 22:39:15,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:39:15" (1/1) ... [2018-01-28 22:39:15,100 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:39:15,148 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:39:15,263 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:39:15,281 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:39:15,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15 WrapperNode [2018-01-28 22:39:15,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:39:15,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:39:15,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:39:15,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:39:15,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15" (1/1) ... [2018-01-28 22:39:15,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15" (1/1) ... [2018-01-28 22:39:15,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15" (1/1) ... [2018-01-28 22:39:15,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15" (1/1) ... [2018-01-28 22:39:15,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15" (1/1) ... [2018-01-28 22:39:15,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15" (1/1) ... [2018-01-28 22:39:15,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15" (1/1) ... [2018-01-28 22:39:15,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:39:15,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:39:15,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:39:15,329 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:39:15,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:39:15,377 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:39:15,377 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:39:15,377 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:39:15,377 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-28 22:39:15,377 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-28 22:39:15,377 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-28 22:39:15,378 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-01-28 22:39:15,378 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-28 22:39:15,378 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:39:15,378 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:39:15,378 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:39:15,378 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:39:15,378 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:39:15,378 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:39:15,378 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:39:15,378 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:39:15,379 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:39:15,379 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:39:15,379 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:39:15,379 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-28 22:39:15,379 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-28 22:39:15,379 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-28 22:39:15,379 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-01-28 22:39:15,380 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-28 22:39:15,380 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:39:15,380 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:39:15,380 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:39:15,380 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:39:15,715 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:39:15,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:39:15 BoogieIcfgContainer [2018-01-28 22:39:15,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:39:15,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:39:15,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:39:15,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:39:15,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:39:15" (1/3) ... [2018-01-28 22:39:15,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74406e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:39:15, skipping insertion in model container [2018-01-28 22:39:15,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:39:15" (2/3) ... [2018-01-28 22:39:15,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74406e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:39:15, skipping insertion in model container [2018-01-28 22:39:15,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:39:15" (3/3) ... [2018-01-28 22:39:15,725 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-28 22:39:15,731 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:39:15,737 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-28 22:39:15,774 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:39:15,774 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:39:15,774 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:39:15,774 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:39:15,774 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:39:15,774 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:39:15,775 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:39:15,775 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:39:15,775 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:39:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-01-28 22:39:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 22:39:15,798 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:15,799 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:15,799 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-28 22:39:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1450049695, now seen corresponding path program 1 times [2018-01-28 22:39:15,804 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:15,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:15,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:15,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:15,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:15,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:39:16,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:16,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:39:16,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:39:16,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:39:16,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:16,078 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 6 states. [2018-01-28 22:39:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:16,539 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-01-28 22:39:16,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:39:16,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-28 22:39:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:16,557 INFO L225 Difference]: With dead ends: 181 [2018-01-28 22:39:16,557 INFO L226 Difference]: Without dead ends: 175 [2018-01-28 22:39:16,561 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-28 22:39:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 125. [2018-01-28 22:39:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 22:39:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2018-01-28 22:39:16,619 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 20 [2018-01-28 22:39:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:16,619 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2018-01-28 22:39:16,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:39:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2018-01-28 22:39:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 22:39:16,621 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:16,622 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:16,622 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-28 22:39:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1450049696, now seen corresponding path program 1 times [2018-01-28 22:39:16,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:16,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:16,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:16,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:16,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:16,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:39:16,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:16,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:39:16,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:39:16,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:39:16,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:16,770 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 6 states. [2018-01-28 22:39:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:17,068 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2018-01-28 22:39:17,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:39:17,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-28 22:39:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:17,071 INFO L225 Difference]: With dead ends: 167 [2018-01-28 22:39:17,071 INFO L226 Difference]: Without dead ends: 164 [2018-01-28 22:39:17,072 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-28 22:39:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 142. [2018-01-28 22:39:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-28 22:39:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 165 transitions. [2018-01-28 22:39:17,093 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 165 transitions. Word has length 20 [2018-01-28 22:39:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:17,093 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 165 transitions. [2018-01-28 22:39:17,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:39:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 165 transitions. [2018-01-28 22:39:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 22:39:17,094 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:17,094 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:17,095 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-28 22:39:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1666557696, now seen corresponding path program 1 times [2018-01-28 22:39:17,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:17,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:17,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:17,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:17,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:17,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:39:17,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:17,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:39:17,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:39:17,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:39:17,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:17,234 INFO L87 Difference]: Start difference. First operand 142 states and 165 transitions. Second operand 8 states. [2018-01-28 22:39:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:17,651 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2018-01-28 22:39:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:39:17,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-28 22:39:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:17,653 INFO L225 Difference]: With dead ends: 195 [2018-01-28 22:39:17,653 INFO L226 Difference]: Without dead ends: 193 [2018-01-28 22:39:17,653 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:39:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-28 22:39:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 137. [2018-01-28 22:39:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-28 22:39:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2018-01-28 22:39:17,670 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 21 [2018-01-28 22:39:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:17,671 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2018-01-28 22:39:17,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:39:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2018-01-28 22:39:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 22:39:17,671 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:17,672 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:17,672 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-28 22:39:17,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1666557695, now seen corresponding path program 1 times [2018-01-28 22:39:17,672 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:17,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:17,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:17,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:17,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:17,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:39:17,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:17,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:39:17,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:39:17,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:39:17,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:39:17,824 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 9 states. [2018-01-28 22:39:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:18,342 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2018-01-28 22:39:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:39:18,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-28 22:39:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:18,345 INFO L225 Difference]: With dead ends: 200 [2018-01-28 22:39:18,345 INFO L226 Difference]: Without dead ends: 197 [2018-01-28 22:39:18,345 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:39:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-28 22:39:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 104. [2018-01-28 22:39:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-28 22:39:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-01-28 22:39:18,356 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 21 [2018-01-28 22:39:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:18,356 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-01-28 22:39:18,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:39:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-01-28 22:39:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:39:18,357 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:18,357 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:18,357 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-28 22:39:18,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1931784256, now seen corresponding path program 1 times [2018-01-28 22:39:18,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:18,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:18,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:18,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:18,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:18,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:39:18,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:18,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:39:18,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:39:18,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:39:18,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:18,460 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 8 states. [2018-01-28 22:39:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:18,599 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-01-28 22:39:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:39:18,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-28 22:39:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:18,601 INFO L225 Difference]: With dead ends: 120 [2018-01-28 22:39:18,601 INFO L226 Difference]: Without dead ends: 119 [2018-01-28 22:39:18,602 INFO L533 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-28 22:39:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-28 22:39:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-01-28 22:39:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-28 22:39:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-01-28 22:39:18,614 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 34 [2018-01-28 22:39:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:18,614 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-01-28 22:39:18,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:39:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-01-28 22:39:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:39:18,615 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:18,615 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:18,615 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-28 22:39:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1931784257, now seen corresponding path program 1 times [2018-01-28 22:39:18,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:18,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:18,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:18,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:18,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:18,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:39:18,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:18,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:39:18,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:39:18,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:39:18,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:18,671 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 6 states. [2018-01-28 22:39:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:18,709 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-01-28 22:39:18,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:39:18,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-28 22:39:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:18,711 INFO L225 Difference]: With dead ends: 142 [2018-01-28 22:39:18,711 INFO L226 Difference]: Without dead ends: 115 [2018-01-28 22:39:18,711 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-28 22:39:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-28 22:39:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-28 22:39:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-01-28 22:39:18,725 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 34 [2018-01-28 22:39:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:18,726 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-01-28 22:39:18,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:39:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-01-28 22:39:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:39:18,727 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:18,727 INFO L330 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-28 22:39:18,728 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-28 22:39:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1834967219, now seen corresponding path program 1 times [2018-01-28 22:39:18,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:18,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:18,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:18,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:18,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:18,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:18,790 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-28 22:39:18,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:18,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:39:18,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:39:18,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:39:18,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:18,792 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 6 states. [2018-01-28 22:39:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:18,960 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2018-01-28 22:39:18,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:39:18,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-28 22:39:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:18,963 INFO L225 Difference]: With dead ends: 169 [2018-01-28 22:39:18,963 INFO L226 Difference]: Without dead ends: 167 [2018-01-28 22:39:18,963 INFO L533 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-28 22:39:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-28 22:39:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 113. [2018-01-28 22:39:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-28 22:39:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-28 22:39:18,978 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 35 [2018-01-28 22:39:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:18,978 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-28 22:39:18,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:39:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-28 22:39:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:39:18,980 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:18,980 INFO L330 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-28 22:39:18,980 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-28 22:39:18,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1834967220, now seen corresponding path program 1 times [2018-01-28 22:39:18,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:18,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:18,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:18,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:18,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:18,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:19,109 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-28 22:39:19,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:19,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:39:19,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:39:19,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:39:19,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:19,110 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 8 states. [2018-01-28 22:39:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:19,529 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2018-01-28 22:39:19,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:39:19,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-28 22:39:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:19,531 INFO L225 Difference]: With dead ends: 181 [2018-01-28 22:39:19,531 INFO L226 Difference]: Without dead ends: 179 [2018-01-28 22:39:19,531 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:39:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-28 22:39:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 140. [2018-01-28 22:39:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-28 22:39:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2018-01-28 22:39:19,544 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 35 [2018-01-28 22:39:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:19,545 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2018-01-28 22:39:19,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:39:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2018-01-28 22:39:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:39:19,546 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:19,546 INFO L330 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-28 22:39:19,546 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-28 22:39:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash 70064691, now seen corresponding path program 1 times [2018-01-28 22:39:19,547 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:19,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:19,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:19,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:19,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:19,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:19,650 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-28 22:39:19,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:19,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:39:19,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:39:19,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:39:19,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:39:19,651 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand 9 states. [2018-01-28 22:39:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:19,965 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2018-01-28 22:39:19,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:39:19,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-28 22:39:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:19,967 INFO L225 Difference]: With dead ends: 185 [2018-01-28 22:39:19,967 INFO L226 Difference]: Without dead ends: 183 [2018-01-28 22:39:19,968 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:39:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-28 22:39:19,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 115. [2018-01-28 22:39:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-28 22:39:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-01-28 22:39:19,981 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 36 [2018-01-28 22:39:19,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:19,982 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-01-28 22:39:19,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:39:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-01-28 22:39:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:39:19,983 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:19,983 INFO L330 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-28 22:39:19,983 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-28 22:39:19,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1675961816, now seen corresponding path program 1 times [2018-01-28 22:39:19,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:19,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:19,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:19,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:19,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:19,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:20,156 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-28 22:39:20,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:20,157 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-28 22:39:20,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:20,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:20,298 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-28 22:39:20,301 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-28 22:39:20,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:20,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:20,328 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-28 22:39:20,330 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-28 22:39:20,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:20,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:20,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:20,349 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-28 22:39:20,365 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-28 22:39:20,369 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-28 22:39:20,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:20,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:20,379 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-28 22:39:20,383 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-28 22:39:20,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:20,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:20,390 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-28 22:39:20,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-01-28 22:39:20,406 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-28 22:39:20,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:39:20,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-01-28 22:39:20,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:39:20,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:39:20,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:39:20,446 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 7 states. [2018-01-28 22:39:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:20,594 INFO L93 Difference]: Finished difference Result 214 states and 228 transitions. [2018-01-28 22:39:20,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:39:20,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-28 22:39:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:20,595 INFO L225 Difference]: With dead ends: 214 [2018-01-28 22:39:20,595 INFO L226 Difference]: Without dead ends: 123 [2018-01-28 22:39:20,596 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-28 22:39:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-01-28 22:39:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-28 22:39:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-28 22:39:20,609 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 36 [2018-01-28 22:39:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:20,609 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-28 22:39:20,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:39:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-28 22:39:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 22:39:20,610 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:20,610 INFO L330 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-28 22:39:20,610 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-28 22:39:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1496409031, now seen corresponding path program 1 times [2018-01-28 22:39:20,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:20,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:20,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:20,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:20,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:20,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:20,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-28 22:39:20,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:20,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:39:20,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:39:20,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:39:20,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:20,925 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 8 states. [2018-01-28 22:39:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:21,212 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-01-28 22:39:21,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:39:21,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-28 22:39:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:21,251 INFO L225 Difference]: With dead ends: 155 [2018-01-28 22:39:21,251 INFO L226 Difference]: Without dead ends: 154 [2018-01-28 22:39:21,252 INFO L533 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-28 22:39:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-28 22:39:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 118. [2018-01-28 22:39:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-28 22:39:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-28 22:39:21,267 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 37 [2018-01-28 22:39:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:21,268 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-28 22:39:21,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:39:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-28 22:39:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 22:39:21,269 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:21,269 INFO L330 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-28 22:39:21,269 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-28 22:39:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1496409030, now seen corresponding path program 1 times [2018-01-28 22:39:21,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:21,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:21,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:21,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:21,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:21,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:21,462 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-28 22:39:21,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:21,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:39:21,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:39:21,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:39:21,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:39:21,463 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 12 states. [2018-01-28 22:39:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:22,109 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-01-28 22:39:22,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:39:22,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-01-28 22:39:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:22,111 INFO L225 Difference]: With dead ends: 163 [2018-01-28 22:39:22,111 INFO L226 Difference]: Without dead ends: 161 [2018-01-28 22:39:22,112 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:39:22,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-28 22:39:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2018-01-28 22:39:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-28 22:39:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2018-01-28 22:39:22,129 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 37 [2018-01-28 22:39:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:22,129 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-01-28 22:39:22,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:39:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2018-01-28 22:39:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:39:22,131 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:22,131 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:22,131 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-28 22:39:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1047889712, now seen corresponding path program 1 times [2018-01-28 22:39:22,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:22,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:22,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:22,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:22,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:22,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:39:22,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:22,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:39:22,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:39:22,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:39:22,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:39:22,217 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 4 states. [2018-01-28 22:39:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:22,316 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-01-28 22:39:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:39:22,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-28 22:39:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:22,318 INFO L225 Difference]: With dead ends: 137 [2018-01-28 22:39:22,318 INFO L226 Difference]: Without dead ends: 119 [2018-01-28 22:39:22,318 INFO L533 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-28 22:39:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-28 22:39:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-01-28 22:39:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-28 22:39:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-28 22:39:22,332 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 36 [2018-01-28 22:39:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:22,333 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-28 22:39:22,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:39:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-28 22:39:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 22:39:22,333 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:22,334 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:22,334 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-28 22:39:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2124481135, now seen corresponding path program 1 times [2018-01-28 22:39:22,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:22,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:22,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:22,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:22,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:22,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:39:22,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:22,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:39:22,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:39:22,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:39:22,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:39:22,406 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 7 states. [2018-01-28 22:39:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:22,448 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-28 22:39:22,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:39:22,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-28 22:39:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:22,449 INFO L225 Difference]: With dead ends: 115 [2018-01-28 22:39:22,449 INFO L226 Difference]: Without dead ends: 101 [2018-01-28 22:39:22,450 INFO L533 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-28 22:39:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-28 22:39:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-01-28 22:39:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-28 22:39:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-28 22:39:22,462 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 37 [2018-01-28 22:39:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:22,462 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-28 22:39:22,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:39:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-28 22:39:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 22:39:22,463 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:22,464 INFO L330 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-28 22:39:22,464 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-28 22:39:22,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1940574048, now seen corresponding path program 1 times [2018-01-28 22:39:22,464 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:22,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:22,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:22,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:22,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:22,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:22,504 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-28 22:39:22,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:22,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:39:22,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:39:22,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:39:22,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:39:22,505 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-01-28 22:39:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:22,537 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-01-28 22:39:22,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:39:22,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-28 22:39:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:22,538 INFO L225 Difference]: With dead ends: 149 [2018-01-28 22:39:22,539 INFO L226 Difference]: Without dead ends: 109 [2018-01-28 22:39:22,539 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-28 22:39:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-01-28 22:39:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-28 22:39:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-01-28 22:39:22,552 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 49 [2018-01-28 22:39:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:22,552 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-01-28 22:39:22,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:39:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-01-28 22:39:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 22:39:22,553 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:22,553 INFO L330 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-28 22:39:22,553 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-28 22:39:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash -458430141, now seen corresponding path program 1 times [2018-01-28 22:39:22,554 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:22,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:22,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:22,555 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:22,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:22,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:22,809 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-28 22:39:22,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:22,809 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-28 22:39:22,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:22,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:22,861 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-28 22:39:22,864 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-28 22:39:22,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:22,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:22,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:22,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-28 22:39:22,918 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-28 22:39:22,927 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-28 22:39:22,930 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-28 22:39:22,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:22,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:22,938 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-28 22:39:22,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-28 22:39:22,966 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-28 22:39:22,968 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-28 22:39:22,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:22,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:22,970 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-28 22:39:22,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-28 22:39:22,976 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-28 22:39:22,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:39:22,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-01-28 22:39:22,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 22:39:22,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 22:39:22,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-01-28 22:39:22,997 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 19 states. [2018-01-28 22:39:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:23,521 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-01-28 22:39:23,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:39:23,521 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-01-28 22:39:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:23,522 INFO L225 Difference]: With dead ends: 107 [2018-01-28 22:39:23,522 INFO L226 Difference]: Without dead ends: 106 [2018-01-28 22:39:23,522 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=4, NotChecked=56, Total=930 [2018-01-28 22:39:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-28 22:39:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-28 22:39:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-28 22:39:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-01-28 22:39:23,531 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 49 [2018-01-28 22:39:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:23,531 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-01-28 22:39:23,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 22:39:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-01-28 22:39:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 22:39:23,531 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:23,531 INFO L330 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-28 22:39:23,532 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-28 22:39:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash -458430140, now seen corresponding path program 1 times [2018-01-28 22:39:23,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:23,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:23,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:23,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:23,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:23,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:23,834 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-28 22:39:23,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:23,835 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-28 22:39:23,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:23,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:23,907 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-28 22:39:23,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:23,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:23,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:39:23,938 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-28 22:39:23,940 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-28 22:39:23,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:23,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:23,945 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-28 22:39:23,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-28 22:39:24,031 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-28 22:39:24,040 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-28 22:39:24,042 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-28 22:39:24,052 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-28 22:39:24,063 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-28 22:39:24,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-01-28 22:39:24,097 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-28 22:39:24,103 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-28 22:39:24,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:39:24,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:39:24,120 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-28 22:39:24,121 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-28 22:39:24,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:24,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:24,134 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-28 22:39:24,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-01-28 22:39:24,163 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-28 22:39:24,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:24,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-01-28 22:39:24,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 22:39:24,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 22:39:24,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-01-28 22:39:24,184 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 23 states. [2018-01-28 22:39:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:24,858 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-01-28 22:39:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:39:24,858 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-01-28 22:39:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:24,859 INFO L225 Difference]: With dead ends: 139 [2018-01-28 22:39:24,859 INFO L226 Difference]: Without dead ends: 138 [2018-01-28 22:39:24,860 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-01-28 22:39:24,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-28 22:39:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2018-01-28 22:39:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-28 22:39:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-28 22:39:24,873 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 49 [2018-01-28 22:39:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:24,874 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-28 22:39:24,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 22:39:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-28 22:39:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 22:39:24,874 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:24,874 INFO L330 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-28 22:39:24,874 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-28 22:39:24,875 INFO L82 PathProgramCache]: Analyzing trace with hash 488581789, now seen corresponding path program 1 times [2018-01-28 22:39:24,875 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:24,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:24,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:24,876 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:24,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:24,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:24,929 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-28 22:39:24,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:24,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:39:24,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:39:24,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:39:24,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:39:24,930 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 7 states. [2018-01-28 22:39:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:24,971 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2018-01-28 22:39:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:39:24,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-28 22:39:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:24,972 INFO L225 Difference]: With dead ends: 177 [2018-01-28 22:39:24,972 INFO L226 Difference]: Without dead ends: 115 [2018-01-28 22:39:24,972 INFO L533 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-28 22:39:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-28 22:39:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-28 22:39:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-28 22:39:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-01-28 22:39:24,987 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 50 [2018-01-28 22:39:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:24,987 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-01-28 22:39:24,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:39:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-01-28 22:39:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:39:24,988 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:24,988 INFO L330 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-28 22:39:24,988 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-28 22:39:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1248900333, now seen corresponding path program 1 times [2018-01-28 22:39:24,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:24,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:24,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:24,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:24,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:25,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:25,085 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-28 22:39:25,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:25,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:39:25,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:39:25,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:39:25,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:25,086 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 6 states. [2018-01-28 22:39:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:25,270 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-01-28 22:39:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:39:25,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-01-28 22:39:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:25,272 INFO L225 Difference]: With dead ends: 172 [2018-01-28 22:39:25,272 INFO L226 Difference]: Without dead ends: 111 [2018-01-28 22:39:25,272 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-28 22:39:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-28 22:39:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-28 22:39:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-28 22:39:25,283 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 60 [2018-01-28 22:39:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:25,283 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-28 22:39:25,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:39:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-28 22:39:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:39:25,284 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:25,284 INFO L330 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-28 22:39:25,284 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-28 22:39:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 634445456, now seen corresponding path program 1 times [2018-01-28 22:39:25,284 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:25,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:25,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:25,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:25,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:25,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:25,380 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-28 22:39:25,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:25,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:39:25,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:39:25,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:39:25,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:25,381 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 6 states. [2018-01-28 22:39:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:25,707 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-28 22:39:25,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:39:25,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-01-28 22:39:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:25,709 INFO L225 Difference]: With dead ends: 128 [2018-01-28 22:39:25,709 INFO L226 Difference]: Without dead ends: 127 [2018-01-28 22:39:25,709 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:39:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-28 22:39:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-01-28 22:39:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-28 22:39:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-01-28 22:39:25,729 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 60 [2018-01-28 22:39:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:25,729 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-01-28 22:39:25,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:39:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-01-28 22:39:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:39:25,731 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:25,731 INFO L330 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-28 22:39:25,731 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-28 22:39:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash 634445457, now seen corresponding path program 1 times [2018-01-28 22:39:25,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:25,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:25,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:25,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:25,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:25,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:25,796 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-28 22:39:25,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:25,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:39:25,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:39:25,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:39:25,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:39:25,797 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 5 states. [2018-01-28 22:39:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:25,833 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-01-28 22:39:25,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:39:25,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-01-28 22:39:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:25,834 INFO L225 Difference]: With dead ends: 170 [2018-01-28 22:39:25,834 INFO L226 Difference]: Without dead ends: 115 [2018-01-28 22:39:25,835 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-28 22:39:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-28 22:39:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-28 22:39:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-01-28 22:39:25,849 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 60 [2018-01-28 22:39:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:25,849 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-01-28 22:39:25,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:39:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-01-28 22:39:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 22:39:25,850 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:25,851 INFO L330 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-28 22:39:25,851 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-28 22:39:25,851 INFO L82 PathProgramCache]: Analyzing trace with hash -375592934, now seen corresponding path program 1 times [2018-01-28 22:39:25,851 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:25,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:25,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:25,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:25,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:25,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:25,916 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-28 22:39:25,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:25,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:39:25,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:39:25,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:39:25,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:25,917 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 8 states. [2018-01-28 22:39:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:26,080 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-01-28 22:39:26,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:39:26,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-28 22:39:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:26,082 INFO L225 Difference]: With dead ends: 120 [2018-01-28 22:39:26,083 INFO L226 Difference]: Without dead ends: 119 [2018-01-28 22:39:26,083 INFO L533 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-28 22:39:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-28 22:39:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2018-01-28 22:39:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-28 22:39:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-28 22:39:26,095 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 61 [2018-01-28 22:39:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:26,095 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-28 22:39:26,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:39:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-28 22:39:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 22:39:26,096 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:26,096 INFO L330 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-28 22:39:26,096 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-28 22:39:26,097 INFO L82 PathProgramCache]: Analyzing trace with hash -375592933, now seen corresponding path program 1 times [2018-01-28 22:39:26,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:26,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:26,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:26,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:26,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:26,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:26,251 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-28 22:39:26,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:26,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 22:39:26,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:39:26,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:39:26,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:39:26,294 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 11 states. [2018-01-28 22:39:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:26,464 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-01-28 22:39:26,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:39:26,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-28 22:39:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:26,465 INFO L225 Difference]: With dead ends: 120 [2018-01-28 22:39:26,465 INFO L226 Difference]: Without dead ends: 119 [2018-01-28 22:39:26,465 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:39:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-28 22:39:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-01-28 22:39:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-28 22:39:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-01-28 22:39:26,476 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 61 [2018-01-28 22:39:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:26,476 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-01-28 22:39:26,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:39:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-01-28 22:39:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:39:26,477 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:26,477 INFO L330 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-28 22:39:26,477 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-28 22:39:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1423740632, now seen corresponding path program 1 times [2018-01-28 22:39:26,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:26,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:26,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:26,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:26,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:26,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:26,620 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-28 22:39:26,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:26,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:39:26,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:39:26,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:39:26,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:26,621 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 8 states. [2018-01-28 22:39:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:26,702 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2018-01-28 22:39:26,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:39:26,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-28 22:39:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:26,704 INFO L225 Difference]: With dead ends: 157 [2018-01-28 22:39:26,704 INFO L226 Difference]: Without dead ends: 129 [2018-01-28 22:39:26,704 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:39:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-28 22:39:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-01-28 22:39:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 22:39:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-01-28 22:39:26,718 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 60 [2018-01-28 22:39:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:26,719 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-01-28 22:39:26,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:39:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-01-28 22:39:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 22:39:26,720 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:26,720 INFO L330 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-28 22:39:26,720 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-28 22:39:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1241520919, now seen corresponding path program 1 times [2018-01-28 22:39:26,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:26,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:26,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:26,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:26,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:26,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:26,858 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-28 22:39:26,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:26,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 22:39:26,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:39:26,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:39:26,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:39:26,860 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 11 states. [2018-01-28 22:39:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:27,032 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-01-28 22:39:27,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:39:27,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-28 22:39:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:27,033 INFO L225 Difference]: With dead ends: 129 [2018-01-28 22:39:27,034 INFO L226 Difference]: Without dead ends: 128 [2018-01-28 22:39:27,034 INFO L533 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-28 22:39:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-28 22:39:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2018-01-28 22:39:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 22:39:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-01-28 22:39:27,042 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 62 [2018-01-28 22:39:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:27,043 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-01-28 22:39:27,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:39:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-01-28 22:39:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 22:39:27,044 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:27,044 INFO L330 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-28 22:39:27,044 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-28 22:39:27,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1241520918, now seen corresponding path program 1 times [2018-01-28 22:39:27,044 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:27,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:27,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:27,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:27,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:27,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:27,180 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-28 22:39:27,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:27,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 22:39:27,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:39:27,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:39:27,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:39:27,181 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 11 states. [2018-01-28 22:39:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:27,291 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2018-01-28 22:39:27,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:39:27,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-28 22:39:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:27,293 INFO L225 Difference]: With dead ends: 126 [2018-01-28 22:39:27,293 INFO L226 Difference]: Without dead ends: 125 [2018-01-28 22:39:27,293 INFO L533 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-28 22:39:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-28 22:39:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-28 22:39:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 22:39:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-01-28 22:39:27,303 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 62 [2018-01-28 22:39:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:27,303 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-01-28 22:39:27,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:39:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-01-28 22:39:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 22:39:27,304 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:27,304 INFO L330 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-28 22:39:27,304 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-28 22:39:27,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1850728504, now seen corresponding path program 1 times [2018-01-28 22:39:27,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:27,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:27,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:27,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:27,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:27,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:28,207 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-28 22:39:28,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:28,207 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-28 22:39:28,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:28,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:28,373 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-28 22:39:28,376 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-28 22:39:28,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:28,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:28,383 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-28 22:39:28,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-01-28 22:39:28,464 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-28 22:39:28,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:28,468 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-28 22:39:28,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:28,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:28,480 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-28 22:39:28,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-28 22:39:28,485 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-28 22:39:28,487 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-28 22:39:28,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:28,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:28,497 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-28 22:39:28,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-01-28 22:39:28,628 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-28 22:39:28,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:28,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-01-28 22:39:28,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-28 22:39:28,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-28 22:39:28,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=645, Unknown=20, NotChecked=0, Total=756 [2018-01-28 22:39:28,649 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 28 states. [2018-01-28 22:39:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:29,447 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-01-28 22:39:29,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:39:29,447 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-01-28 22:39:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:29,448 INFO L225 Difference]: With dead ends: 131 [2018-01-28 22:39:29,448 INFO L226 Difference]: Without dead ends: 99 [2018-01-28 22:39:29,448 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=1287, Unknown=25, NotChecked=0, Total=1482 [2018-01-28 22:39:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-28 22:39:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-28 22:39:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 22:39:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-01-28 22:39:29,457 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 62 [2018-01-28 22:39:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:29,457 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-01-28 22:39:29,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-28 22:39:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-01-28 22:39:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 22:39:29,457 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:29,458 INFO L330 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-28 22:39:29,458 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-28 22:39:29,458 INFO L82 PathProgramCache]: Analyzing trace with hash -945121096, now seen corresponding path program 1 times [2018-01-28 22:39:29,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:29,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:29,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:29,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:29,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:29,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:29,638 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-28 22:39:29,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:29,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 22:39:29,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:39:29,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:39:29,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:39:29,639 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 13 states. [2018-01-28 22:39:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:29,905 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-01-28 22:39:29,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:39:29,905 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-01-28 22:39:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:29,906 INFO L225 Difference]: With dead ends: 99 [2018-01-28 22:39:29,906 INFO L226 Difference]: Without dead ends: 98 [2018-01-28 22:39:29,907 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:39:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-28 22:39:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-28 22:39:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 22:39:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-01-28 22:39:29,919 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 66 [2018-01-28 22:39:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:29,920 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-01-28 22:39:29,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:39:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-01-28 22:39:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-28 22:39:29,920 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:29,920 INFO L330 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-28 22:39:29,920 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-28 22:39:29,921 INFO L82 PathProgramCache]: Analyzing trace with hash 766017186, now seen corresponding path program 1 times [2018-01-28 22:39:29,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:29,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:29,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:29,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:29,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:29,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:30,648 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-28 22:39:30,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:30,649 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-28 22:39:30,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:30,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:30,684 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-28 22:39:30,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:30,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:30,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:39:30,710 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-28 22:39:30,711 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-28 22:39:30,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:30,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:30,715 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-28 22:39:30,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-28 22:39:30,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:30,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:30,957 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-28 22:39:30,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:30,972 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-28 22:39:30,975 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:30,975 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-28 22:39:30,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:30,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:30,986 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-28 22:39:30,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-01-28 22:39:31,121 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-28 22:39:31,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:31,126 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-28 22:39:31,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-01-28 22:39:35,331 WARN L143 SmtUtils]: Spent 4017ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-28 22:39:35,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:35,432 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-28 22:39:35,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:35,443 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-28 22:39:35,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-01-28 22:39:35,508 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-28 22:39:35,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:35,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:35,518 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-28 22:39:35,520 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-28 22:39:35,527 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-28 22:39:35,531 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-28 22:39:35,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-01-28 22:39:35,593 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-28 22:39:35,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:39:35,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-01-28 22:39:35,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-28 22:39:35,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-28 22:39:35,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-01-28 22:39:35,621 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 36 states. [2018-01-28 22:39:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:39,224 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-01-28 22:39:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 22:39:39,224 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-01-28 22:39:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:39,225 INFO L225 Difference]: With dead ends: 113 [2018-01-28 22:39:39,225 INFO L226 Difference]: Without dead ends: 112 [2018-01-28 22:39:39,226 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-01-28 22:39:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-28 22:39:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2018-01-28 22:39:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-28 22:39:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-01-28 22:39:39,235 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 67 [2018-01-28 22:39:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:39,235 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-01-28 22:39:39,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-28 22:39:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-01-28 22:39:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-28 22:39:39,235 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:39,236 INFO L330 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-28 22:39:39,236 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-28 22:39:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash 498775454, now seen corresponding path program 1 times [2018-01-28 22:39:39,236 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:39,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:39,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:39,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:39,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:39,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:39,335 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-28 22:39:39,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:39,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:39:39,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:39:39,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:39:39,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:39:39,336 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 10 states. [2018-01-28 22:39:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:39,563 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-01-28 22:39:39,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:39:39,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-01-28 22:39:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:39,564 INFO L225 Difference]: With dead ends: 112 [2018-01-28 22:39:39,564 INFO L226 Difference]: Without dead ends: 111 [2018-01-28 22:39:39,564 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:39:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-28 22:39:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-01-28 22:39:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-28 22:39:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-28 22:39:39,574 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 67 [2018-01-28 22:39:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:39,574 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-28 22:39:39,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:39:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-28 22:39:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-28 22:39:39,575 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:39,575 INFO L330 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-28 22:39:39,575 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-28 22:39:39,575 INFO L82 PathProgramCache]: Analyzing trace with hash 498775455, now seen corresponding path program 1 times [2018-01-28 22:39:39,575 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:39,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:39,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:39,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:39,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:39,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:40,041 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-28 22:39:40,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:40,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-28 22:39:40,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 22:39:40,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 22:39:40,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:39:40,042 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 15 states. [2018-01-28 22:39:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:40,445 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-01-28 22:39:40,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:39:40,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-01-28 22:39:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:40,446 INFO L225 Difference]: With dead ends: 106 [2018-01-28 22:39:40,446 INFO L226 Difference]: Without dead ends: 105 [2018-01-28 22:39:40,447 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-01-28 22:39:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-28 22:39:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-28 22:39:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-28 22:39:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-01-28 22:39:40,461 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 67 [2018-01-28 22:39:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:40,461 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-01-28 22:39:40,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 22:39:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-01-28 22:39:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-28 22:39:40,462 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:40,462 INFO L330 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-28 22:39:40,462 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-28 22:39:40,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1717830136, now seen corresponding path program 1 times [2018-01-28 22:39:40,463 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:40,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:40,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:40,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:40,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:40,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:40,951 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-28 22:39:40,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:40,951 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-28 22:39:40,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:40,983 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:41,043 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-28 22:39:41,046 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-28 22:39:41,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-28 22:39:41,107 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-28 22:39:41,116 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-28 22:39:41,122 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-28 22:39:41,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,133 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-28 22:39:41,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-28 22:39:41,244 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-28 22:39:41,245 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-28 22:39:41,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,247 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-28 22:39:41,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-28 22:39:41,265 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-28 22:39:41,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:39:41,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-01-28 22:39:41,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 22:39:41,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 22:39:41,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-01-28 22:39:41,288 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 31 states. [2018-01-28 22:39:45,771 WARN L146 SmtUtils]: Spent 4028ms on a formula simplification. DAG size of input: 34 DAG size of output 31 [2018-01-28 22:39:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:46,060 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-01-28 22:39:46,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 22:39:46,060 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-01-28 22:39:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:46,061 INFO L225 Difference]: With dead ends: 113 [2018-01-28 22:39:46,061 INFO L226 Difference]: Without dead ends: 112 [2018-01-28 22:39:46,062 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-01-28 22:39:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-28 22:39:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-28 22:39:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 22:39:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-01-28 22:39:46,074 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 68 [2018-01-28 22:39:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:46,074 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-01-28 22:39:46,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-28 22:39:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-01-28 22:39:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-28 22:39:46,075 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:46,075 INFO L330 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-28 22:39:46,076 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-28 22:39:46,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1717830135, now seen corresponding path program 1 times [2018-01-28 22:39:46,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:46,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:46,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:46,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:46,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:46,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:46,804 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-28 22:39:46,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:46,804 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-28 22:39:46,810 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:46,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:46,860 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-28 22:39:46,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:46,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:46,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:39:46,921 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-28 22:39:46,929 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-28 22:39:46,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:46,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:46,934 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-28 22:39:46,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-28 22:39:47,021 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-28 22:39:47,029 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-28 22:39:47,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:47,036 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-28 22:39:47,044 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-28 22:39:47,045 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-28 22:39:47,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:47,055 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-28 22:39:47,055 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-01-28 22:39:47,184 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-28 22:39:47,185 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-28 22:39:47,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:47,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:47,187 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-28 22:39:47,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-28 22:39:47,193 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-28 22:39:47,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:39:47,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-01-28 22:39:47,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-28 22:39:47,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-28 22:39:47,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-01-28 22:39:47,214 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 37 states. [2018-01-28 22:39:52,223 WARN L146 SmtUtils]: Spent 4045ms on a formula simplification. DAG size of input: 50 DAG size of output 44 [2018-01-28 22:39:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:52,619 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-01-28 22:39:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:39:52,619 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2018-01-28 22:39:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:52,620 INFO L225 Difference]: With dead ends: 115 [2018-01-28 22:39:52,620 INFO L226 Difference]: Without dead ends: 114 [2018-01-28 22:39:52,621 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-01-28 22:39:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-28 22:39:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-01-28 22:39:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-28 22:39:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2018-01-28 22:39:52,632 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 68 [2018-01-28 22:39:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:52,632 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2018-01-28 22:39:52,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-28 22:39:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2018-01-28 22:39:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 22:39:52,632 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:52,632 INFO L330 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-28 22:39:52,633 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-28 22:39:52,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1684034290, now seen corresponding path program 1 times [2018-01-28 22:39:52,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:52,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:52,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:52,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:52,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:52,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:52,698 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-28 22:39:52,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:52,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:39:52,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:39:52,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:39:52,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:39:52,700 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 5 states. [2018-01-28 22:39:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:52,740 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-01-28 22:39:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:39:52,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-01-28 22:39:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:52,741 INFO L225 Difference]: With dead ends: 123 [2018-01-28 22:39:52,741 INFO L226 Difference]: Without dead ends: 117 [2018-01-28 22:39:52,742 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-28 22:39:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-28 22:39:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-28 22:39:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-01-28 22:39:52,751 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 69 [2018-01-28 22:39:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:52,752 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-01-28 22:39:52,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:39:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-01-28 22:39:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-28 22:39:52,752 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:52,752 INFO L330 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-28 22:39:52,752 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-28 22:39:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1339337568, now seen corresponding path program 1 times [2018-01-28 22:39:52,753 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:52,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:52,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:52,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:52,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:52,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:53,334 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-28 22:39:53,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:53,335 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-28 22:39:53,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:53,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:53,368 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-28 22:39:53,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:53,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:53,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:39:53,465 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-28 22:39:53,466 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-28 22:39:53,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:53,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:53,474 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-28 22:39:53,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-28 22:39:53,577 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-28 22:39:53,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:53,581 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-28 22:39:53,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:53,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:53,593 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-28 22:39:53,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-01-28 22:39:53,620 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-28 22:39:53,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:53,623 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-28 22:39:53,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-28 22:39:59,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:59,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:59,697 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-28 22:39:59,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:59,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:59,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-28 22:39:59,780 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-28 22:39:59,781 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-28 22:39:59,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:59,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:59,787 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-28 22:39:59,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-01-28 22:39:59,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:59,816 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-28 22:39:59,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:59,820 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-28 22:39:59,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-28 22:39:59,920 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-28 22:39:59,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:59,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-01-28 22:39:59,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-28 22:39:59,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-28 22:39:59,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1379, Unknown=5, NotChecked=0, Total=1482 [2018-01-28 22:39:59,940 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 39 states. [2018-01-28 22:40:06,412 WARN L146 SmtUtils]: Spent 2013ms on a formula simplification. DAG size of input: 38 DAG size of output 24 [2018-01-28 22:40:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:40:24,248 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2018-01-28 22:40:24,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 22:40:24,248 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-01-28 22:40:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:40:24,249 INFO L225 Difference]: With dead ends: 122 [2018-01-28 22:40:24,249 INFO L226 Difference]: Without dead ends: 121 [2018-01-28 22:40:24,250 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=334, Invalid=4079, Unknown=9, NotChecked=0, Total=4422 [2018-01-28 22:40:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-28 22:40:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-01-28 22:40:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-28 22:40:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-01-28 22:40:24,267 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 72 [2018-01-28 22:40:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:40:24,268 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-01-28 22:40:24,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-28 22:40:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-01-28 22:40:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-28 22:40:24,269 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:40:24,269 INFO L330 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-28 22:40:24,269 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-28 22:40:24,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1339337569, now seen corresponding path program 1 times [2018-01-28 22:40:24,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:40:24,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:40:24,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:24,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:24,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:24,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:40:24,359 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-28 22:40:24,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:40:24,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:40:24,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:40:24,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:40:24,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:40:24,360 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 8 states. [2018-01-28 22:40:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:40:24,477 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-01-28 22:40:24,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:40:24,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-28 22:40:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:40:24,478 INFO L225 Difference]: With dead ends: 117 [2018-01-28 22:40:24,478 INFO L226 Difference]: Without dead ends: 116 [2018-01-28 22:40:24,478 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:40:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-28 22:40:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-28 22:40:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 22:40:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-28 22:40:24,497 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 72 [2018-01-28 22:40:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:40:24,499 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-28 22:40:24,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:40:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-28 22:40:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 22:40:24,500 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:40:24,500 INFO L330 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-28 22:40:24,500 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-28 22:40:24,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1430208367, now seen corresponding path program 1 times [2018-01-28 22:40:24,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:40:24,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:40:24,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:24,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:24,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:24,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:40:25,228 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-28 22:40:25,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:40:25,228 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-28 22:40:25,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:25,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:40:25,265 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-28 22:40:25,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:25,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:25,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-28 22:40:25,339 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-28 22:40:25,341 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-28 22:40:25,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:25,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:25,348 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-28 22:40:25,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-28 22:40:25,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:25,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:25,538 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-28 22:40:25,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:25,548 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-28 22:40:25,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:25,550 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-28 22:40:25,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:25,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:25,562 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-28 22:40:25,562 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:45 [2018-01-28 22:40:25,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:25,832 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-28 22:40:25,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:25,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:25,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:34 [2018-01-28 22:40:25,936 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-28 22:40:25,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:25,947 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-28 22:40:25,948 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-28 22:40:25,952 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-28 22:40:25,956 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-28 22:40:25,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2018-01-28 22:40:26,017 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-28 22:40:26,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:40:26,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 43 [2018-01-28 22:40:26,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-28 22:40:26,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-28 22:40:26,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1756, Unknown=8, NotChecked=0, Total=1892 [2018-01-28 22:40:26,039 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 44 states. [2018-01-28 22:40:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:40:27,508 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-01-28 22:40:27,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-28 22:40:27,508 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 73 [2018-01-28 22:40:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:40:27,509 INFO L225 Difference]: With dead ends: 119 [2018-01-28 22:40:27,509 INFO L226 Difference]: Without dead ends: 118 [2018-01-28 22:40:27,510 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=277, Invalid=3497, Unknown=8, NotChecked=0, Total=3782 [2018-01-28 22:40:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-28 22:40:27,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-01-28 22:40:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-28 22:40:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-01-28 22:40:27,520 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 73 [2018-01-28 22:40:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:40:27,520 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-01-28 22:40:27,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-28 22:40:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-01-28 22:40:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 22:40:27,521 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:40:27,521 INFO L330 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-28 22:40:27,521 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-28 22:40:27,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1430208368, now seen corresponding path program 1 times [2018-01-28 22:40:27,522 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:40:27,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:40:27,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:27,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:27,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:27,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:40:27,824 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-28 22:40:27,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:40:27,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-28 22:40:27,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 22:40:27,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 22:40:27,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:40:27,825 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 15 states. [2018-01-28 22:40:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:40:28,020 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-01-28 22:40:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:40:28,020 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-01-28 22:40:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:40:28,021 INFO L225 Difference]: With dead ends: 117 [2018-01-28 22:40:28,021 INFO L226 Difference]: Without dead ends: 116 [2018-01-28 22:40:28,021 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-01-28 22:40:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-28 22:40:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-28 22:40:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 22:40:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-28 22:40:28,032 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 73 [2018-01-28 22:40:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:40:28,032 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-28 22:40:28,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 22:40:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-28 22:40:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-28 22:40:28,033 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:40:28,033 INFO L330 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-28 22:40:28,033 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-28 22:40:28,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1769771706, now seen corresponding path program 1 times [2018-01-28 22:40:28,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:40:28,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:40:28,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:28,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:28,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:28,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:40:28,130 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-28 22:40:28,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:40:28,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:40:28,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:40:28,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:40:28,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:40:28,158 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 6 states. [2018-01-28 22:40:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:40:28,201 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-01-28 22:40:28,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:40:28,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-01-28 22:40:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:40:28,202 INFO L225 Difference]: With dead ends: 131 [2018-01-28 22:40:28,202 INFO L226 Difference]: Without dead ends: 107 [2018-01-28 22:40:28,202 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:40:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-28 22:40:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-01-28 22:40:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-28 22:40:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-01-28 22:40:28,212 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 78 [2018-01-28 22:40:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:40:28,212 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-01-28 22:40:28,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:40:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-01-28 22:40:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-28 22:40:28,212 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:40:28,212 INFO L330 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-28 22:40:28,213 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-28 22:40:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash -27348182, now seen corresponding path program 1 times [2018-01-28 22:40:28,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:40:28,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:40:28,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:28,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:28,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:28,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:40:29,605 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-28 22:40:29,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:40:29,606 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-28 22:40:29,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:29,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:40:29,710 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-28 22:40:29,712 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-28 22:40:29,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:29,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:29,722 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-28 22:40:29,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:45 [2018-01-28 22:40:29,951 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-28 22:40:29,973 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-28 22:40:29,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:29,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:29,977 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-28 22:40:29,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:29,985 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:29,998 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-28 22:40:29,998 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:86 [2018-01-28 22:40:29,999 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:376) 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-28 22:40:30,002 INFO L168 Benchmark]: Toolchain (without parser) took 74928.04 ms. Allocated memory was 305.1 MB in the beginning and 801.1 MB in the end (delta: 496.0 MB). Free memory was 264.2 MB in the beginning and 588.6 MB in the end (delta: -324.4 MB). Peak memory consumption was 171.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:40:30,004 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 305.1 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:40:30,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.08 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 250.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:40:30,004 INFO L168 Benchmark]: Boogie Preprocessor took 37.12 ms. Allocated memory is still 305.1 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:40:30,005 INFO L168 Benchmark]: RCFGBuilder took 388.01 ms. Allocated memory is still 305.1 MB. Free memory was 248.2 MB in the beginning and 223.5 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-01-28 22:40:30,005 INFO L168 Benchmark]: TraceAbstraction took 74284.42 ms. Allocated memory was 305.1 MB in the beginning and 801.1 MB in the end (delta: 496.0 MB). Free memory was 221.5 MB in the beginning and 588.6 MB in the end (delta: -367.1 MB). Peak memory consumption was 128.9 MB. Max. memory is 5.3 GB. [2018-01-28 22:40:30,007 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.16 ms. Allocated memory is still 305.1 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.08 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 250.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.12 ms. Allocated memory is still 305.1 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 388.01 ms. Allocated memory is still 305.1 MB. Free memory was 248.2 MB in the beginning and 223.5 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 74284.42 ms. Allocated memory was 305.1 MB in the beginning and 801.1 MB in the end (delta: 496.0 MB). Free memory was 221.5 MB in the beginning and 588.6 MB in the end (delta: -367.1 MB). Peak memory consumption was 128.9 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-28_22-40-30-014.csv Received shutdown request...