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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:12:43,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:12:43,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:12:43,216 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:12:43,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:12:43,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:12:43,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:12:43,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:12:43,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:12:43,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:12:43,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:12:43,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:12:43,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:12:43,228 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:12:43,229 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:12:43,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:12:43,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:12:43,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:12:43,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:12:43,239 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:12:43,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:12:43,241 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:12:43,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:12:43,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:12:43,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:12:43,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:12:43,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:12:43,246 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:12:43,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:12:43,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:12:43,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:12:43,247 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:12:43,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:12:43,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:12:43,257 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:12:43,258 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:12:43,258 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:12:43,258 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:12:43,258 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:12:43,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:12:43,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:12:43,259 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:12:43,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:12:43,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:12:43,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:12:43,260 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:12:43,260 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:12:43,261 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:12:43,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:12:43,261 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:12:43,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:12:43,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:12:43,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:12:43,262 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:12:43,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:12:43,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:12:43,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:12:43,263 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:12:43,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:12:43,263 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:12:43,263 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:12:43,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:12:43,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:12:43,264 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:12:43,265 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:12:43,265 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:12:43,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:12:43,317 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:12:43,322 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:12:43,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:12:43,324 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:12:43,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-24 12:12:43,524 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:12:43,530 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:12:43,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:12:43,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:12:43,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:12:43,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:12:43" (1/1) ... [2018-01-24 12:12:43,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d68a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43, skipping insertion in model container [2018-01-24 12:12:43,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:12:43" (1/1) ... [2018-01-24 12:12:43,584 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:12:43,625 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:12:43,745 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:12:43,763 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:12:43,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43 WrapperNode [2018-01-24 12:12:43,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:12:43,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:12:43,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:12:43,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:12:43,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43" (1/1) ... [2018-01-24 12:12:43,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43" (1/1) ... [2018-01-24 12:12:43,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43" (1/1) ... [2018-01-24 12:12:43,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43" (1/1) ... [2018-01-24 12:12:43,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43" (1/1) ... [2018-01-24 12:12:43,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43" (1/1) ... [2018-01-24 12:12:43,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43" (1/1) ... [2018-01-24 12:12:43,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:12:43,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:12:43,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:12:43,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:12:43,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43" (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:12:43,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:12:43,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:12:43,859 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 12:12:43,859 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:12:43,859 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:12:43,860 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:12:43,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:12:43,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:12:43,860 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:12:43,860 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:12:43,860 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:12:43,861 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:12:43,861 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 12:12:43,861 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:12:43,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:12:43,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:12:44,065 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:12:44,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:12:44 BoogieIcfgContainer [2018-01-24 12:12:44,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:12:44,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:12:44,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:12:44,067 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:12:44,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:12:43" (1/3) ... [2018-01-24 12:12:44,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112ab8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:12:44, skipping insertion in model container [2018-01-24 12:12:44,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:43" (2/3) ... [2018-01-24 12:12:44,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112ab8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:12:44, skipping insertion in model container [2018-01-24 12:12:44,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:12:44" (3/3) ... [2018-01-24 12:12:44,070 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-24 12:12:44,077 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:12:44,084 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 12:12:44,130 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:12:44,131 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:12:44,131 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:12:44,131 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:12:44,131 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:12:44,131 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:12:44,131 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:12:44,132 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:12:44,132 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:12:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-24 12:12:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 12:12:44,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:44,160 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:44,160 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1159416495, now seen corresponding path program 1 times [2018-01-24 12:12:44,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:44,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:44,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:44,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:44,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:44,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:44,300 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:12:44,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:44,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:12:44,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 12:12:44,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 12:12:44,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 12:12:44,320 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-24 12:12:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:44,346 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-01-24 12:12:44,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 12:12:44,348 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-24 12:12:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:44,355 INFO L225 Difference]: With dead ends: 109 [2018-01-24 12:12:44,356 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 12:12:44,360 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 12:12:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 12:12:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-24 12:12:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 12:12:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 12:12:44,473 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2018-01-24 12:12:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:44,473 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 12:12:44,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 12:12:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 12:12:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:12:44,474 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:44,475 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:44,475 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:44,475 INFO L82 PathProgramCache]: Analyzing trace with hash 91943959, now seen corresponding path program 1 times [2018-01-24 12:12:44,475 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:44,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:44,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:44,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:44,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:44,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:44,569 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:12:44,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:44,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:12:44,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:12:44,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:12:44,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:12:44,573 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 4 states. [2018-01-24 12:12:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:44,690 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-01-24 12:12:44,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:12:44,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:12:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:44,691 INFO L225 Difference]: With dead ends: 56 [2018-01-24 12:12:44,692 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 12:12:44,693 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:12:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 12:12:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 12:12:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 12:12:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 12:12:44,701 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 14 [2018-01-24 12:12:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:44,701 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 12:12:44,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:12:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 12:12:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:12:44,702 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:44,702 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:44,703 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash 91943960, now seen corresponding path program 1 times [2018-01-24 12:12:44,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:44,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:44,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:44,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:44,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:44,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:44,811 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:12:44,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:44,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:12:44,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:12:44,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:12:44,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:12:44,813 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-01-24 12:12:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:44,933 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-01-24 12:12:44,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:12:44,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:12:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:44,935 INFO L225 Difference]: With dead ends: 55 [2018-01-24 12:12:44,935 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 12:12:44,936 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:12:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 12:12:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 12:12:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 12:12:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-24 12:12:44,943 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 14 [2018-01-24 12:12:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:44,943 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-24 12:12:44,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:12:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-24 12:12:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:12:44,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:44,944 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] [2018-01-24 12:12:44,945 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:44,945 INFO L82 PathProgramCache]: Analyzing trace with hash -255124515, now seen corresponding path program 1 times [2018-01-24 12:12:44,945 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:44,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:44,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:44,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:44,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:44,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:45,055 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:12:45,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:45,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:12:45,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:12:45,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:12:45,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:12:45,056 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-01-24 12:12:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:45,163 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-01-24 12:12:45,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:12:45,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 12:12:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:45,164 INFO L225 Difference]: With dead ends: 54 [2018-01-24 12:12:45,165 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 12:12:45,165 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:12:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 12:12:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 12:12:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 12:12:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-24 12:12:45,171 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-01-24 12:12:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:45,171 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-24 12:12:45,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:12:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-24 12:12:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:12:45,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:45,172 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] [2018-01-24 12:12:45,172 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:45,172 INFO L82 PathProgramCache]: Analyzing trace with hash -255124514, now seen corresponding path program 1 times [2018-01-24 12:12:45,172 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:45,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:45,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:45,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:45,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:45,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:45,303 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:12:45,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:45,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:12:45,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:12:45,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:12:45,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:12:45,305 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 7 states. [2018-01-24 12:12:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:45,451 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-24 12:12:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:12:45,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 12:12:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:45,454 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:12:45,455 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 12:12:45,455 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:12:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 12:12:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-01-24 12:12:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 12:12:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 12:12:45,461 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-01-24 12:12:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:45,462 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 12:12:45,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:12:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 12:12:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:12:45,462 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:45,463 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] [2018-01-24 12:12:45,463 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash 468265909, now seen corresponding path program 1 times [2018-01-24 12:12:45,463 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:45,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:45,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:45,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:45,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:45,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:45,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:45,550 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:12:45,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:45,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:45,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:12:45,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-01-24 12:12:45,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:12:45,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:12:45,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:12:45,688 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 9 states. [2018-01-24 12:12:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:45,932 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-01-24 12:12:45,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:12:45,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 12:12:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:45,934 INFO L225 Difference]: With dead ends: 124 [2018-01-24 12:12:45,934 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:12:45,935 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:12:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:12:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-01-24 12:12:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 12:12:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-24 12:12:45,945 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-01-24 12:12:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:45,945 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-24 12:12:45,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:12:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-24 12:12:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:12:45,946 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:45,947 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:45,947 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:45,947 INFO L82 PathProgramCache]: Analyzing trace with hash -504403376, now seen corresponding path program 1 times [2018-01-24 12:12:45,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:45,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:45,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:45,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:45,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:45,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:46,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:46,199 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:12:46,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:46,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:46,288 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:12:46,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:46,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:46,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 12:12:46,361 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 15 [2018-01-24 12:12:46,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:46,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:12:46,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-24 12:12:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:46,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:12:46,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-01-24 12:12:46,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:12:46,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:12:46,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:12:46,498 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 13 states. [2018-01-24 12:12:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:46,922 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-24 12:12:46,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:12:46,922 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-01-24 12:12:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:46,923 INFO L225 Difference]: With dead ends: 139 [2018-01-24 12:12:46,924 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 12:12:46,924 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:12:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 12:12:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2018-01-24 12:12:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 12:12:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-01-24 12:12:46,936 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 27 [2018-01-24 12:12:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:46,936 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-01-24 12:12:46,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:12:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-01-24 12:12:46,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:12:46,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:46,938 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] [2018-01-24 12:12:46,938 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:46,938 INFO L82 PathProgramCache]: Analyzing trace with hash 616992647, now seen corresponding path program 1 times [2018-01-24 12:12:46,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:46,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:46,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:46,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:46,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:46,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:12:46,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:46,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:12:46,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:12:46,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:12:46,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:12:46,993 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 4 states. [2018-01-24 12:12:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:47,093 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-24 12:12:47,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:12:47,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 12:12:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:47,094 INFO L225 Difference]: With dead ends: 80 [2018-01-24 12:12:47,095 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 12:12:47,095 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:12:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 12:12:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 12:12:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:12:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-24 12:12:47,104 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2018-01-24 12:12:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:47,104 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-24 12:12:47,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:12:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-24 12:12:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:12:47,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:47,106 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] [2018-01-24 12:12:47,106 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash 616992648, now seen corresponding path program 1 times [2018-01-24 12:12:47,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:47,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:47,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:47,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:47,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:47,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:12:47,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:47,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:12:47,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:12:47,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:12:47,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:12:47,302 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-01-24 12:12:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:47,488 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-01-24 12:12:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:12:47,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-24 12:12:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:47,489 INFO L225 Difference]: With dead ends: 80 [2018-01-24 12:12:47,489 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 12:12:47,490 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:12:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 12:12:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-24 12:12:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 12:12:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-24 12:12:47,500 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 29 [2018-01-24 12:12:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:47,500 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-24 12:12:47,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:12:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-24 12:12:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:12:47,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:47,501 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] [2018-01-24 12:12:47,501 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:47,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1946902913, now seen corresponding path program 1 times [2018-01-24 12:12:47,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:47,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:47,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:47,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:47,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:47,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:12:47,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:47,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:12:47,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:12:47,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:12:47,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:12:47,560 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 4 states. [2018-01-24 12:12:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:47,741 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-01-24 12:12:47,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:12:47,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-24 12:12:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:47,742 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:12:47,742 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 12:12:47,743 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:12:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 12:12:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-01-24 12:12:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:12:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-24 12:12:47,753 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 30 [2018-01-24 12:12:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:47,754 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-24 12:12:47,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:12:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-24 12:12:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:12:47,755 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:47,755 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:47,755 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:47,756 INFO L82 PathProgramCache]: Analyzing trace with hash 746385703, now seen corresponding path program 2 times [2018-01-24 12:12:47,756 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:47,756 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:47,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:47,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:47,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:47,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:47,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:47,856 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:12:47,861 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:12:47,874 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:12:47,878 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:12:47,879 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:12:47,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:47,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:12:47,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-01-24 12:12:47,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:12:47,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:12:47,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:12:47,934 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2018-01-24 12:12:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:48,158 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2018-01-24 12:12:48,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:12:48,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-01-24 12:12:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:48,159 INFO L225 Difference]: With dead ends: 166 [2018-01-24 12:12:48,159 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 12:12:48,160 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:12:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 12:12:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-01-24 12:12:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 12:12:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-01-24 12:12:48,171 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2018-01-24 12:12:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:48,172 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-01-24 12:12:48,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:12:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-01-24 12:12:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:12:48,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:48,173 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:12:48,173 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:48,173 INFO L82 PathProgramCache]: Analyzing trace with hash 946337879, now seen corresponding path program 1 times [2018-01-24 12:12:48,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:48,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:48,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:48,174 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:12:48,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:48,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:12:48,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:48,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:12:48,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:12:48,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:12:48,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:12:48,237 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 6 states. [2018-01-24 12:12:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:48,310 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-24 12:12:48,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:12:48,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-24 12:12:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:48,312 INFO L225 Difference]: With dead ends: 108 [2018-01-24 12:12:48,312 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 12:12:48,313 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:12:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 12:12:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-01-24 12:12:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 12:12:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-01-24 12:12:48,328 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 33 [2018-01-24 12:12:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:48,328 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-01-24 12:12:48,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:12:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-01-24 12:12:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:12:48,330 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:48,330 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:12:48,330 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash 946337880, now seen corresponding path program 1 times [2018-01-24 12:12:48,330 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:48,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:48,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:48,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:48,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:48,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:12:48,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:48,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:12:48,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:12:48,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:12:48,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:12:48,468 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 8 states. [2018-01-24 12:12:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:48,657 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-01-24 12:12:48,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:12:48,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-01-24 12:12:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:48,658 INFO L225 Difference]: With dead ends: 107 [2018-01-24 12:12:48,658 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 12:12:48,659 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:12:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 12:12:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-24 12:12:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 12:12:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-24 12:12:48,667 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 33 [2018-01-24 12:12:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:48,667 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-24 12:12:48,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:12:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-24 12:12:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:12:48,668 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:48,668 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:12:48,668 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash 946329935, now seen corresponding path program 1 times [2018-01-24 12:12:48,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:48,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:48,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:48,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:48,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:48,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:49,054 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:12:49,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:49,055 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:12:49,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:49,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:49,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:12:49,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-24 12:12:49,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:49,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:49,140 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:12:49,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-24 12:12:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:12:49,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:12:49,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2018-01-24 12:12:49,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:12:49,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:12:49,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:12:49,172 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 16 states. [2018-01-24 12:12:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:49,656 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-01-24 12:12:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:12:49,656 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-01-24 12:12:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:49,657 INFO L225 Difference]: With dead ends: 116 [2018-01-24 12:12:49,657 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 12:12:49,658 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:12:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 12:12:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-01-24 12:12:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 12:12:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-24 12:12:49,668 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 33 [2018-01-24 12:12:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:49,668 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-24 12:12:49,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:12:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-24 12:12:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:12:49,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:49,669 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-24 12:12:49,669 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash 529142380, now seen corresponding path program 1 times [2018-01-24 12:12:49,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:49,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:49,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:49,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:49,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:49,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:12:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 12:12:49,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:49,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:12:49,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:12:49,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:12:49,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:12:49,864 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-01-24 12:12:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:50,007 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-01-24 12:12:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:12:50,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-24 12:12:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:50,008 INFO L225 Difference]: With dead ends: 114 [2018-01-24 12:12:50,008 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 12:12:50,009 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:12:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 12:12:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-01-24 12:12:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 12:12:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-01-24 12:12:50,020 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 34 [2018-01-24 12:12:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:50,020 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-01-24 12:12:50,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:12:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-01-24 12:12:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:12:50,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:50,021 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:50,022 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 569056812, now seen corresponding path program 3 times [2018-01-24 12:12:50,022 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:50,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:50,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:50,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:50,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:50,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 12:12:50,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:50,122 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:12:50,134 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:12:50,152 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:12:50,158 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:12:50,159 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:12:50,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:50,169 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:12:50,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:50,176 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:12:50,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:50,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:50,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 12:12:50,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:50,244 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 19 [2018-01-24 12:12:50,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:50,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:50,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:50,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:12:50,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:50,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:50,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 12:12:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 12:12:50,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:12:50,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-01-24 12:12:50,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:12:50,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:12:50,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:12:50,420 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 14 states. [2018-01-24 12:12:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:50,791 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-01-24 12:12:50,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:12:50,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-01-24 12:12:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:50,792 INFO L225 Difference]: With dead ends: 108 [2018-01-24 12:12:50,792 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 12:12:50,792 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:12:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 12:12:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-01-24 12:12:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 12:12:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-01-24 12:12:50,804 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 34 [2018-01-24 12:12:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:50,804 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-01-24 12:12:50,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:12:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-01-24 12:12:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:12:50,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:50,805 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, 1] [2018-01-24 12:12:50,805 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1102363112, now seen corresponding path program 1 times [2018-01-24 12:12:50,805 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:50,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:50,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:50,806 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:12:50,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:50,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:12:51,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:51,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:12:51,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:12:51,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:12:51,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:12:51,019 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 9 states. [2018-01-24 12:12:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:51,235 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-01-24 12:12:51,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:12:51,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-24 12:12:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:51,236 INFO L225 Difference]: With dead ends: 105 [2018-01-24 12:12:51,236 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 12:12:51,236 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:12:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 12:12:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-24 12:12:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:12:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-24 12:12:51,244 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 35 [2018-01-24 12:12:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:51,245 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-24 12:12:51,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:12:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-24 12:12:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:12:51,245 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:51,245 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:51,245 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash 984721596, now seen corresponding path program 1 times [2018-01-24 12:12:51,246 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:51,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:51,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:51,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:51,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:51,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 12:12:51,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:51,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:12:51,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:12:51,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:12:51,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:12:51,330 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-01-24 12:12:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:51,430 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-01-24 12:12:51,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:12:51,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-24 12:12:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:51,431 INFO L225 Difference]: With dead ends: 78 [2018-01-24 12:12:51,431 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 12:12:51,432 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:12:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 12:12:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 12:12:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:12:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-24 12:12:51,441 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 41 [2018-01-24 12:12:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:51,441 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-24 12:12:51,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:12:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-24 12:12:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:12:51,442 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:51,442 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:51,442 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:51,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1657687266, now seen corresponding path program 1 times [2018-01-24 12:12:51,442 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:51,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:51,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:51,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:51,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:51,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:12:51,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:51,513 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:12:51,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:51,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:12:51,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:12:51,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-01-24 12:12:51,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:12:51,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:12:51,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:12:51,635 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 11 states. [2018-01-24 12:12:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:51,815 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-01-24 12:12:51,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:12:51,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-24 12:12:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:51,817 INFO L225 Difference]: With dead ends: 119 [2018-01-24 12:12:51,817 INFO L226 Difference]: Without dead ends: 102 [2018-01-24 12:12:51,817 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:12:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-24 12:12:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-01-24 12:12:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 12:12:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-01-24 12:12:51,832 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 41 [2018-01-24 12:12:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:51,833 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-01-24 12:12:51,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:12:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-01-24 12:12:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:12:51,834 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:51,834 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:51,834 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1214448692, now seen corresponding path program 1 times [2018-01-24 12:12:51,834 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:51,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:51,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:51,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:51,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:51,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:52,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:52,549 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:12:52,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:52,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:52,582 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:12:52,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:12:52,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:52,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:52,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:12:52,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-24 12:12:52,700 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:12:52,702 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:12:52,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:12:52,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2018-01-24 12:12:52,736 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:12:52,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:52,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-01-24 12:12:53,012 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 38 treesize of output 42 [2018-01-24 12:12:53,015 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-24 12:12:53,019 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 22 treesize of output 30 [2018-01-24 12:12:53,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:53,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:53,036 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 41 treesize of output 40 [2018-01-24 12:12:53,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:53,038 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 14 treesize of output 19 [2018-01-24 12:12:53,039 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:53,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:53,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:53,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 12:12:53,060 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:70, output treesize:50 [2018-01-24 12:12:53,160 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 81 treesize of output 63 [2018-01-24 12:12:53,163 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:12:53,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:53,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:53,164 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:12:53,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 81 [2018-01-24 12:12:53,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:53,178 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 52 treesize of output 10 [2018-01-24 12:12:53,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:53,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:53,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:53,187 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:88, output treesize:13 [2018-01-24 12:12:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:53,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:12:53,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 33 [2018-01-24 12:12:53,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 12:12:53,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 12:12:53,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=944, Unknown=17, NotChecked=0, Total=1056 [2018-01-24 12:12:53,240 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 33 states. [2018-01-24 12:12:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:55,172 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-01-24 12:12:55,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 12:12:55,173 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2018-01-24 12:12:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:55,173 INFO L225 Difference]: With dead ends: 98 [2018-01-24 12:12:55,173 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 12:12:55,175 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=389, Invalid=2865, Unknown=52, NotChecked=0, Total=3306 [2018-01-24 12:12:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 12:12:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-01-24 12:12:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 12:12:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-24 12:12:55,182 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2018-01-24 12:12:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:55,182 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-24 12:12:55,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 12:12:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-24 12:12:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 12:12:55,183 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:55,183 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:55,183 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1501091225, now seen corresponding path program 2 times [2018-01-24 12:12:55,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:55,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:55,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:55,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:55,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:55,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-24 12:12:55,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:55,395 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:12:55,406 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:12:55,419 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:12:55,426 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:12:55,428 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:12:55,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:55,435 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:12:55,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:55,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:55,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:12:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-24 12:12:55,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:12:55,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-01-24 12:12:55,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:12:55,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:12:55,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:12:55,516 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 12 states. [2018-01-24 12:12:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:55,661 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-24 12:12:55,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:12:55,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-01-24 12:12:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:55,662 INFO L225 Difference]: With dead ends: 57 [2018-01-24 12:12:55,662 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 12:12:55,662 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:12:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 12:12:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-24 12:12:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 12:12:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-24 12:12:55,672 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 45 [2018-01-24 12:12:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:55,672 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-24 12:12:55,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:12:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-24 12:12:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 12:12:55,673 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:55,673 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-01-24 12:12:55,673 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:12:55,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693807, now seen corresponding path program 2 times [2018-01-24 12:12:55,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:55,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:55,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:55,675 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:12:55,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:55,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:56,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:56,915 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:12:56,921 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:12:56,936 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:12:56,947 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:12:56,955 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:12:56,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:56,974 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:12:56,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:56,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:56,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:12:57,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:57,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:57,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:12:57,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-24 12:12:57,119 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:12:57,120 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:12:57,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:12:57,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2018-01-24 12:12:57,178 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:12:57,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-01-24 12:12:57,940 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 50 treesize of output 54 [2018-01-24 12:12:57,944 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-24 12:12:57,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2018-01-24 12:12:57,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 41 [2018-01-24 12:12:57,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:57,984 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 57 treesize of output 56 [2018-01-24 12:12:57,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:57,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 25 [2018-01-24 12:12:57,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:57,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:57,992 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 21 treesize of output 40 [2018-01-24 12:12:57,993 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:58,001 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:58,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:58,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:58,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-24 12:12:58,052 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:89, output treesize:70 [2018-01-24 12:12:58,264 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 109 treesize of output 83 [2018-01-24 12:12:58,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:58,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:58,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:58,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:58,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:58,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:58,282 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:12:58,282 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:12:58,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 144 [2018-01-24 12:12:58,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:58,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 14 [2018-01-24 12:12:58,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:58,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:58,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:58,345 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:116, output treesize:17 [2018-01-24 12:12:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:58,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:12:58,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 42 [2018-01-24 12:12:58,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-24 12:12:58,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-24 12:12:58,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1544, Unknown=47, NotChecked=0, Total=1722 [2018-01-24 12:12:58,473 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 42 states. [2018-01-24 12:12:58,653 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 53 DAG size of output 37 [2018-01-24 12:13:01,575 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 100 DAG size of output 56 [2018-01-24 12:13:01,913 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 52 DAG size of output 50 [2018-01-24 12:13:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:13:05,379 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2018-01-24 12:13:05,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-01-24 12:13:05,379 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 55 [2018-01-24 12:13:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:13:05,380 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:13:05,380 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 12:13:05,382 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=656, Invalid=5996, Unknown=154, NotChecked=0, Total=6806 [2018-01-24 12:13:05,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 12:13:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2018-01-24 12:13:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 12:13:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-01-24 12:13:05,400 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 55 [2018-01-24 12:13:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:13:05,400 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-01-24 12:13:05,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-24 12:13:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-01-24 12:13:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-24 12:13:05,401 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:13:05,401 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-01-24 12:13:05,401 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:13:05,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1655485324, now seen corresponding path program 3 times [2018-01-24 12:13:05,401 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:13:05,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:13:05,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:05,402 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:13:05,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:13:05,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:13:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 12:13:05,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:13:05,474 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:13:05,479 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:13:05,495 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:05,499 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:05,503 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:05,506 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:05,507 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:13:05,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:13:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 12:13:05,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:13:05,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-01-24 12:13:05,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:13:05,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:13:05,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:13:05,564 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 14 states. [2018-01-24 12:13:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:13:05,784 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-01-24 12:13:05,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:13:05,785 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-01-24 12:13:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:13:05,785 INFO L225 Difference]: With dead ends: 155 [2018-01-24 12:13:05,786 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 12:13:05,786 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:13:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 12:13:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 64. [2018-01-24 12:13:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 12:13:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-01-24 12:13:05,797 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 58 [2018-01-24 12:13:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:13:05,798 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-01-24 12:13:05,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:13:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-01-24 12:13:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 12:13:05,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:13:05,799 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-01-24 12:13:05,799 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:13:05,799 INFO L82 PathProgramCache]: Analyzing trace with hash 941730959, now seen corresponding path program 4 times [2018-01-24 12:13:05,799 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:13:05,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:13:05,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:05,800 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:13:05,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:13:05,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:13:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 12:13:05,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:13:05,903 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:13:05,909 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 12:13:05,934 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:13:05,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:13:05,944 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:13:05,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:05,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:05,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:13:05,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:05,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:05,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:13:05,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:05,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:05,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 12:13:05,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:13:06,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:13:06,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:06,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:06,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:06,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-24 12:13:06,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2018-01-24 12:13:06,096 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:13:06,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:06,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:06,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:06,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-01-24 12:13:07,062 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 52 treesize of output 56 [2018-01-24 12:13:07,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-01-24 12:13:07,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,074 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-01-24 12:13:07,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,080 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-01-24 12:13:07,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-24 12:13:07,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,101 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,131 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 63 treesize of output 62 [2018-01-24 12:13:07,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,134 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2018-01-24 12:13:07,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 44 [2018-01-24 12:13:07,141 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 69 [2018-01-24 12:13:07,145 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,160 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,166 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:13:07,204 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:88, output treesize:80 [2018-01-24 12:13:07,383 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 127 treesize of output 93 [2018-01-24 12:13:07,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 43 [2018-01-24 12:13:07,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,419 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:13:07,420 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:13:07,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:07,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 91 [2018-01-24 12:13:07,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:07,439 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:134, output treesize:17 [2018-01-24 12:13:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 12:13:07,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:13:07,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 28] total 38 [2018-01-24 12:13:07,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 12:13:07,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 12:13:07,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1316, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 12:13:07,516 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 38 states. [2018-01-24 12:13:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:13:10,877 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-01-24 12:13:10,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-24 12:13:10,877 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 63 [2018-01-24 12:13:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:13:10,877 INFO L225 Difference]: With dead ends: 148 [2018-01-24 12:13:10,877 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 12:13:10,879 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=574, Invalid=6736, Unknown=0, NotChecked=0, Total=7310 [2018-01-24 12:13:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 12:13:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-01-24 12:13:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 12:13:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-01-24 12:13:10,889 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 63 [2018-01-24 12:13:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:13:10,889 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-01-24 12:13:10,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 12:13:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-01-24 12:13:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 12:13:10,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:13:10,890 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 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:13:10,890 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:13:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash -755276387, now seen corresponding path program 5 times [2018-01-24 12:13:10,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:13:10,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:13:10,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:10,891 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:13:10,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:13:10,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:13:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 35 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 12:13:11,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:13:11,121 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:13:11,129 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 12:13:11,140 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:13:11,142 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:13:11,146 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:13:11,151 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:13:11,159 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:13:11,176 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:13:11,178 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:13:11,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:13:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 12:13:11,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:13:11,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2018-01-24 12:13:11,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:13:11,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:13:11,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:13:11,256 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 19 states. [2018-01-24 12:13:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:13:11,488 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-01-24 12:13:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:13:11,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-01-24 12:13:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:13:11,489 INFO L225 Difference]: With dead ends: 127 [2018-01-24 12:13:11,489 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 12:13:11,489 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-01-24 12:13:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 12:13:11,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 12:13:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 12:13:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-01-24 12:13:11,501 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 70 [2018-01-24 12:13:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:13:11,501 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-01-24 12:13:11,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:13:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-01-24 12:13:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-24 12:13:11,502 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:13:11,502 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 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:13:11,502 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:13:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1262859016, now seen corresponding path program 6 times [2018-01-24 12:13:11,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:13:11,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:13:11,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:11,503 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:13:11,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:13:11,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:13:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 12:13:11,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:13:11,614 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:13:11,622 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 12:13:11,638 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:13:11,642 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:13:11,646 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:13:11,650 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:13:11,657 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:13:11,676 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:13:11,678 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:13:11,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:13:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 12:13:11,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:13:11,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2018-01-24 12:13:11,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:13:11,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:13:11,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:13:11,743 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 16 states. [2018-01-24 12:13:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:13:11,843 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-01-24 12:13:11,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:13:11,844 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2018-01-24 12:13:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:13:11,845 INFO L225 Difference]: With dead ends: 88 [2018-01-24 12:13:11,845 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 12:13:11,845 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:13:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 12:13:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-01-24 12:13:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:13:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-01-24 12:13:11,856 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 73 [2018-01-24 12:13:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:13:11,856 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-01-24 12:13:11,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:13:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-01-24 12:13:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-24 12:13:11,857 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:13:11,857 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 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:13:11,857 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:13:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1302767729, now seen corresponding path program 7 times [2018-01-24 12:13:11,857 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:13:11,857 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:13:11,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:11,858 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:13:11,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:13:11,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:13:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:13:13,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:13:13,181 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:13:13,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:13:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:13:13,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:13:13,219 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:13:13,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:13:13,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:13,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:13,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:13:13,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-24 12:13:13,342 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:13:13,343 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:13:13,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:13:13,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2018-01-24 12:13:13,388 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:13:13,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:13,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-01-24 12:13:15,106 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 74 treesize of output 78 [2018-01-24 12:13:15,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-01-24 12:13:15,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2018-01-24 12:13:15,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 45 treesize of output 54 [2018-01-24 12:13:15,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 56 [2018-01-24 12:13:15,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 63 [2018-01-24 12:13:15,152 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,163 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,173 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,220 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 89 treesize of output 88 [2018-01-24 12:13:15,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,224 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2018-01-24 12:13:15,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,228 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-01-24 12:13:15,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 71 [2018-01-24 12:13:15,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 106 [2018-01-24 12:13:15,244 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,273 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,284 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,292 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,308 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-01-24 12:13:15,345 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:127, output treesize:110 [2018-01-24 12:13:15,580 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 165 treesize of output 123 [2018-01-24 12:13:15,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,586 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:13:15,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,592 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:13:15,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:15,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 200 [2018-01-24 12:13:15,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 10 [2018-01-24 12:13:15,636 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:15,644 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:172, output treesize:13 [2018-01-24 12:13:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 76 refuted. 36 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:13:15,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:13:15,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 52 [2018-01-24 12:13:15,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-24 12:13:15,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-24 12:13:15,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2321, Unknown=99, NotChecked=0, Total=2652 [2018-01-24 12:13:15,746 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 52 states. [2018-01-24 12:13:18,186 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-01-24 12:13:20,531 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 89 DAG size of output 60 [2018-01-24 12:13:21,425 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 92 DAG size of output 63 [2018-01-24 12:13:22,334 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 98 DAG size of output 61 [2018-01-24 12:13:22,971 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 119 DAG size of output 69 [2018-01-24 12:13:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:13:24,538 INFO L93 Difference]: Finished difference Result 195 states and 203 transitions. [2018-01-24 12:13:24,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-01-24 12:13:24,538 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 77 [2018-01-24 12:13:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:13:24,539 INFO L225 Difference]: With dead ends: 195 [2018-01-24 12:13:24,539 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 12:13:24,541 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1034, Invalid=9114, Unknown=358, NotChecked=0, Total=10506 [2018-01-24 12:13:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 12:13:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2018-01-24 12:13:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 12:13:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-01-24 12:13:24,564 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 77 [2018-01-24 12:13:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:13:24,564 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-01-24 12:13:24,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-24 12:13:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-01-24 12:13:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-24 12:13:24,565 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:13:24,565 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 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:13:24,565 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:13:24,565 INFO L82 PathProgramCache]: Analyzing trace with hash 459506644, now seen corresponding path program 8 times [2018-01-24 12:13:24,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:13:24,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:13:24,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:24,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:13:24,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:13:24,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:13:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-24 12:13:24,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:13:24,733 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:13:24,739 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:13:24,752 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:13:24,760 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:13:24,762 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:13:24,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:13:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-24 12:13:24,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:13:24,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2018-01-24 12:13:24,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:13:24,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:13:24,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:13:24,850 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 21 states. [2018-01-24 12:13:25,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:13:25,166 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2018-01-24 12:13:25,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 12:13:25,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-01-24 12:13:25,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:13:25,167 INFO L225 Difference]: With dead ends: 201 [2018-01-24 12:13:25,167 INFO L226 Difference]: Without dead ends: 174 [2018-01-24 12:13:25,168 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2018-01-24 12:13:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-24 12:13:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 86. [2018-01-24 12:13:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 12:13:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-01-24 12:13:25,185 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 80 [2018-01-24 12:13:25,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:13:25,185 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-01-24 12:13:25,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:13:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-01-24 12:13:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 12:13:25,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:13:25,185 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 1, 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:13:25,186 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:13:25,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1713091503, now seen corresponding path program 9 times [2018-01-24 12:13:25,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:13:25,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:13:25,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:25,186 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:13:25,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:13:25,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:13:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 53 proven. 49 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 12:13:25,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:13:25,407 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:13:25,411 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:13:25,427 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:25,432 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:25,436 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:25,443 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:25,455 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:25,462 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:13:25,464 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:13:25,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:13:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 50 proven. 30 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-24 12:13:25,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:13:25,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 21 [2018-01-24 12:13:25,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:13:25,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:13:25,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:13:25,565 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 21 states. [2018-01-24 12:13:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:13:25,872 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-01-24 12:13:25,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:13:25,872 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-01-24 12:13:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:13:25,873 INFO L225 Difference]: With dead ends: 154 [2018-01-24 12:13:25,873 INFO L226 Difference]: Without dead ends: 89 [2018-01-24 12:13:25,874 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 12:13:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-24 12:13:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-24 12:13:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 12:13:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-01-24 12:13:25,890 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 85 [2018-01-24 12:13:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:13:25,890 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-01-24 12:13:25,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:13:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-01-24 12:13:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-24 12:13:25,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:13:25,891 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 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:13:25,891 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 12:13:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash -559166732, now seen corresponding path program 10 times [2018-01-24 12:13:25,891 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:13:25,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:13:25,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:25,892 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:13:25,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:13:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:13:25,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:13:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:13:27,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:13:27,447 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:13:27,452 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 12:13:27,476 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:13:27,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:13:27,481 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:13:27,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:13:27,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:27,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:27,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:13:27,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 12:13:27,607 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:13:27,608 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:13:27,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-24 12:13:27,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2018-01-24 12:13:27,645 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:13:27,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:27,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-01-24 12:13:31,409 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 58 DAG size of output 48 [2018-01-24 12:13:31,425 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 72 treesize of output 76 [2018-01-24 12:13:31,427 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-01-24 12:13:31,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,431 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2018-01-24 12:13:31,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,436 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 60 [2018-01-24 12:13:31,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 84 [2018-01-24 12:13:31,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,455 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 116 [2018-01-24 12:13:31,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 163 [2018-01-24 12:13:31,472 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,497 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,511 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,565 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 91 treesize of output 90 [2018-01-24 12:13:31,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,568 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-01-24 12:13:31,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,571 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 54 [2018-01-24 12:13:31,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2018-01-24 12:13:31,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2018-01-24 12:13:31,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:31,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 151 [2018-01-24 12:13:31,597 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,619 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,631 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,641 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,649 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,665 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:31,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:13:31,700 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 3 variables, input treesize:118, output treesize:116 [2018-01-24 12:13:32,022 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 179 treesize of output 129 [2018-01-24 12:13:32,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,039 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:13:32,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,042 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:13:32,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 279 [2018-01-24 12:13:32,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:32,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:13:32,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 124 [2018-01-24 12:13:32,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:13:32,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:32,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:13:32,111 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:186, output treesize:17 Received shutdown request... [2018-01-24 12:13:32,119 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 12:13:32,119 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:13:32,124 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:13:32,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:13:32 BoogieIcfgContainer [2018-01-24 12:13:32,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:13:32,125 INFO L168 Benchmark]: Toolchain (without parser) took 48600.07 ms. Allocated memory was 308.3 MB in the beginning and 713.0 MB in the end (delta: 404.8 MB). Free memory was 268.3 MB in the beginning and 390.9 MB in the end (delta: -122.6 MB). Peak memory consumption was 282.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:13:32,127 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:13:32,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.33 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:13:32,128 INFO L168 Benchmark]: Boogie Preprocessor took 32.62 ms. Allocated memory is still 308.3 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:13:32,128 INFO L168 Benchmark]: RCFGBuilder took 259.11 ms. Allocated memory is still 308.3 MB. Free memory was 255.3 MB in the beginning and 236.6 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:13:32,128 INFO L168 Benchmark]: TraceAbstraction took 48058.53 ms. Allocated memory was 308.3 MB in the beginning and 713.0 MB in the end (delta: 404.8 MB). Free memory was 235.6 MB in the beginning and 398.1 MB in the end (delta: -162.5 MB). Peak memory consumption was 242.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:13:32,130 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.33 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.62 ms. Allocated memory is still 308.3 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 259.11 ms. Allocated memory is still 308.3 MB. Free memory was 255.3 MB in the beginning and 236.6 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48058.53 ms. Allocated memory was 308.3 MB in the beginning and 713.0 MB in the end (delta: 404.8 MB). Free memory was 235.6 MB in the beginning and 398.1 MB in the end (delta: -162.5 MB). Peak memory consumption was 242.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 19 error locations. TIMEOUT Result, 48.0s OverallTime, 30 OverallIterations, 7 TraceHistogramMax, 26.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1005 SDtfs, 3680 SDslu, 5045 SDs, 0 SdLazy, 8848 SolverSat, 1177 SolverUnsat, 641 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1436 GetRequests, 763 SyntacticMatches, 31 SemanticMatches, 642 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7184 ImplicationChecksByTransitivity, 25.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 340 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 2024 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1979 ConstructedInterpolants, 116 QuantifiedInterpolants, 1188352 SizeOfPredicates, 85 NumberOfNonLiveVariables, 3139 ConjunctsInSsa, 294 ConjunctsInUnsatCore, 45 InterpolantComputations, 15 PerfectInterpolantSequences, 949/1674 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-13-32-140.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-13-32-140.csv Completed graceful shutdown