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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:07:49,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:07:49,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:07:49,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:07:49,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:07:49,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:07:49,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:07:49,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:07:49,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:07:49,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:07:49,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:07:49,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:07:49,081 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:07:49,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:07:49,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:07:49,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:07:49,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:07:49,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:07:49,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:07:49,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:07:49,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:07:49,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:07:49,092 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:07:49,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:07:49,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:07:49,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:07:49,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:07:49,095 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:07:49,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:07:49,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:07:49,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:07:49,096 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:07:49,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:07:49,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:07:49,107 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:07:49,107 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:07:49,107 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:07:49,107 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:07:49,107 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:07:49,107 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:07:49,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:07:49,108 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:07:49,108 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:07:49,108 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:07:49,108 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:07:49,108 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:07:49,108 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:07:49,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:07:49,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:07:49,109 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:07:49,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:07:49,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:07:49,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:07:49,109 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:07:49,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:07:49,109 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:07:49,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:07:49,146 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:07:49,149 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:07:49,150 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:07:49,150 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:07:49,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:07:49,293 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:07:49,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:07:49,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:07:49,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:07:49,299 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:07:49,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:07:49" (1/1) ... [2018-02-04 12:07:49,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@131cb6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49, skipping insertion in model container [2018-02-04 12:07:49,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:07:49" (1/1) ... [2018-02-04 12:07:49,311 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:07:49,337 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:07:49,428 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:07:49,441 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:07:49,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49 WrapperNode [2018-02-04 12:07:49,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:07:49,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:07:49,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:07:49,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:07:49,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49" (1/1) ... [2018-02-04 12:07:49,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49" (1/1) ... [2018-02-04 12:07:49,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49" (1/1) ... [2018-02-04 12:07:49,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49" (1/1) ... [2018-02-04 12:07:49,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49" (1/1) ... [2018-02-04 12:07:49,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49" (1/1) ... [2018-02-04 12:07:49,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49" (1/1) ... [2018-02-04 12:07:49,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:07:49,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:07:49,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:07:49,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:07:49,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:07:49,509 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:07:49,509 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:07:49,509 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-02-04 12:07:49,509 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:07:49,509 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:07:49,510 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:07:49,510 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:07:49,510 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:07:49,510 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:07:49,510 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:07:49,510 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-02-04 12:07:49,510 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:07:49,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:07:49,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:07:49,659 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:07:49,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:07:49 BoogieIcfgContainer [2018-02-04 12:07:49,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:07:49,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:07:49,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:07:49,662 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:07:49,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:07:49" (1/3) ... [2018-02-04 12:07:49,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b9c96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:07:49, skipping insertion in model container [2018-02-04 12:07:49,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:49" (2/3) ... [2018-02-04 12:07:49,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b9c96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:07:49, skipping insertion in model container [2018-02-04 12:07:49,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:07:49" (3/3) ... [2018-02-04 12:07:49,664 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:07:49,668 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:07:49,673 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 12:07:49,703 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:07:49,703 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:07:49,703 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:07:49,703 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:07:49,703 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:07:49,703 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:07:49,703 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:07:49,703 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:07:49,704 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:07:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-02-04 12:07:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 12:07:49,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:49,718 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:49,718 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:49,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2055638365, now seen corresponding path program 1 times [2018-02-04 12:07:49,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:49,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:49,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:49,750 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:49,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:49,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:49,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:49,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:07:49,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:07:49,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:07:49,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:07:49,843 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-02-04 12:07:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:49,983 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-02-04 12:07:49,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:07:49,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 12:07:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:49,990 INFO L225 Difference]: With dead ends: 55 [2018-02-04 12:07:49,990 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:07:49,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:07:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:07:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:07:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:07:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 12:07:50,020 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2018-02-04 12:07:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:50,021 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 12:07:50,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:07:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 12:07:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:07:50,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:50,021 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:50,021 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:50,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1872133330, now seen corresponding path program 1 times [2018-02-04 12:07:50,021 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:50,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:50,022 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,022 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:50,022 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:50,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:50,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:50,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:07:50,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:07:50,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:07:50,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:07:50,068 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-04 12:07:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:50,139 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-04 12:07:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:07:50,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 12:07:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:50,141 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:07:50,141 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:07:50,142 INFO L554 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-02-04 12:07:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:07:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:07:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:07:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 12:07:50,146 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2018-02-04 12:07:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:50,146 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 12:07:50,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:07:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 12:07:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:07:50,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:50,147 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:50,147 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074960, now seen corresponding path program 1 times [2018-02-04 12:07:50,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:50,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:50,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,149 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:50,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:50,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:50,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:50,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:07:50,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:07:50,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:07:50,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:07:50,206 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-02-04 12:07:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:50,240 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 12:07:50,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:07:50,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 12:07:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:50,244 INFO L225 Difference]: With dead ends: 50 [2018-02-04 12:07:50,244 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 12:07:50,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-04 12:07:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 12:07:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 12:07:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:07:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 12:07:50,248 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2018-02-04 12:07:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:50,248 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 12:07:50,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:07:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 12:07:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:07:50,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:50,249 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:50,249 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074959, now seen corresponding path program 1 times [2018-02-04 12:07:50,249 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:50,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:50,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,250 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:50,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:50,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:50,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:50,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:07:50,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:07:50,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:07:50,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:07:50,369 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2018-02-04 12:07:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:50,472 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 12:07:50,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:07:50,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 12:07:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:50,473 INFO L225 Difference]: With dead ends: 49 [2018-02-04 12:07:50,473 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 12:07:50,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:07:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 12:07:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 12:07:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 12:07:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 12:07:50,476 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2018-02-04 12:07:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:50,476 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 12:07:50,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:07:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 12:07:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:07:50,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:50,477 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:50,477 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:50,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381909, now seen corresponding path program 1 times [2018-02-04 12:07:50,477 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:50,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:50,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,478 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:50,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:50,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:50,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:50,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:07:50,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:07:50,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:07:50,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:07:50,516 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-02-04 12:07:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:50,552 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 12:07:50,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:07:50,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 12:07:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:50,554 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:07:50,554 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:07:50,554 INFO L554 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-02-04 12:07:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:07:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 12:07:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:07:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 12:07:50,557 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2018-02-04 12:07:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:50,557 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 12:07:50,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:07:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 12:07:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:07:50,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:50,558 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:50,558 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381910, now seen corresponding path program 1 times [2018-02-04 12:07:50,559 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:50,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:50,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:50,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:50,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:50,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:50,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:07:50,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:07:50,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:07:50,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:07:50,629 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-02-04 12:07:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:50,656 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-04 12:07:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:50,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 12:07:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:50,656 INFO L225 Difference]: With dead ends: 47 [2018-02-04 12:07:50,657 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 12:07:50,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:07:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 12:07:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 12:07:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 12:07:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-04 12:07:50,661 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2018-02-04 12:07:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:50,661 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-04 12:07:50,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:07:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-04 12:07:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:07:50,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:50,662 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:50,662 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:50,662 INFO L82 PathProgramCache]: Analyzing trace with hash -275307336, now seen corresponding path program 1 times [2018-02-04 12:07:50,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:50,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:50,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:50,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:50,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:50,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:50,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:07:50,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:07:50,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:07:50,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:07:50,700 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-02-04 12:07:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:50,760 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-04 12:07:50,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:50,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 12:07:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:50,762 INFO L225 Difference]: With dead ends: 47 [2018-02-04 12:07:50,762 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 12:07:50,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:07:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 12:07:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-02-04 12:07:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 12:07:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-04 12:07:50,764 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2018-02-04 12:07:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:50,765 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-04 12:07:50,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:07:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-04 12:07:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:07:50,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:50,765 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:50,765 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:50,765 INFO L82 PathProgramCache]: Analyzing trace with hash -275307335, now seen corresponding path program 1 times [2018-02-04 12:07:50,765 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:50,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:50,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,766 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:50,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:50,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:50,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:50,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:07:50,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:07:50,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:07:50,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:07:50,869 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-02-04 12:07:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:51,006 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-02-04 12:07:51,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:07:51,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-04 12:07:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:51,007 INFO L225 Difference]: With dead ends: 57 [2018-02-04 12:07:51,007 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 12:07:51,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:07:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 12:07:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-02-04 12:07:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:07:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-02-04 12:07:51,009 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2018-02-04 12:07:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:51,009 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-02-04 12:07:51,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:07:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-02-04 12:07:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:07:51,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:51,010 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:51,010 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:51,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718631, now seen corresponding path program 1 times [2018-02-04 12:07:51,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:51,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:51,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:51,011 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:51,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:51,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:51,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:51,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:07:51,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:07:51,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:07:51,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:07:51,069 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2018-02-04 12:07:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:51,126 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-02-04 12:07:51,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:07:51,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 12:07:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:51,127 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:07:51,127 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:07:51,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:07:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:07:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 12:07:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:07:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-02-04 12:07:51,130 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2018-02-04 12:07:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:51,130 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-02-04 12:07:51,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:07:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-02-04 12:07:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:07:51,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:51,131 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:51,131 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:51,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718632, now seen corresponding path program 1 times [2018-02-04 12:07:51,131 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:51,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:51,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:51,131 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:51,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:51,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:51,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:51,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:07:51,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:07:51,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:07:51,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:07:51,212 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2018-02-04 12:07:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:51,363 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-02-04 12:07:51,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:07:51,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-04 12:07:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:51,364 INFO L225 Difference]: With dead ends: 56 [2018-02-04 12:07:51,364 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 12:07:51,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:07:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 12:07:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-02-04 12:07:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:07:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-02-04 12:07:51,367 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2018-02-04 12:07:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:51,367 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-02-04 12:07:51,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:07:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-02-04 12:07:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:07:51,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:51,368 INFO L351 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] [2018-02-04 12:07:51,368 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:51,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1706720075, now seen corresponding path program 1 times [2018-02-04 12:07:51,368 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:51,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:51,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:51,369 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:51,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:51,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:51,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:51,506 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:51,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:51,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:51,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:07:51,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:51,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:07:51,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:51,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:51,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:07:51,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:51,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:51,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:07:51,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:51,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:51,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:51,643 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-02-04 12:07:51,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:51,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:51,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-02-04 12:07:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:51,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:51,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-02-04 12:07:51,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:07:51,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:07:51,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:07:51,831 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 24 states. [2018-02-04 12:07:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:52,357 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-02-04 12:07:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:07:52,358 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-02-04 12:07:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:52,358 INFO L225 Difference]: With dead ends: 72 [2018-02-04 12:07:52,358 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 12:07:52,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:07:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 12:07:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-02-04 12:07:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 12:07:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-02-04 12:07:52,363 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 24 [2018-02-04 12:07:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:52,363 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-02-04 12:07:52,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 12:07:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-02-04 12:07:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:07:52,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:52,364 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:52,365 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:07:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1074905977, now seen corresponding path program 2 times [2018-02-04 12:07:52,365 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:52,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:52,366 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:52,366 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:52,366 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:52,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:52,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:52,606 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:52,619 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:07:52,632 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:07:52,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:07:52,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:52,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:07:52,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:52,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:52,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-04 12:07:52,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:52,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:52,705 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-02-04 12:07:52,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:52,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:52,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-02-04 12:07:52,745 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 17 treesize of output 14 [2018-02-04 12:07:52,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 12:07:52,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:52,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:52,752 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-02-04 12:07:52,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-02-04 12:07:52,780 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 28 treesize of output 29 [2018-02-04 12:07:52,788 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 11 treesize of output 10 [2018-02-04 12:07:52,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:52,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:52,805 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-02-04 12:07:52,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:48 [2018-02-04 12:07:53,140 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 41 treesize of output 37 [2018-02-04 12:07:53,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:53,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-04 12:07:53,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:53,177 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 8 treesize of output 1 [2018-02-04 12:07:53,177 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:53,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:53,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:53,198 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:43 [2018-02-04 12:07:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:53,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:53,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-02-04 12:07:53,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:07:53,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:07:53,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:07:53,281 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 28 states. [2018-02-04 12:07:53,931 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 80 DAG size of output 77 [2018-02-04 12:08:18,329 WARN L146 SmtUtils]: Spent 8083ms on a formula simplification. DAG size of input: 79 DAG size of output 69 [2018-02-04 12:08:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:19,169 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2018-02-04 12:08:19,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 12:08:19,169 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-02-04 12:08:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:19,170 INFO L225 Difference]: With dead ends: 105 [2018-02-04 12:08:19,171 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 12:08:19,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=391, Invalid=2469, Unknown=2, NotChecked=0, Total=2862 [2018-02-04 12:08:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 12:08:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2018-02-04 12:08:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 12:08:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-02-04 12:08:19,176 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 27 [2018-02-04 12:08:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:19,176 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-02-04 12:08:19,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:08:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-02-04 12:08:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:08:19,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:19,177 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:08:19,178 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash 94248296, now seen corresponding path program 1 times [2018-02-04 12:08:19,178 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:19,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:19,179 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:19,179 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:08:19,179 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:19,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:19,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:08:19,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:08:19,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:08:19,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:08:19,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:08:19,223 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 5 states. [2018-02-04 12:08:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:19,263 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-02-04 12:08:19,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:08:19,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 12:08:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:19,266 INFO L225 Difference]: With dead ends: 86 [2018-02-04 12:08:19,266 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 12:08:19,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:08:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 12:08:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-02-04 12:08:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 12:08:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-02-04 12:08:19,274 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 28 [2018-02-04 12:08:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:19,274 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-02-04 12:08:19,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:08:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-02-04 12:08:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:08:19,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:19,275 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:08:19,275 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash -723400154, now seen corresponding path program 1 times [2018-02-04 12:08:19,276 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:19,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:19,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:19,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:19,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:19,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:19,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:08:19,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:08:19,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:08:19,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:08:19,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:08:19,350 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 6 states. [2018-02-04 12:08:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:19,448 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2018-02-04 12:08:19,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:08:19,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 12:08:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:19,449 INFO L225 Difference]: With dead ends: 71 [2018-02-04 12:08:19,449 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 12:08:19,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:08:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 12:08:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-02-04 12:08:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:08:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-04 12:08:19,452 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 28 [2018-02-04 12:08:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:19,452 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-04 12:08:19,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:08:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-04 12:08:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:08:19,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:19,453 INFO L351 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-02-04 12:08:19,453 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:19,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1208652779, now seen corresponding path program 1 times [2018-02-04 12:08:19,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:19,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:19,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:19,454 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:19,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:19,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:19,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:08:19,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:08:19,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:08:19,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:08:19,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:08:19,563 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 7 states. [2018-02-04 12:08:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:19,615 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-04 12:08:19,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:08:19,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 12:08:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:19,615 INFO L225 Difference]: With dead ends: 83 [2018-02-04 12:08:19,615 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 12:08:19,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:08:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 12:08:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-04 12:08:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 12:08:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-02-04 12:08:19,617 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 30 [2018-02-04 12:08:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:19,617 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-02-04 12:08:19,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:08:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-02-04 12:08:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:08:19,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:19,618 INFO L351 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-02-04 12:08:19,618 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:19,618 INFO L82 PathProgramCache]: Analyzing trace with hash -989798061, now seen corresponding path program 1 times [2018-02-04 12:08:19,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:19,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:19,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:19,619 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:19,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:19,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:19,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:08:19,774 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:08:19,784 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:19,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:08:19,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:08:19,815 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 11 treesize of output 10 [2018-02-04 12:08:19,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:19,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:19,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:19,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:08:20,034 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 20 treesize of output 16 [2018-02-04 12:08:20,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:08:20,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:08:20,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:20,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:20,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-04 12:08:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:20,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:08:20,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-02-04 12:08:20,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:08:20,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:08:20,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:08:20,137 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 19 states. [2018-02-04 12:08:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:22,589 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-02-04 12:08:22,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:08:22,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-02-04 12:08:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:22,590 INFO L225 Difference]: With dead ends: 86 [2018-02-04 12:08:22,590 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 12:08:22,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:08:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 12:08:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-02-04 12:08:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 12:08:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 12:08:22,594 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 30 [2018-02-04 12:08:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:22,594 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 12:08:22,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:08:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 12:08:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:08:22,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:22,595 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 12:08:22,595 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:22,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1959345908, now seen corresponding path program 1 times [2018-02-04 12:08:22,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:22,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:22,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:22,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:22,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:22,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:22,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:08:22,990 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:08:22,994 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:23,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:08:23,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:23,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:23,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-02-04 12:08:23,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:23,061 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 12 treesize of output 15 [2018-02-04 12:08:23,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:23,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:23,073 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-02-04 12:08:23,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-02-04 12:08:23,112 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 18 treesize of output 15 [2018-02-04 12:08:23,113 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 15 treesize of output 14 [2018-02-04 12:08:23,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:23,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 12:08:23,140 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 31 treesize of output 32 [2018-02-04 12:08:23,141 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 13 treesize of output 12 [2018-02-04 12:08:23,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:23,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-02-04 12:08:23,355 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 34 treesize of output 32 [2018-02-04 12:08:23,358 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 10 treesize of output 1 [2018-02-04 12:08:23,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:23,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:08:23,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:08:23,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:23,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:23,378 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:27 [2018-02-04 12:08:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:23,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:08:23,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-02-04 12:08:23,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 12:08:23,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 12:08:23,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:08:23,583 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 30 states. [2018-02-04 12:08:24,404 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 84 DAG size of output 61 [2018-02-04 12:08:24,575 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 78 DAG size of output 58 [2018-02-04 12:08:26,024 WARN L146 SmtUtils]: Spent 1244ms on a formula simplification. DAG size of input: 74 DAG size of output 54 [2018-02-04 12:08:26,338 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 87 DAG size of output 60 [2018-02-04 12:08:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:26,521 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-02-04 12:08:26,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:08:26,521 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2018-02-04 12:08:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:26,521 INFO L225 Difference]: With dead ends: 89 [2018-02-04 12:08:26,521 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 12:08:26,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=310, Invalid=1946, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 12:08:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 12:08:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 12:08:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:08:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-02-04 12:08:26,523 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 35 [2018-02-04 12:08:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:26,523 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-02-04 12:08:26,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 12:08:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-02-04 12:08:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:08:26,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:26,524 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:08:26,524 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash -608695935, now seen corresponding path program 1 times [2018-02-04 12:08:26,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:26,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:26,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:26,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:26,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:26,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:26,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:08:26,769 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:08:26,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:26,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:08:26,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:26,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:26,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:26,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:26,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:26,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-04 12:08:26,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:26,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:26,838 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-02-04 12:08:26,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:26,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:26,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:08:26,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:26,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:26,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-02-04 12:08:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:27,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:08:27,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-02-04 12:08:27,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:08:27,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:08:27,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:08:27,098 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 33 states. [2018-02-04 12:08:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:27,526 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-02-04 12:08:27,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:08:27,526 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 35 [2018-02-04 12:08:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:27,526 INFO L225 Difference]: With dead ends: 74 [2018-02-04 12:08:27,527 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 12:08:27,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=1763, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 12:08:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 12:08:27,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-02-04 12:08:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 12:08:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 12:08:27,528 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 35 [2018-02-04 12:08:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:27,529 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 12:08:27,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:08:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 12:08:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:08:27,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:27,529 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 12:08:27,529 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash -36117874, now seen corresponding path program 1 times [2018-02-04 12:08:27,529 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:27,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:27,530 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:27,530 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:27,530 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:27,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:28,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:08:28,023 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:08:28,028 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:28,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:08:28,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:28,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:28,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-04 12:08:28,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:28,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:28,122 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-02-04 12:08:28,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:28,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:08:28,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-04 12:08:28,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:08:28,187 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 16 treesize of output 15 [2018-02-04 12:08:28,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:28,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 12:08:28,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:28,226 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 32 treesize of output 33 [2018-02-04 12:08:28,227 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 13 treesize of output 12 [2018-02-04 12:08:28,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:28,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 12:08:28,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:28,578 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 45 treesize of output 41 [2018-02-04 12:08:28,580 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-02-04 12:08:28,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:28,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:08:28,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:08:28,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:28,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 12:08:28,607 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:73, output treesize:128 [2018-02-04 12:08:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:28,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:08:28,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2018-02-04 12:08:28,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 12:08:28,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 12:08:28,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:08:28,737 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 37 states. [2018-02-04 12:08:29,208 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 118 DAG size of output 51 [2018-02-04 12:08:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:30,549 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-02-04 12:08:30,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 12:08:30,549 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 35 [2018-02-04 12:08:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:30,550 INFO L225 Difference]: With dead ends: 87 [2018-02-04 12:08:30,550 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 12:08:30,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=368, Invalid=2938, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 12:08:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 12:08:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-02-04 12:08:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 12:08:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-04 12:08:30,554 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 35 [2018-02-04 12:08:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:30,554 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-04 12:08:30,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 12:08:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-04 12:08:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 12:08:30,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:30,555 INFO L351 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, 1, 1] [2018-02-04 12:08:30,555 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1689703552, now seen corresponding path program 2 times [2018-02-04 12:08:30,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:30,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:30,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:30,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:30,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:30,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:30,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:08:30,919 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:08:30,925 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:08:30,952 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:08:30,952 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:08:30,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:08:30,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:30,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:30,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:30,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:08:30,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:30,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:30,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:30,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:30,965 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-02-04 12:08:30,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:30,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:30,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 12:08:31,002 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 16 treesize of output 13 [2018-02-04 12:08:31,004 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 13 treesize of output 12 [2018-02-04 12:08:31,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:31,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:31,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:31,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-04 12:08:31,158 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 24 treesize of output 25 [2018-02-04 12:08:31,160 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-02-04 12:08:31,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:31,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:31,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:31,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-02-04 12:08:31,336 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 22 treesize of output 18 [2018-02-04 12:08:31,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:08:31,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:08:31,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:31,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:31,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-04 12:08:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:31,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:08:31,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-02-04 12:08:31,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:08:31,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:08:31,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:08:31,521 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 28 states. [2018-02-04 12:08:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:32,585 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-02-04 12:08:32,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:08:32,585 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2018-02-04 12:08:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:32,586 INFO L225 Difference]: With dead ends: 81 [2018-02-04 12:08:32,586 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 12:08:32,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 12:08:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 12:08:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-02-04 12:08:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:08:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-02-04 12:08:32,588 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 36 [2018-02-04 12:08:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:32,588 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-02-04 12:08:32,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:08:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-02-04 12:08:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:08:32,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:32,589 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:08:32,589 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash -601444785, now seen corresponding path program 1 times [2018-02-04 12:08:32,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:32,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:32,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:32,590 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:08:32,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:32,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:32,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:08:32,875 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:08:32,880 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:32,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:08:32,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:32,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:32,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:32,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:32,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:32,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-04 12:08:32,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:32,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:32,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:08:32,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:32,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:32,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:32,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-02-04 12:08:32,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:32,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:32,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-02-04 12:08:33,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 12:08:33,004 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 12 treesize of output 11 [2018-02-04 12:08:33,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:33,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:33,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:33,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-02-04 12:08:33,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:33,192 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 23 treesize of output 24 [2018-02-04 12:08:33,194 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-02-04 12:08:33,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:33,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:33,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:33,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-02-04 12:08:33,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 12:08:33,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 12:08:33,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:08:33,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:33,277 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 2 xjuncts. [2018-02-04 12:08:33,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:51 [2018-02-04 12:08:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:33,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:08:33,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2018-02-04 12:08:33,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 12:08:33,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 12:08:33,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 12:08:33,366 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 40 states. [2018-02-04 12:08:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:35,299 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-04 12:08:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 12:08:35,299 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 38 [2018-02-04 12:08:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:35,300 INFO L225 Difference]: With dead ends: 94 [2018-02-04 12:08:35,300 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 12:08:35,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=446, Invalid=4246, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 12:08:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 12:08:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-02-04 12:08:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:08:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 12:08:35,302 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 38 [2018-02-04 12:08:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:35,302 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 12:08:35,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 12:08:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 12:08:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:08:35,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:35,303 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2018-02-04 12:08:35,303 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash -28866724, now seen corresponding path program 2 times [2018-02-04 12:08:35,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:35,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:35,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:35,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:35,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:35,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:35,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:08:35,664 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:08:35,668 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:08:35,684 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:08:35,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:08:35,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:08:35,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:35,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:35,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-04 12:08:35,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:35,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:35,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:08:35,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:35,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:35,798 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-02-04 12:08:35,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-04 12:08:35,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:08:35,872 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 16 treesize of output 15 [2018-02-04 12:08:35,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:35,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 12:08:35,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:35,936 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 32 treesize of output 33 [2018-02-04 12:08:35,939 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 13 treesize of output 12 [2018-02-04 12:08:35,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:35,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:35,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 12:08:36,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:36,925 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 51 treesize of output 45 [2018-02-04 12:08:36,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 41 [2018-02-04 12:08:36,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:08:37,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:08:37,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:08:37,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:37,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-02-04 12:08:37,042 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:89, output treesize:227 [2018-02-04 12:08:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:37,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:08:37,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2018-02-04 12:08:37,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 12:08:37,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 12:08:37,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1526, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 12:08:37,209 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 41 states. [2018-02-04 12:08:38,310 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 121 DAG size of output 117 [2018-02-04 12:08:38,604 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 124 DAG size of output 120 [2018-02-04 12:08:39,633 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 130 DAG size of output 115 [2018-02-04 12:08:39,873 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 127 DAG size of output 121 [2018-02-04 12:08:40,076 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 153 DAG size of output 136 [2018-02-04 12:08:40,698 WARN L146 SmtUtils]: Spent 571ms on a formula simplification. DAG size of input: 133 DAG size of output 117 [2018-02-04 12:08:41,828 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 127 DAG size of output 121 [2018-02-04 12:08:43,674 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 133 DAG size of output 120 [2018-02-04 12:08:43,933 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 139 DAG size of output 130 [2018-02-04 12:08:44,103 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 136 DAG size of output 122 [2018-02-04 12:08:44,273 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 113 DAG size of output 100 [2018-02-04 12:08:44,441 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 136 DAG size of output 122 [2018-02-04 12:08:44,652 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 160 DAG size of output 137 [2018-02-04 12:08:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:45,805 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-02-04 12:08:45,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 12:08:45,805 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 38 [2018-02-04 12:08:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:45,805 INFO L225 Difference]: With dead ends: 104 [2018-02-04 12:08:45,805 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 12:08:45,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=548, Invalid=5152, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 12:08:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 12:08:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2018-02-04 12:08:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 12:08:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-04 12:08:45,808 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 38 [2018-02-04 12:08:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:45,808 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-04 12:08:45,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 12:08:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-04 12:08:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:08:45,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:45,808 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-02-04 12:08:45,808 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:45,808 INFO L82 PathProgramCache]: Analyzing trace with hash 669200065, now seen corresponding path program 2 times [2018-02-04 12:08:45,809 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:45,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:45,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:45,809 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:08:45,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:45,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:46,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:08:46,332 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:08:46,337 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:08:46,353 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:08:46,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:08:46,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:08:46,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:46,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:46,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:08:46,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:46,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:46,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:08:46,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:46,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:46,429 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-02-04 12:08:46,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:08:46,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:08:46,499 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 13 treesize of output 12 [2018-02-04 12:08:46,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-04 12:08:46,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:46,756 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 24 treesize of output 25 [2018-02-04 12:08:46,757 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-02-04 12:08:46,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:46,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:46,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:36 [2018-02-04 12:08:47,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 12:08:47,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:08:47,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:08:47,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:47,395 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 2 xjuncts. [2018-02-04 12:08:47,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:65 [2018-02-04 12:08:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:47,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:08:47,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-02-04 12:08:47,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 12:08:47,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 12:08:47,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1620, Unknown=1, NotChecked=0, Total=1722 [2018-02-04 12:08:47,593 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 42 states. [2018-02-04 12:08:50,236 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 89 DAG size of output 88 [2018-02-04 12:08:51,318 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 93 DAG size of output 92 [2018-02-04 12:08:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:08:51,605 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-02-04 12:08:51,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 12:08:51,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-02-04 12:08:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:08:51,605 INFO L225 Difference]: With dead ends: 116 [2018-02-04 12:08:51,606 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 12:08:51,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=402, Invalid=4852, Unknown=2, NotChecked=0, Total=5256 [2018-02-04 12:08:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 12:08:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2018-02-04 12:08:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 12:08:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-04 12:08:51,608 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 41 [2018-02-04 12:08:51,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:08:51,608 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-04 12:08:51,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 12:08:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-04 12:08:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 12:08:51,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:08:51,609 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 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-02-04 12:08:51,609 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:08:51,609 INFO L82 PathProgramCache]: Analyzing trace with hash -652090471, now seen corresponding path program 1 times [2018-02-04 12:08:51,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:08:51,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:08:51,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:51,610 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:08:51,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:08:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:51,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:08:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:52,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:08:52,493 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:08:52,498 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:08:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:08:52,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:08:52,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:52,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:08:52,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:08:52,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:52,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:52,575 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-02-04 12:08:52,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:52,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:08:52,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:08:52,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:08:52,647 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 16 treesize of output 15 [2018-02-04 12:08:52,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:08:52,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-02-04 12:08:52,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:52,695 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 32 treesize of output 33 [2018-02-04 12:08:52,697 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 13 treesize of output 12 [2018-02-04 12:08:52,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:08:52,705 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-02-04 12:08:52,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-02-04 12:08:53,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:53,200 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 55 treesize of output 49 [2018-02-04 12:08:53,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:53,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:53,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:08:53,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 73 [2018-02-04 12:08:53,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:08:53,226 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 10 treesize of output 1 [2018-02-04 12:08:53,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:08:53,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:53,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:08:53,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:126 [2018-02-04 12:08:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:08:53,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:08:53,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-04 12:08:53,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 12:08:53,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 12:08:53,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2223, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 12:08:53,651 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 49 states. [2018-02-04 12:08:54,455 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 123 DAG size of output 122 [2018-02-04 12:08:55,590 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 121 DAG size of output 119 [2018-02-04 12:08:57,748 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 121 DAG size of output 115 [2018-02-04 12:08:58,835 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 127 DAG size of output 119 [2018-02-04 12:08:59,962 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 138 DAG size of output 122 [2018-02-04 12:09:01,864 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 114 DAG size of output 107 [2018-02-04 12:09:02,368 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 82 DAG size of output 81 [2018-02-04 12:09:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:03,081 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-02-04 12:09:03,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 12:09:03,082 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 43 [2018-02-04 12:09:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:03,082 INFO L225 Difference]: With dead ends: 117 [2018-02-04 12:09:03,082 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 12:09:03,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1908 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=683, Invalid=7506, Unknown=1, NotChecked=0, Total=8190 [2018-02-04 12:09:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 12:09:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 74. [2018-02-04 12:09:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 12:09:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-04 12:09:03,086 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 43 [2018-02-04 12:09:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:03,086 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-04 12:09:03,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 12:09:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-04 12:09:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 12:09:03,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:03,087 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:09:03,087 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:09:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash -889231934, now seen corresponding path program 3 times [2018-02-04 12:09:03,087 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:03,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:03,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:03,088 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:03,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:03,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:03,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:03,580 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:09:03,585 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:09:03,611 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 12:09:03,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:09:03,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:03,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:03,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:03,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-04 12:09:03,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:03,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:03,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:09:03,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:03,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:03,685 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-02-04 12:09:03,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-02-04 12:09:03,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:09:03,727 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 13 treesize of output 12 [2018-02-04 12:09:03,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 12:09:03,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:03,894 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 24 treesize of output 25 [2018-02-04 12:09:03,896 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-02-04 12:09:03,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:09:03,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-02-04 12:09:03,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:03,975 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 24 treesize of output 25 [2018-02-04 12:09:03,980 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-02-04 12:09:03,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:03,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:09:03,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-02-04 12:09:04,058 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 20 treesize of output 16 [2018-02-04 12:09:04,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:09:04,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:09:04,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:04,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:09:04,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:45 [2018-02-04 12:09:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:04,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:04,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2018-02-04 12:09:04,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 12:09:04,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 12:09:04,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1608, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 12:09:04,207 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 42 states. [2018-02-04 12:09:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:09,496 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-02-04 12:09:09,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 12:09:09,497 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2018-02-04 12:09:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:09,497 INFO L225 Difference]: With dead ends: 134 [2018-02-04 12:09:09,497 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 12:09:09,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=495, Invalid=5825, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 12:09:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 12:09:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 80. [2018-02-04 12:09:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 12:09:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-04 12:09:09,500 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 44 [2018-02-04 12:09:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:09,500 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-04 12:09:09,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 12:09:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-04 12:09:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 12:09:09,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:09,500 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2018-02-04 12:09:09,500 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:09:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1391820529, now seen corresponding path program 4 times [2018-02-04 12:09:09,501 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:09,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:09,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:09,501 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:09:09,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:09,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:09:09,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:09,962 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:09:09,969 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:09:10,000 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:09:10,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:09:10,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:10,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:10,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:10,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-04 12:09:10,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:10,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:10,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:09:10,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:10,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:10,135 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-02-04 12:09:10,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-02-04 12:09:10,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:09:10,193 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 16 treesize of output 15 [2018-02-04 12:09:10,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-02-04 12:09:10,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:10,240 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 32 treesize of output 33 [2018-02-04 12:09:10,241 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 13 treesize of output 12 [2018-02-04 12:09:10,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:10,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2018-02-04 12:09:10,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:10,719 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 49 treesize of output 46 [2018-02-04 12:09:10,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:10,732 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 2 case distinctions, treesize of input 30 treesize of output 65 [2018-02-04 12:09:10,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:09:10,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:10,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 12:09:10,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:141 [2018-02-04 12:09:11,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:11,165 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 89 treesize of output 85 [2018-02-04 12:09:11,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-02-04 12:09:11,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:11,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:09:11,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:09:11,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:11,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:11,243 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 76 treesize of output 74 [2018-02-04 12:09:11,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:09:11,248 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 12:09:11,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-02-04 12:09:11,262 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:11,273 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:11,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-04 12:09:11,326 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:166, output treesize:183 [2018-02-04 12:09:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:11,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:11,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 47 [2018-02-04 12:09:11,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 12:09:11,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 12:09:11,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 12:09:11,688 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 48 states. [2018-02-04 12:09:12,941 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 111 DAG size of output 107 [2018-02-04 12:09:13,191 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 124 DAG size of output 116 [2018-02-04 12:09:13,580 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 130 DAG size of output 116 [2018-02-04 12:09:13,943 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 122 DAG size of output 111 [2018-02-04 12:09:14,167 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 135 DAG size of output 120 [2018-02-04 12:09:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:16,184 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-02-04 12:09:16,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 12:09:16,184 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 44 [2018-02-04 12:09:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:16,184 INFO L225 Difference]: With dead ends: 130 [2018-02-04 12:09:16,184 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 12:09:16,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=581, Invalid=6901, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 12:09:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 12:09:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-02-04 12:09:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 12:09:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-04 12:09:16,189 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 44 [2018-02-04 12:09:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:16,189 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-04 12:09:16,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 12:09:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-04 12:09:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 12:09:16,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:16,190 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 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-02-04 12:09:16,190 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:09:16,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1312957849, now seen corresponding path program 2 times [2018-02-04 12:09:16,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:16,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:16,190 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:16,191 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:09:16,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:16,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:17,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:17,044 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:09:17,049 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:09:17,066 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:09:17,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:09:17,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:17,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:17,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:17,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:09:17,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:17,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:17,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:09:17,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:17,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:17,123 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-02-04 12:09:17,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:09:17,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:09:17,184 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 16 treesize of output 15 [2018-02-04 12:09:17,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:09:17,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-02-04 12:09:17,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:17,226 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 32 treesize of output 33 [2018-02-04 12:09:17,227 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 13 treesize of output 12 [2018-02-04 12:09:17,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:17,235 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-02-04 12:09:17,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-02-04 12:09:17,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:17,976 INFO L303 Elim1Store]: Index analysis took 215 ms [2018-02-04 12:09:17,976 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 58 treesize of output 50 [2018-02-04 12:09:17,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:17,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:17,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:17,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 73 [2018-02-04 12:09:17,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:09:18,004 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 10 treesize of output 1 [2018-02-04 12:09:18,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:18,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:18,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:18,034 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:73, output treesize:208 [2018-02-04 12:09:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:18,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:18,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 50 [2018-02-04 12:09:18,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 12:09:18,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 12:09:18,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2419, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 12:09:18,474 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 51 states. [2018-02-04 12:09:19,033 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 116 DAG size of output 90 [2018-02-04 12:09:19,387 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 136 DAG size of output 135 [2018-02-04 12:09:19,590 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 141 DAG size of output 140 [2018-02-04 12:09:19,943 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 144 DAG size of output 142 [2018-02-04 12:09:20,209 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 139 DAG size of output 138 [2018-02-04 12:09:20,438 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 145 DAG size of output 142 [2018-02-04 12:09:20,669 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 142 DAG size of output 140 [2018-02-04 12:09:20,864 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 145 DAG size of output 137 [2018-02-04 12:09:21,051 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 125 DAG size of output 123 [2018-02-04 12:09:21,325 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 151 DAG size of output 141 [2018-02-04 12:09:21,624 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 155 DAG size of output 144 [2018-02-04 12:09:21,853 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 142 DAG size of output 135 [2018-02-04 12:09:22,119 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 145 DAG size of output 136 [2018-02-04 12:09:22,363 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 159 DAG size of output 143 [2018-02-04 12:09:22,667 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 145 DAG size of output 137 [2018-02-04 12:09:22,906 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 122 DAG size of output 120 [2018-02-04 12:09:23,152 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 148 DAG size of output 139 [2018-02-04 12:09:23,454 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 125 DAG size of output 122 [2018-02-04 12:09:23,960 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 136 DAG size of output 127 [2018-02-04 12:09:24,225 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 137 DAG size of output 128 [2018-02-04 12:09:24,686 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 95 DAG size of output 93 [2018-02-04 12:09:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:25,297 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-02-04 12:09:25,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 12:09:25,297 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 46 [2018-02-04 12:09:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:25,297 INFO L225 Difference]: With dead ends: 130 [2018-02-04 12:09:25,298 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 12:09:25,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=729, Invalid=8013, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 12:09:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 12:09:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2018-02-04 12:09:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 12:09:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-04 12:09:25,300 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 46 [2018-02-04 12:09:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:25,300 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-04 12:09:25,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 12:09:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-04 12:09:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 12:09:25,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:25,300 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:25,300 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:09:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 98715828, now seen corresponding path program 5 times [2018-02-04 12:09:25,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:25,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:25,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:25,301 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:09:25,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:25,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:25,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:25,812 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:09:25,817 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:09:25,839 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-02-04 12:09:25,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:09:25,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:25,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:25,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:25,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:25,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:25,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:25,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:09:25,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:25,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:25,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:09:25,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:25,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:25,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:25,945 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-02-04 12:09:25,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:25,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:25,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-02-04 12:09:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:26,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:26,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 49 [2018-02-04 12:09:26,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 12:09:26,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 12:09:26,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2294, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 12:09:26,455 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 50 states. [2018-02-04 12:09:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:35,380 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-02-04 12:09:35,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 12:09:35,380 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 47 [2018-02-04 12:09:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:35,381 INFO L225 Difference]: With dead ends: 142 [2018-02-04 12:09:35,381 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 12:09:35,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=597, Invalid=6373, Unknown=2, NotChecked=0, Total=6972 [2018-02-04 12:09:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 12:09:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-04 12:09:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 12:09:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-04 12:09:35,382 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 47 [2018-02-04 12:09:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:35,383 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-04 12:09:35,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 12:09:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-04 12:09:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 12:09:35,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:35,383 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2018-02-04 12:09:35,383 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:09:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1574633716, now seen corresponding path program 3 times [2018-02-04 12:09:35,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:35,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:35,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:35,384 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:09:35,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:35,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:36,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:36,050 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:09:36,054 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:09:36,090 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 12:09:36,090 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:09:36,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:36,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:36,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:36,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:09:36,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:36,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:36,156 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-02-04 12:09:36,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:36,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:09:36,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-04 12:09:36,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:09:36,229 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 16 treesize of output 15 [2018-02-04 12:09:36,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 12:09:36,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:36,266 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 32 treesize of output 33 [2018-02-04 12:09:36,267 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 13 treesize of output 12 [2018-02-04 12:09:36,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-02-04 12:09:36,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:36,624 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 43 treesize of output 39 [2018-02-04 12:09:36,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 41 [2018-02-04 12:09:36,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-02-04 12:09:36,655 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 10 treesize of output 1 [2018-02-04 12:09:36,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:36,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:36,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:36,679 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:74, output treesize:159 [2018-02-04 12:09:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:37,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:37,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 53 [2018-02-04 12:09:37,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 12:09:37,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 12:09:37,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2696, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 12:09:37,558 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 54 states. [2018-02-04 12:09:39,055 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 126 DAG size of output 102 [2018-02-04 12:09:39,384 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 135 DAG size of output 106 [2018-02-04 12:09:42,293 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 104 DAG size of output 87 [2018-02-04 12:09:44,277 WARN L146 SmtUtils]: Spent 1841ms on a formula simplification. DAG size of input: 62 DAG size of output 48 [2018-02-04 12:09:45,148 WARN L146 SmtUtils]: Spent 790ms on a formula simplification. DAG size of input: 72 DAG size of output 48 [2018-02-04 12:09:46,269 WARN L146 SmtUtils]: Spent 789ms on a formula simplification. DAG size of input: 63 DAG size of output 54 [2018-02-04 12:09:46,730 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 96 DAG size of output 61 [2018-02-04 12:09:49,204 WARN L146 SmtUtils]: Spent 2360ms on a formula simplification. DAG size of input: 103 DAG size of output 50 [2018-02-04 12:09:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:49,689 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-02-04 12:09:49,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 12:09:49,690 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 49 [2018-02-04 12:09:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:49,690 INFO L225 Difference]: With dead ends: 113 [2018-02-04 12:09:49,690 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 12:09:49,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=685, Invalid=7870, Unknown=1, NotChecked=0, Total=8556 [2018-02-04 12:09:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 12:09:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2018-02-04 12:09:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 12:09:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-02-04 12:09:49,692 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 49 [2018-02-04 12:09:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:49,692 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-02-04 12:09:49,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 12:09:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-02-04 12:09:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 12:09:49,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:49,693 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 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-02-04 12:09:49,693 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:09:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1082930983, now seen corresponding path program 4 times [2018-02-04 12:09:49,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:49,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:49,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:49,694 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:09:49,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:49,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:50,198 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-02-04 12:09:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:51,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:51,073 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:09:51,078 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:09:51,099 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:09:51,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:09:51,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:51,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:09:51,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,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 6 treesize of output 5 [2018-02-04 12:09:51,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:09:51,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:51,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:51,231 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-02-04 12:09:51,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:51,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:09:51,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-04 12:09:51,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:09:51,332 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 16 treesize of output 15 [2018-02-04 12:09:51,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:09:51,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 12:09:51,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:51,381 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 32 treesize of output 33 [2018-02-04 12:09:51,382 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 13 treesize of output 12 [2018-02-04 12:09:51,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:51,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:09:51,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-02-04 12:09:52,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,301 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 75 treesize of output 65 [2018-02-04 12:09:52,303 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 10 treesize of output 1 [2018-02-04 12:09:52,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:52,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:52,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 161 [2018-02-04 12:09:52,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:09:52,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:52,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:52,401 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:104, output treesize:176 [2018-02-04 12:09:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:52,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:52,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2018-02-04 12:09:52,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 12:09:52,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 12:09:52,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2921, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 12:09:52,903 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 56 states. [2018-02-04 12:09:53,408 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 124 DAG size of output 96 [2018-02-04 12:09:53,609 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 131 DAG size of output 99 [2018-02-04 12:09:54,450 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 183 DAG size of output 182 [2018-02-04 12:09:54,773 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 191 DAG size of output 190 [2018-02-04 12:09:55,066 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 196 DAG size of output 194 [2018-02-04 12:09:55,374 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 195 DAG size of output 186 [2018-02-04 12:09:55,731 WARN L146 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 201 DAG size of output 190 [2018-02-04 12:09:56,672 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 176 DAG size of output 167 [2018-02-04 12:09:56,983 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 182 DAG size of output 171 [2018-02-04 12:09:57,294 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 188 DAG size of output 178 [2018-02-04 12:09:57,571 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 174 DAG size of output 168 [2018-02-04 12:09:57,857 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 169 DAG size of output 161 [2018-02-04 12:09:58,194 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 180 DAG size of output 172 [2018-02-04 12:09:58,639 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 193 DAG size of output 183 [2018-02-04 12:09:58,922 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 172 DAG size of output 167 [2018-02-04 12:09:59,654 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 174 DAG size of output 166 [2018-02-04 12:10:00,032 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 192 DAG size of output 177 [2018-02-04 12:10:00,376 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 175 DAG size of output 169 [2018-02-04 12:10:00,618 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 142 DAG size of output 141 [2018-02-04 12:10:00,990 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 179 DAG size of output 171 [2018-02-04 12:10:01,271 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 145 DAG size of output 143 [2018-02-04 12:10:01,476 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 120 DAG size of output 113 [2018-02-04 12:10:02,082 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 154 DAG size of output 146 [2018-02-04 12:10:02,573 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 132 DAG size of output 124 [2018-02-04 12:10:03,109 WARN L146 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 120 DAG size of output 119 [2018-02-04 12:10:03,701 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 81 DAG size of output 81 [2018-02-04 12:10:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:04,129 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-02-04 12:10:04,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 12:10:04,129 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 49 [2018-02-04 12:10:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:04,130 INFO L225 Difference]: With dead ends: 111 [2018-02-04 12:10:04,130 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 12:10:04,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2406 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=773, Invalid=8929, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 12:10:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 12:10:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2018-02-04 12:10:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 12:10:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-02-04 12:10:04,133 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 49 [2018-02-04 12:10:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:04,134 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-02-04 12:10:04,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 12:10:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-02-04 12:10:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 12:10:04,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:04,134 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-02-04 12:10:04,134 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:10:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1360385918, now seen corresponding path program 6 times [2018-02-04 12:10:04,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:04,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:04,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,136 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:10:04,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:04,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:04,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:04,916 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:10:04,921 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:10:04,959 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-02-04 12:10:04,959 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:10:04,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:04,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:04,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:04,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:04,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:04,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:04,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:10:05,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:05,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:05,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:10:05,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:05,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:05,046 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-02-04 12:10:05,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:10:05,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:10:05,116 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 13 treesize of output 12 [2018-02-04 12:10:05,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-04 12:10:05,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:05,454 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 24 treesize of output 25 [2018-02-04 12:10:05,457 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-02-04 12:10:05,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:05,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:36 [2018-02-04 12:10:05,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:05,601 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 24 treesize of output 25 [2018-02-04 12:10:05,603 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-02-04 12:10:05,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:05,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2018-02-04 12:10:05,785 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 20 treesize of output 16 [2018-02-04 12:10:05,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:10:05,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:05,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:05,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:10:05,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:57 [2018-02-04 12:10:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:06,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:06,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 52 [2018-02-04 12:10:06,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 12:10:06,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 12:10:06,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 12:10:06,130 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 53 states. [2018-02-04 12:10:09,218 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 70 DAG size of output 32 [2018-02-04 12:10:11,619 WARN L146 SmtUtils]: Spent 2328ms on a formula simplification. DAG size of input: 77 DAG size of output 36 [2018-02-04 12:10:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:11,953 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-02-04 12:10:11,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 12:10:11,953 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 50 [2018-02-04 12:10:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:11,954 INFO L225 Difference]: With dead ends: 122 [2018-02-04 12:10:11,954 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 12:10:11,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=548, Invalid=6934, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 12:10:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 12:10:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 12:10:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 12:10:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-02-04 12:10:11,956 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 50 [2018-02-04 12:10:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:11,956 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-02-04 12:10:11,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 12:10:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-02-04 12:10:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 12:10:11,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:11,956 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 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-02-04 12:10:11,956 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:10:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1174596903, now seen corresponding path program 5 times [2018-02-04 12:10:11,956 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:11,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:11,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:11,957 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:10:11,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:11,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:12,503 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 92 DAG size of output 78 [2018-02-04 12:10:12,636 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 84 DAG size of output 70 [2018-02-04 12:10:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:13,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:13,710 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:10:13,715 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:10:13,737 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-04 12:10:13,737 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:10:13,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:13,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:13,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:13,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:10:13,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:13,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:13,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:10:13,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:13,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:13,834 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-02-04 12:10:13,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:10:13,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:10:13,911 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 16 treesize of output 15 [2018-02-04 12:10:13,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:13,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-02-04 12:10:13,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:13,959 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 32 treesize of output 33 [2018-02-04 12:10:13,960 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 13 treesize of output 12 [2018-02-04 12:10:13,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:13,973 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-02-04 12:10:13,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-02-04 12:10:15,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,068 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 85 treesize of output 73 [2018-02-04 12:10:15,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:15,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 217 [2018-02-04 12:10:15,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:15,146 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 10 treesize of output 1 [2018-02-04 12:10:15,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:15,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:15,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:15,201 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:108, output treesize:194 [2018-02-04 12:10:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:15,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:15,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2018-02-04 12:10:15,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 12:10:15,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 12:10:15,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3386, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 12:10:15,757 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 60 states. [2018-02-04 12:10:16,413 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 131 DAG size of output 102 [2018-02-04 12:10:16,927 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 191 DAG size of output 190 [2018-02-04 12:10:17,284 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 201 DAG size of output 199 [2018-02-04 12:10:17,621 WARN L146 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 203 DAG size of output 201 [2018-02-04 12:10:17,956 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 198 DAG size of output 198 [2018-02-04 12:10:18,320 WARN L146 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 201 DAG size of output 200 [2018-02-04 12:10:18,665 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 195 DAG size of output 195 [2018-02-04 12:10:18,974 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 198 DAG size of output 197 [2018-02-04 12:10:19,270 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 191 DAG size of output 191 [2018-02-04 12:10:19,572 WARN L146 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 194 DAG size of output 193 [2018-02-04 12:10:19,886 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 224 DAG size of output 180 [2018-02-04 12:10:20,191 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 189 DAG size of output 189 [2018-02-04 12:10:20,737 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 192 DAG size of output 191 [2018-02-04 12:10:23,181 WARN L146 SmtUtils]: Spent 280ms on a formula simplification. DAG size of input: 229 DAG size of output 207 [2018-02-04 12:10:23,502 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 191 DAG size of output 191 [2018-02-04 12:10:23,717 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 178 [2018-02-04 12:10:24,158 WARN L146 SmtUtils]: Spent 289ms on a formula simplification. DAG size of input: 207 DAG size of output 199 [2018-02-04 12:10:24,688 WARN L146 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 161 DAG size of output 161 [2018-02-04 12:10:26,312 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 166 DAG size of output 166 [2018-02-04 12:10:26,646 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 167 DAG size of output 167 [2018-02-04 12:10:26,899 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 135 DAG size of output 135 [2018-02-04 12:10:27,141 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 130 DAG size of output 130 [2018-02-04 12:10:27,315 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 89 DAG size of output 89 [2018-02-04 12:10:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:27,964 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2018-02-04 12:10:27,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 12:10:27,964 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 52 [2018-02-04 12:10:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:27,965 INFO L225 Difference]: With dead ends: 115 [2018-02-04 12:10:27,965 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 12:10:27,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2268 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=598, Invalid=8714, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 12:10:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 12:10:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2018-02-04 12:10:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 12:10:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2018-02-04 12:10:27,967 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 52 [2018-02-04 12:10:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:27,967 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2018-02-04 12:10:27,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 12:10:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2018-02-04 12:10:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 12:10:27,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:27,967 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 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] [2018-02-04 12:10:27,967 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:10:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash -96498188, now seen corresponding path program 7 times [2018-02-04 12:10:27,967 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:27,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:27,968 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:27,968 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:10:27,968 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:27,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 12:10:28,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:28,489 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:10:28,494 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:28,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:28,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:28,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:28,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:10:28,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:28,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:28,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:10:28,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:28,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:28,652 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-02-04 12:10:28,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:10:28,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:10:28,717 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 16 treesize of output 15 [2018-02-04 12:10:28,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 12:10:28,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:28,753 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 32 treesize of output 33 [2018-02-04 12:10:28,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:10:28,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:28,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:28,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-02-04 12:10:29,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:29,149 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 45 treesize of output 41 [2018-02-04 12:10:29,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:29,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 12:10:29,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:29,166 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 10 treesize of output 1 [2018-02-04 12:10:29,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:29,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:29,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:29,182 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:99 [2018-02-04 12:10:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:30,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:30,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 55 [2018-02-04 12:10:30,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 12:10:30,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 12:10:30,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2933, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 12:10:30,267 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 56 states. [2018-02-04 12:10:31,576 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 109 DAG size of output 103 [2018-02-04 12:10:31,896 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 114 DAG size of output 103 [2018-02-04 12:10:34,764 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 70 DAG size of output 24 [2018-02-04 12:10:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:35,674 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-02-04 12:10:35,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 12:10:35,674 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 53 [2018-02-04 12:10:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:35,674 INFO L225 Difference]: With dead ends: 127 [2018-02-04 12:10:35,674 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 12:10:35,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2822 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=757, Invalid=10585, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 12:10:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 12:10:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-02-04 12:10:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 12:10:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-02-04 12:10:35,676 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 53 [2018-02-04 12:10:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:35,677 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-02-04 12:10:35,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 12:10:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-02-04 12:10:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 12:10:35,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:35,677 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 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] [2018-02-04 12:10:35,677 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:10:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash -196742068, now seen corresponding path program 6 times [2018-02-04 12:10:35,678 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:35,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:35,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:35,678 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:35,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:35,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:36,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:36,865 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:10:36,870 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:10:36,929 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 12:10:36,929 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:10:36,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:36,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:36,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:36,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:36,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:36,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:36,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:10:37,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:37,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:37,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:10:37,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:37,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:37,066 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-02-04 12:10:37,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-04 12:10:37,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:10:37,146 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 16 treesize of output 15 [2018-02-04 12:10:37,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 12:10:37,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:37,198 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 32 treesize of output 33 [2018-02-04 12:10:37,200 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 13 treesize of output 12 [2018-02-04 12:10:37,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-02-04 12:10:37,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:37,763 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 51 treesize of output 45 [2018-02-04 12:10:37,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 73 [2018-02-04 12:10:37,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-04 12:10:37,810 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 10 treesize of output 1 [2018-02-04 12:10:37,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:37,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:37,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:37,859 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:87, output treesize:242 [2018-02-04 12:10:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:39,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:39,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 61 [2018-02-04 12:10:39,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 12:10:39,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 12:10:39,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3592, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 12:10:39,099 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 62 states. [2018-02-04 12:10:40,072 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 155 DAG size of output 88 [2018-02-04 12:10:40,391 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 162 DAG size of output 91 [2018-02-04 12:10:40,602 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 170 DAG size of output 100 [2018-02-04 12:10:40,835 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 176 DAG size of output 103 [2018-02-04 12:10:41,065 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 167 DAG size of output 104 [2018-02-04 12:10:41,293 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 170 DAG size of output 106 [2018-02-04 12:10:41,568 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 168 DAG size of output 102 [2018-02-04 12:10:41,841 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 171 DAG size of output 104 [2018-02-04 12:10:42,096 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 179 DAG size of output 113 [2018-02-04 12:10:42,378 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 195 DAG size of output 125 [2018-02-04 12:10:42,660 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 168 DAG size of output 113 [2018-02-04 12:10:42,934 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 171 DAG size of output 116 [2018-02-04 12:10:43,184 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 161 DAG size of output 105 [2018-02-04 12:10:43,443 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 164 DAG size of output 111 [2018-02-04 12:10:43,880 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 137 DAG size of output 92 [2018-02-04 12:10:47,781 WARN L146 SmtUtils]: Spent 2140ms on a formula simplification. DAG size of input: 84 DAG size of output 61 [2018-02-04 12:10:52,732 WARN L146 SmtUtils]: Spent 4753ms on a formula simplification. DAG size of input: 111 DAG size of output 88 [2018-02-04 12:10:55,423 WARN L146 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 115 DAG size of output 68 [2018-02-04 12:10:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:55,994 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-02-04 12:10:55,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 12:10:55,994 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 55 [2018-02-04 12:10:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:55,995 INFO L225 Difference]: With dead ends: 117 [2018-02-04 12:10:55,995 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 12:10:55,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2896 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=754, Invalid=10801, Unknown=1, NotChecked=0, Total=11556 [2018-02-04 12:10:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 12:10:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-02-04 12:10:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 12:10:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 12:10:55,997 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 55 [2018-02-04 12:10:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:55,997 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 12:10:55,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 12:10:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 12:10:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 12:10:55,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:55,998 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 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-02-04 12:10:55,998 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:10:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash 294960665, now seen corresponding path program 7 times [2018-02-04 12:10:55,998 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:55,998 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:55,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:55,998 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:10:55,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:56,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:56,635 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 118 DAG size of output 87 [2018-02-04 12:10:56,760 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 112 DAG size of output 81 [2018-02-04 12:10:57,237 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 107 DAG size of output 68 [2018-02-04 12:10:57,373 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 110 DAG size of output 71 [2018-02-04 12:10:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:58,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:58,153 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:10:58,157 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:58,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:58,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:58,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:58,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:10:58,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:58,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:58,263 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-02-04 12:10:58,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:58,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:10:58,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:10:58,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:10:58,345 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 16 treesize of output 15 [2018-02-04 12:10:58,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:58,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-02-04 12:10:58,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:58,389 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 32 treesize of output 33 [2018-02-04 12:10:58,396 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 13 treesize of output 12 [2018-02-04 12:10:58,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:58,409 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-02-04 12:10:58,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-02-04 12:10:59,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,623 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 95 treesize of output 81 [2018-02-04 12:10:59,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:59,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 33 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 281 [2018-02-04 12:10:59,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:59,745 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 10 treesize of output 1 [2018-02-04 12:10:59,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:59,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:59,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:59,810 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:118, output treesize:218 [2018-02-04 12:11:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:00,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:00,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 64 [2018-02-04 12:11:00,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 12:11:00,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 12:11:00,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3961, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 12:11:00,430 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 65 states. [2018-02-04 12:11:00,964 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 134 DAG size of output 114 [2018-02-04 12:11:01,823 WARN L146 SmtUtils]: Spent 762ms on a formula simplification. DAG size of input: 142 DAG size of output 118 [2018-02-04 12:11:02,593 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 198 DAG size of output 197 [2018-02-04 12:11:02,963 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 214 DAG size of output 213 [2018-02-04 12:11:03,269 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 219 DAG size of output 217 [2018-02-04 12:11:03,779 WARN L146 SmtUtils]: Spent 390ms on a formula simplification. DAG size of input: 227 DAG size of output 217 [2018-02-04 12:11:04,421 WARN L146 SmtUtils]: Spent 537ms on a formula simplification. DAG size of input: 233 DAG size of output 221 [2018-02-04 12:11:04,754 WARN L146 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 218 DAG size of output 209 [2018-02-04 12:11:05,119 WARN L146 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 224 DAG size of output 213 [2018-02-04 12:11:05,470 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 216 DAG size of output 207 [2018-02-04 12:11:05,832 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 222 DAG size of output 211 [2018-02-04 12:11:06,173 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 212 DAG size of output 203 [2018-02-04 12:11:06,540 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 218 DAG size of output 207 [2018-02-04 12:11:06,879 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 210 DAG size of output 204 Received shutdown request... [2018-02-04 12:11:07,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 12:11:07,177 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:11:07,180 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:11:07,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:11:07 BoogieIcfgContainer [2018-02-04 12:11:07,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:11:07,181 INFO L168 Benchmark]: Toolchain (without parser) took 197887.93 ms. Allocated memory was 400.6 MB in the beginning and 604.5 MB in the end (delta: 203.9 MB). Free memory was 357.2 MB in the beginning and 488.6 MB in the end (delta: -131.4 MB). Peak memory consumption was 185.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:07,182 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:11:07,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.77 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 346.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:07,183 INFO L168 Benchmark]: Boogie Preprocessor took 23.73 ms. Allocated memory is still 400.6 MB. Free memory was 346.7 MB in the beginning and 345.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:07,183 INFO L168 Benchmark]: RCFGBuilder took 188.83 ms. Allocated memory is still 400.6 MB. Free memory was 345.3 MB in the beginning and 324.2 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:07,183 INFO L168 Benchmark]: TraceAbstraction took 197520.59 ms. Allocated memory was 400.6 MB in the beginning and 604.5 MB in the end (delta: 203.9 MB). Free memory was 322.8 MB in the beginning and 488.6 MB in the end (delta: -165.8 MB). Peak memory consumption was 151.5 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:07,184 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.09 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.77 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 346.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.73 ms. Allocated memory is still 400.6 MB. Free memory was 346.7 MB in the beginning and 345.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 188.83 ms. Allocated memory is still 400.6 MB. Free memory was 345.3 MB in the beginning and 324.2 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 197520.59 ms. Allocated memory was 400.6 MB in the beginning and 604.5 MB in the end (delta: 203.9 MB). Free memory was 322.8 MB in the beginning and 488.6 MB in the end (delta: -165.8 MB). Peak memory consumption was 151.5 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 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 24 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 216. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 13 error locations. TIMEOUT Result, 197.4s OverallTime, 35 OverallIterations, 9 TraceHistogramMax, 156.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1062 SDtfs, 4044 SDslu, 12031 SDs, 0 SdLazy, 25444 SolverSat, 2195 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 44.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2191 GetRequests, 500 SyntacticMatches, 11 SemanticMatches, 1679 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31474 ImplicationChecksByTransitivity, 141.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 440 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 2116 NumberOfCodeBlocks, 2116 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 2059 ConstructedInterpolants, 389 QuantifiedInterpolants, 2519042 SizeOfPredicates, 418 NumberOfNonLiveVariables, 4496 ConjunctsInSsa, 1578 ConjunctsInUnsatCore, 57 InterpolantComputations, 13 PerfectInterpolantSequences, 19/1412 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-11-07-191.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-11-07-191.csv Completed graceful shutdown