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.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:34:45,622 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:34:45,624 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:34:45,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:34:45,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:34:45,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:34:45,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:34:45,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:34:45,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:34:45,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:34:45,647 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:34:45,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:34:45,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:34:45,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:34:45,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:34:45,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:34:45,655 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:34:45,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:34:45,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:34:45,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:34:45,662 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:34:45,662 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:34:45,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:34:45,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:34:45,664 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:34:45,665 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:34:45,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:34:45,666 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:34:45,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:34:45,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:34:45,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:34:45,668 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.epf [2018-01-24 12:34:45,677 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:34:45,678 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:34:45,679 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:34:45,679 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:34:45,679 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:34:45,679 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:34:45,680 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:34:45,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:34:45,680 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:34:45,681 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:34:45,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:34:45,681 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:34:45,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:34:45,681 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:34:45,682 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:34:45,682 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:34:45,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:34:45,682 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:34:45,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:34:45,683 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:34:45,683 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:34:45,683 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:34:45,683 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:34:45,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:34:45,684 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:34:45,684 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:34:45,684 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:34:45,684 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:34:45,684 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:34:45,685 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:34:45,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:34:45,685 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:34:45,686 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:34:45,686 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:34:45,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:34:45,738 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:34:45,742 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:34:45,744 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:34:45,745 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:34:45,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:34:45,927 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:34:45,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:34:45,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:34:45,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:34:45,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:34:45,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:34:45" (1/1) ... [2018-01-24 12:34:45,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ce22e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:45, skipping insertion in model container [2018-01-24 12:34:45,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:34:45" (1/1) ... [2018-01-24 12:34:45,970 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:34:46,013 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:34:46,138 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:34:46,156 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:34:46,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46 WrapperNode [2018-01-24 12:34:46,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:34:46,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:34:46,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:34:46,164 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:34:46,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46" (1/1) ... [2018-01-24 12:34:46,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46" (1/1) ... [2018-01-24 12:34:46,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46" (1/1) ... [2018-01-24 12:34:46,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46" (1/1) ... [2018-01-24 12:34:46,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46" (1/1) ... [2018-01-24 12:34:46,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46" (1/1) ... [2018-01-24 12:34:46,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46" (1/1) ... [2018-01-24 12:34:46,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:34:46,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:34:46,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:34:46,206 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:34:46,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46" (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-24 12:34:46,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:34:46,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:34:46,259 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:34:46,259 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:34:46,260 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:34:46,260 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:34:46,260 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:34:46,260 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:34:46,260 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:34:46,260 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:34:46,261 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:34:46,261 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:34:46,261 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:34:46,261 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 12:34:46,261 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:34:46,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:34:46,262 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:34:46,743 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:34:46,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:34:46 BoogieIcfgContainer [2018-01-24 12:34:46,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:34:46,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:34:46,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:34:46,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:34:46,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:34:45" (1/3) ... [2018-01-24 12:34:46,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a63ab2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:34:46, skipping insertion in model container [2018-01-24 12:34:46,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:34:46" (2/3) ... [2018-01-24 12:34:46,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a63ab2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:34:46, skipping insertion in model container [2018-01-24 12:34:46,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:34:46" (3/3) ... [2018-01-24 12:34:46,753 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:34:46,763 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:34:46,772 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-01-24 12:34:46,828 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:34:46,828 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:34:46,828 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:34:46,828 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:34:46,828 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:34:46,829 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:34:46,829 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:34:46,829 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:34:46,830 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:34:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-01-24 12:34:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:34:46,862 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:46,863 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:34:46,863 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash 414289043, now seen corresponding path program 1 times [2018-01-24 12:34:46,871 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:46,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:46,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:46,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:46,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:46,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:47,060 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-24 12:34:47,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:47,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:34:47,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:34:47,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:34:47,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:34:47,085 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2018-01-24 12:34:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:47,358 INFO L93 Difference]: Finished difference Result 222 states and 262 transitions. [2018-01-24 12:34:47,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:34:47,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:34:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:47,368 INFO L225 Difference]: With dead ends: 222 [2018-01-24 12:34:47,369 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 12:34:47,372 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:34:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 12:34:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-01-24 12:34:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 12:34:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-24 12:34:47,413 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 8 [2018-01-24 12:34:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:47,413 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-24 12:34:47,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:34:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-24 12:34:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:34:47,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:47,414 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:34:47,414 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:47,415 INFO L82 PathProgramCache]: Analyzing trace with hash 414289044, now seen corresponding path program 1 times [2018-01-24 12:34:47,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:47,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:47,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:47,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:47,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:47,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:47,505 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-24 12:34:47,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:47,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:34:47,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:34:47,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:34:47,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:34:47,507 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 4 states. [2018-01-24 12:34:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:47,641 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-01-24 12:34:47,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:34:47,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:34:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:47,643 INFO L225 Difference]: With dead ends: 116 [2018-01-24 12:34:47,643 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 12:34:47,644 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:34:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 12:34:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-01-24 12:34:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-24 12:34:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-24 12:34:47,655 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-01-24 12:34:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:47,656 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-24 12:34:47,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:34:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-24 12:34:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:34:47,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:47,657 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:34:47,657 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:47,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556376, now seen corresponding path program 1 times [2018-01-24 12:34:47,657 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:47,657 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:47,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:47,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:47,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:47,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:47,730 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-24 12:34:47,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:47,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:34:47,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:34:47,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:34:47,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:34:47,732 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-01-24 12:34:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:47,876 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-01-24 12:34:47,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:34:47,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 12:34:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:47,878 INFO L225 Difference]: With dead ends: 107 [2018-01-24 12:34:47,878 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 12:34:47,879 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:34:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 12:34:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-01-24 12:34:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:34:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-24 12:34:47,889 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2018-01-24 12:34:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:47,889 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-24 12:34:47,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:34:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-24 12:34:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:34:47,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:47,890 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:34:47,890 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:47,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556377, now seen corresponding path program 1 times [2018-01-24 12:34:47,891 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:47,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:47,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:47,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:47,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:47,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:48,036 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-24 12:34:48,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:48,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:34:48,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:34:48,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:34:48,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:34:48,038 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-01-24 12:34:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:48,209 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-24 12:34:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:34:48,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 12:34:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:48,210 INFO L225 Difference]: With dead ends: 117 [2018-01-24 12:34:48,211 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 12:34:48,211 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:34:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 12:34:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-01-24 12:34:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 12:34:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-24 12:34:48,220 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2018-01-24 12:34:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:48,221 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-24 12:34:48,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:34:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-24 12:34:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:34:48,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:48,222 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:34:48,222 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426684, now seen corresponding path program 1 times [2018-01-24 12:34:48,223 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:48,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:48,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:48,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:48,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:48,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:48,313 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-24 12:34:48,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:48,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:34:48,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:34:48,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:34:48,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:34:48,314 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-01-24 12:34:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:48,578 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-24 12:34:48,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:34:48,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 12:34:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:48,580 INFO L225 Difference]: With dead ends: 146 [2018-01-24 12:34:48,580 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 12:34:48,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:34:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 12:34:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2018-01-24 12:34:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 12:34:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-24 12:34:48,587 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 18 [2018-01-24 12:34:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:48,588 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-24 12:34:48,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:34:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-24 12:34:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:34:48,589 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:48,589 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:34:48,589 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426685, now seen corresponding path program 1 times [2018-01-24 12:34:48,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:48,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:48,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:48,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:48,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:48,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:48,668 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-24 12:34:48,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:48,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:34:48,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:34:48,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:34:48,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:34:48,670 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 5 states. [2018-01-24 12:34:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:48,869 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-24 12:34:48,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:34:48,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 12:34:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:48,870 INFO L225 Difference]: With dead ends: 142 [2018-01-24 12:34:48,870 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 12:34:48,871 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:34:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 12:34:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2018-01-24 12:34:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 12:34:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-24 12:34:48,881 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 18 [2018-01-24 12:34:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:48,881 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-24 12:34:48,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:34:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-24 12:34:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:34:48,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:48,882 INFO L322 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] [2018-01-24 12:34:48,882 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:48,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867382, now seen corresponding path program 1 times [2018-01-24 12:34:48,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:48,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:48,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:48,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:48,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:48,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:49,119 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-24 12:34:49,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:49,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:34:49,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:34:49,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:34:49,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:34:49,120 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 10 states. [2018-01-24 12:34:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:49,443 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-24 12:34:49,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:34:49,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 12:34:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:49,444 INFO L225 Difference]: With dead ends: 140 [2018-01-24 12:34:49,445 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 12:34:49,445 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:34:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 12:34:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2018-01-24 12:34:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 12:34:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-24 12:34:49,453 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 22 [2018-01-24 12:34:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:49,453 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-24 12:34:49,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:34:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-24 12:34:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:34:49,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:49,454 INFO L322 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] [2018-01-24 12:34:49,454 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:49,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867381, now seen corresponding path program 1 times [2018-01-24 12:34:49,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:49,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:49,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:49,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:49,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:49,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:49,686 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-24 12:34:49,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:49,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:34:49,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:34:49,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:34:49,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:34:49,688 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2018-01-24 12:34:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:49,986 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-24 12:34:49,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:34:49,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 12:34:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:49,987 INFO L225 Difference]: With dead ends: 177 [2018-01-24 12:34:49,988 INFO L226 Difference]: Without dead ends: 172 [2018-01-24 12:34:49,988 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:34:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-24 12:34:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2018-01-24 12:34:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-24 12:34:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-01-24 12:34:49,999 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2018-01-24 12:34:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:50,000 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-01-24 12:34:50,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:34:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-01-24 12:34:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:34:50,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:50,001 INFO L322 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] [2018-01-24 12:34:50,001 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:50,001 INFO L82 PathProgramCache]: Analyzing trace with hash 687906629, now seen corresponding path program 1 times [2018-01-24 12:34:50,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:50,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:50,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:50,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:50,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:50,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:50,131 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-24 12:34:50,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:50,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:34:50,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:34:50,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:34:50,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:34:50,132 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 9 states. [2018-01-24 12:34:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:50,559 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-24 12:34:50,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:34:50,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 12:34:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:50,561 INFO L225 Difference]: With dead ends: 123 [2018-01-24 12:34:50,561 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 12:34:50,562 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:34:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 12:34:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-01-24 12:34:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 12:34:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-01-24 12:34:50,570 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 22 [2018-01-24 12:34:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:50,570 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-01-24 12:34:50,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:34:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-01-24 12:34:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:34:50,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:50,571 INFO L322 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] [2018-01-24 12:34:50,572 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:50,572 INFO L82 PathProgramCache]: Analyzing trace with hash 687906630, now seen corresponding path program 1 times [2018-01-24 12:34:50,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:50,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:50,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:50,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:50,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:50,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:50,758 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-24 12:34:50,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:50,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:34:50,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:34:50,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:34:50,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:34:50,759 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2018-01-24 12:34:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:51,406 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-24 12:34:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:34:51,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 12:34:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:51,407 INFO L225 Difference]: With dead ends: 123 [2018-01-24 12:34:51,407 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 12:34:51,408 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:34:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 12:34:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2018-01-24 12:34:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 12:34:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-24 12:34:51,416 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 22 [2018-01-24 12:34:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:51,416 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-24 12:34:51,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:34:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-24 12:34:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:34:51,417 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:51,417 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:34:51,417 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:51,418 INFO L82 PathProgramCache]: Analyzing trace with hash 36223985, now seen corresponding path program 1 times [2018-01-24 12:34:51,418 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:51,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:51,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:51,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:51,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:51,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:51,603 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-24 12:34:51,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:51,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:34:51,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:34:51,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:34:51,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:34:51,604 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 10 states. [2018-01-24 12:34:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:51,963 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-01-24 12:34:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:34:51,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-24 12:34:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:51,965 INFO L225 Difference]: With dead ends: 147 [2018-01-24 12:34:51,965 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 12:34:51,965 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:34:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 12:34:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2018-01-24 12:34:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 12:34:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-01-24 12:34:51,971 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 26 [2018-01-24 12:34:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:51,971 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-01-24 12:34:51,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:34:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-01-24 12:34:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:34:51,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:51,973 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:34:51,973 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash 36223986, now seen corresponding path program 1 times [2018-01-24 12:34:51,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:51,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:51,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:51,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:51,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:51,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:52,332 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-24 12:34:52,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:52,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:34:52,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:34:52,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:34:52,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:34:52,334 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 9 states. [2018-01-24 12:34:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:52,658 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-01-24 12:34:52,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:34:52,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 12:34:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:52,659 INFO L225 Difference]: With dead ends: 159 [2018-01-24 12:34:52,659 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 12:34:52,660 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:34:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 12:34:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2018-01-24 12:34:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 12:34:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-01-24 12:34:52,666 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 26 [2018-01-24 12:34:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:52,666 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-01-24 12:34:52,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:34:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-01-24 12:34:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:34:52,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:52,667 INFO L322 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] [2018-01-24 12:34:52,667 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:52,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483890, now seen corresponding path program 1 times [2018-01-24 12:34:52,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:52,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:52,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:52,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:52,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:52,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:52,742 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-24 12:34:52,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:52,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:34:52,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:34:52,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:34:52,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:34:52,743 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-01-24 12:34:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:52,988 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-01-24 12:34:52,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:34:52,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 12:34:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:52,990 INFO L225 Difference]: With dead ends: 140 [2018-01-24 12:34:52,990 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 12:34:52,991 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:34:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 12:34:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2018-01-24 12:34:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 12:34:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-24 12:34:53,001 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2018-01-24 12:34:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:53,001 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-24 12:34:53,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:34:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-24 12:34:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:34:53,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:53,003 INFO L322 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] [2018-01-24 12:34:53,003 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483891, now seen corresponding path program 1 times [2018-01-24 12:34:53,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:53,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:53,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:53,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:53,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:53,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:53,467 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-24 12:34:53,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:53,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:34:53,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:34:53,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:34:53,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:34:53,468 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 11 states. [2018-01-24 12:34:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:53,973 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2018-01-24 12:34:53,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:34:53,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-24 12:34:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:53,974 INFO L225 Difference]: With dead ends: 169 [2018-01-24 12:34:53,974 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 12:34:53,975 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:34:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 12:34:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2018-01-24 12:34:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 12:34:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-01-24 12:34:53,987 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 27 [2018-01-24 12:34:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:53,987 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-01-24 12:34:53,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:34:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-01-24 12:34:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:34:53,988 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:53,988 INFO L322 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] [2018-01-24 12:34:53,988 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash -152260992, now seen corresponding path program 1 times [2018-01-24 12:34:53,988 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:53,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:53,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:53,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:53,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:54,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:54,207 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-24 12:34:54,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:54,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:34:54,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:34:54,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:34:54,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:34:54,208 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 10 states. [2018-01-24 12:34:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:54,667 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-01-24 12:34:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:34:54,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 12:34:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:54,709 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:34:54,709 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 12:34:54,709 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:34:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 12:34:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2018-01-24 12:34:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 12:34:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-01-24 12:34:54,724 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 31 [2018-01-24 12:34:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:54,724 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-01-24 12:34:54,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:34:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-01-24 12:34:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:34:54,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:54,725 INFO L322 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] [2018-01-24 12:34:54,725 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash -771319912, now seen corresponding path program 1 times [2018-01-24 12:34:54,726 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:54,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:54,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:54,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:54,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:54,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:54,940 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-24 12:34:54,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:54,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:34:54,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:34:54,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:34:54,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:34:54,941 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 9 states. [2018-01-24 12:34:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:55,246 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-24 12:34:55,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:34:55,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-24 12:34:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:55,248 INFO L225 Difference]: With dead ends: 154 [2018-01-24 12:34:55,248 INFO L226 Difference]: Without dead ends: 153 [2018-01-24 12:34:55,248 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:34:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-24 12:34:55,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2018-01-24 12:34:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 12:34:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-01-24 12:34:55,259 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2018-01-24 12:34:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:55,260 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-01-24 12:34:55,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:34:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-01-24 12:34:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:34:55,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:55,260 INFO L322 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] [2018-01-24 12:34:55,260 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash -771319913, now seen corresponding path program 1 times [2018-01-24 12:34:55,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:55,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:55,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:55,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:55,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:55,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:34:55,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:55,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:34:55,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:34:55,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:34:55,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:34:55,436 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-01-24 12:34:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:55,748 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-01-24 12:34:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:34:55,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 12:34:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:55,749 INFO L225 Difference]: With dead ends: 148 [2018-01-24 12:34:55,749 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 12:34:55,750 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:34:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 12:34:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-01-24 12:34:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 12:34:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-01-24 12:34:55,758 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2018-01-24 12:34:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:55,758 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2018-01-24 12:34:55,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:34:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2018-01-24 12:34:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:34:55,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:55,759 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 12:34:55,759 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash -246205034, now seen corresponding path program 1 times [2018-01-24 12:34:55,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:55,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:55,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:55,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:55,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:55,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:34:56,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:56,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 12:34:56,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:34:56,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:34:56,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:34:56,070 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 13 states. [2018-01-24 12:34:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:56,386 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-01-24 12:34:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:34:56,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-24 12:34:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:56,387 INFO L225 Difference]: With dead ends: 165 [2018-01-24 12:34:56,387 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 12:34:56,387 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:34:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 12:34:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-01-24 12:34:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 12:34:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-01-24 12:34:56,395 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 33 [2018-01-24 12:34:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:56,395 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-01-24 12:34:56,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:34:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-01-24 12:34:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:34:56,396 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:56,396 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 12:34:56,396 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:56,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590979, now seen corresponding path program 1 times [2018-01-24 12:34:56,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:56,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:56,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:56,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:56,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:56,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:34:56,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:34:56,574 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-24 12:34:56,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:56,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:34:56,722 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 17 treesize of output 13 [2018-01-24 12:34:56,729 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 13 treesize of output 5 [2018-01-24 12:34:56,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:56,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:56,733 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-24 12:34:56,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-24 12:34:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:34:56,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:34:56,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2018-01-24 12:34:56,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:34:56,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:34:56,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:34:56,763 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 12 states. [2018-01-24 12:34:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:57,490 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-24 12:34:57,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:34:57,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-01-24 12:34:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:57,491 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:34:57,491 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 12:34:57,492 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:34:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 12:34:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 131. [2018-01-24 12:34:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 12:34:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2018-01-24 12:34:57,504 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 34 [2018-01-24 12:34:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:57,504 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2018-01-24 12:34:57,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:34:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2018-01-24 12:34:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:34:57,505 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:57,505 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 12:34:57,505 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590978, now seen corresponding path program 1 times [2018-01-24 12:34:57,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:57,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:57,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:57,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:57,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:57,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:34:57,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:34:57,751 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-24 12:34:57,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:57,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:34:57,845 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 23 treesize of output 19 [2018-01-24 12:34:57,846 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 19 treesize of output 11 [2018-01-24 12:34:57,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:57,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:57,852 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-24 12:34:57,854 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 22 treesize of output 13 [2018-01-24 12:34:57,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:57,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:57,859 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-24 12:34:57,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-01-24 12:34:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:34:57,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:34:57,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-01-24 12:34:57,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:34:57,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:34:57,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:34:57,917 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand 14 states. [2018-01-24 12:34:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:58,841 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2018-01-24 12:34:58,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-24 12:34:58,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-01-24 12:34:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:58,842 INFO L225 Difference]: With dead ends: 180 [2018-01-24 12:34:58,842 INFO L226 Difference]: Without dead ends: 175 [2018-01-24 12:34:58,842 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=408, Invalid=1232, Unknown=0, NotChecked=0, Total=1640 [2018-01-24 12:34:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-24 12:34:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 146. [2018-01-24 12:34:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 12:34:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2018-01-24 12:34:58,857 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 34 [2018-01-24 12:34:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:58,857 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2018-01-24 12:34:58,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:34:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2018-01-24 12:34:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:34:58,858 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:58,858 INFO L322 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-24 12:34:58,858 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:58,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1352500762, now seen corresponding path program 1 times [2018-01-24 12:34:58,859 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:58,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:58,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:58,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:58,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:58,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:58,898 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-24 12:34:58,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:34:58,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:34:58,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:34:58,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:34:58,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:34:58,899 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand 3 states. [2018-01-24 12:34:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:34:58,925 INFO L93 Difference]: Finished difference Result 287 states and 324 transitions. [2018-01-24 12:34:58,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:34:58,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-24 12:34:58,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:34:58,928 INFO L225 Difference]: With dead ends: 287 [2018-01-24 12:34:58,929 INFO L226 Difference]: Without dead ends: 216 [2018-01-24 12:34:58,929 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:34:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-01-24 12:34:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 164. [2018-01-24 12:34:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-24 12:34:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2018-01-24 12:34:58,945 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 34 [2018-01-24 12:34:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:34:58,945 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2018-01-24 12:34:58,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:34:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2018-01-24 12:34:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 12:34:58,946 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:34:58,946 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:34:58,946 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:34:58,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1891146596, now seen corresponding path program 1 times [2018-01-24 12:34:58,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:34:58,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:34:58,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:58,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:58,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:34:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:58,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:34:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:34:59,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:34:59,167 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-24 12:34:59,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:34:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:34:59,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:34:59,213 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-24 12:34:59,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:34:59,287 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 11 treesize of output 8 [2018-01-24 12:34:59,290 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 8 treesize of output 7 [2018-01-24 12:34:59,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:34:59,316 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-24 12:34:59,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:34:59,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-01-24 12:34:59,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-01-24 12:34:59,366 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 36 treesize of output 29 [2018-01-24 12:34:59,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:34:59,379 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:34:59,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:34:59,384 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 29 treesize of output 37 [2018-01-24 12:34:59,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2018-01-24 12:34:59,428 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 36 treesize of output 29 [2018-01-24 12:34:59,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:34:59,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:34:59,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:34:59,435 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 29 treesize of output 37 [2018-01-24 12:34:59,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,448 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-24 12:34:59,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:30 [2018-01-24 12:34:59,525 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:34:59,526 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 0 case distinctions, treesize of input 13 treesize of output 7 [2018-01-24 12:34:59,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:30 [2018-01-24 12:34:59,600 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 37 treesize of output 27 [2018-01-24 12:34:59,601 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:34:59,602 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 0 case distinctions, treesize of input 27 treesize of output 17 [2018-01-24 12:34:59,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,611 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-24 12:34:59,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2018-01-24 12:34:59,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-01-24 12:34:59,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-01-24 12:34:59,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:34:59,679 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-24 12:34:59,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:5 [2018-01-24 12:34:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:34:59,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:34:59,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-01-24 12:34:59,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:34:59,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:34:59,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=435, Unknown=8, NotChecked=0, Total=506 [2018-01-24 12:34:59,714 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand 23 states. [2018-01-24 12:35:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:01,141 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2018-01-24 12:35:01,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:35:01,141 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2018-01-24 12:35:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:01,142 INFO L225 Difference]: With dead ends: 187 [2018-01-24 12:35:01,142 INFO L226 Difference]: Without dead ends: 186 [2018-01-24 12:35:01,143 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=1065, Unknown=15, NotChecked=0, Total=1406 [2018-01-24 12:35:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-24 12:35:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 164. [2018-01-24 12:35:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-24 12:35:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 189 transitions. [2018-01-24 12:35:01,159 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 189 transitions. Word has length 38 [2018-01-24 12:35:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:01,159 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 189 transitions. [2018-01-24 12:35:01,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:35:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 189 transitions. [2018-01-24 12:35:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 12:35:01,160 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:01,160 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:01,161 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1891146597, now seen corresponding path program 1 times [2018-01-24 12:35:01,161 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:01,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:01,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:01,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:01,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:01,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:01,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:35:01,516 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-24 12:35:01,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:01,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:35:01,554 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 11 treesize of output 8 [2018-01-24 12:35:01,556 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 8 treesize of output 7 [2018-01-24 12:35:01,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,618 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 11 treesize of output 8 [2018-01-24 12:35:01,627 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 8 treesize of output 7 [2018-01-24 12:35:01,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-01-24 12:35:01,713 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-24 12:35:01,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-01-24 12:35:01,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,740 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-24 12:35:01,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-01-24 12:35:01,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-01-24 12:35:01,796 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 36 treesize of output 29 [2018-01-24 12:35:01,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,813 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 29 treesize of output 37 [2018-01-24 12:35:01,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,848 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 36 treesize of output 29 [2018-01-24 12:35:01,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,857 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 29 treesize of output 37 [2018-01-24 12:35:01,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2018-01-24 12:35:01,913 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 36 treesize of output 29 [2018-01-24 12:35:01,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,938 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 29 treesize of output 37 [2018-01-24 12:35:01,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,957 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 36 treesize of output 29 [2018-01-24 12:35:01,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:01,964 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 29 treesize of output 37 [2018-01-24 12:35:01,964 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:01,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:33 [2018-01-24 12:35:02,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-01-24 12:35:02,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:02,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-24 12:35:02,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:02,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:02,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-24 12:35:02,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:02,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2018-01-24 12:35:02,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:02,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:02,240 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-24 12:35:02,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:13 [2018-01-24 12:35:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:35:02,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:35:02,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-01-24 12:35:02,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:35:02,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:35:02,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:35:02,316 INFO L87 Difference]: Start difference. First operand 164 states and 189 transitions. Second operand 19 states. [2018-01-24 12:35:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:03,625 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2018-01-24 12:35:03,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:35:03,625 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-01-24 12:35:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:03,626 INFO L225 Difference]: With dead ends: 180 [2018-01-24 12:35:03,626 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 12:35:03,627 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=643, Unknown=1, NotChecked=0, Total=812 [2018-01-24 12:35:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 12:35:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 155. [2018-01-24 12:35:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 12:35:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2018-01-24 12:35:03,643 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 38 [2018-01-24 12:35:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:03,644 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2018-01-24 12:35:03,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:35:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2018-01-24 12:35:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:35:03,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:03,645 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:03,645 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash 102012898, now seen corresponding path program 1 times [2018-01-24 12:35:03,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:03,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:03,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:03,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:03,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:03,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:03,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:35:03,834 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-24 12:35:03,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:03,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:35:03,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:03,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:03,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-24 12:35:03,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:03,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:03,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-24 12:35:03,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:35:03,899 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 8 treesize of output 7 [2018-01-24 12:35:03,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:03,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:03,907 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-24 12:35:03,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-24 12:35:03,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:03,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-01-24 12:35:03,946 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 14 treesize of output 13 [2018-01-24 12:35:03,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:03,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:03,959 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-24 12:35:03,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-01-24 12:35:04,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-01-24 12:35:04,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 16 treesize of output 17 [2018-01-24 12:35:04,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:04,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:04,042 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-24 12:35:04,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-01-24 12:35:06,065 WARN L143 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 26 [2018-01-24 12:35:06,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:06,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-01-24 12:35:06,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:06,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2018-01-24 12:35:06,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:35:06,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:35:06,125 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 2 xjuncts. [2018-01-24 12:35:06,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:76 [2018-01-24 12:35:22,205 WARN L146 SmtUtils]: Spent 12058ms on a formula simplification. DAG size of input: 28 DAG size of output 20 [2018-01-24 12:35:22,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-01-24 12:35:22,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 30 treesize of output 18 [2018-01-24 12:35:22,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,228 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-24 12:35:22,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-01-24 12:35:22,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-01-24 12:35:22,259 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 19 treesize of output 10 [2018-01-24 12:35:22,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,264 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 5 treesize of output 1 [2018-01-24 12:35:22,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:35:22,271 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-01-24 12:35:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:22,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:35:22,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 [2018-01-24 12:35:22,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:35:22,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:35:22,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=399, Unknown=2, NotChecked=0, Total=506 [2018-01-24 12:35:22,344 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand 23 states. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown