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/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:54:04,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:54:04,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:54:04,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:54:04,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:54:04,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:54:04,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:54:04,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:54:04,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:54:04,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:54:04,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:54:04,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:54:04,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:54:04,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:54:04,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:54:04,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:54:04,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:54:04,093 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:54:04,094 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:54:04,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:54:04,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:54:04,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:54:04,097 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:54:04,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:54:04,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:54:04,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:54:04,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:54:04,100 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:54:04,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:54:04,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:54:04,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:54:04,101 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 13:54:04,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:54:04,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:54:04,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:54:04,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:54:04,111 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:54:04,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:54:04,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:54:04,111 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:54:04,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:54:04,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:54:04,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:54:04,112 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:54:04,112 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:54:04,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:54:04,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:54:04,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:54:04,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:54:04,113 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:54:04,113 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:54:04,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:54:04,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:54:04,113 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:54:04,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:54:04,114 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:54:04,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:54:04,146 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:54:04,148 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:54:04,149 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:54:04,149 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:54:04,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-04 13:54:04,314 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:54:04,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:54:04,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:54:04,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:54:04,322 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:54:04,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:54:04" (1/1) ... [2018-02-04 13:54:04,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04, skipping insertion in model container [2018-02-04 13:54:04,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:54:04" (1/1) ... [2018-02-04 13:54:04,344 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:54:04,382 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:54:04,459 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:54:04,472 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:54:04,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04 WrapperNode [2018-02-04 13:54:04,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:54:04,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:54:04,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:54:04,477 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:54:04,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04" (1/1) ... [2018-02-04 13:54:04,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04" (1/1) ... [2018-02-04 13:54:04,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04" (1/1) ... [2018-02-04 13:54:04,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04" (1/1) ... [2018-02-04 13:54:04,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04" (1/1) ... [2018-02-04 13:54:04,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04" (1/1) ... [2018-02-04 13:54:04,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04" (1/1) ... [2018-02-04 13:54:04,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:54:04,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:54:04,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:54:04,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:54:04,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04" (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 13:54:04,536 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:54:04,536 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:54:04,536 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 13:54:04,536 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 13:54:04,536 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:54:04,536 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:54:04,536 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:54:04,536 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:54:04,537 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:54:04,663 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:54:04,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:54:04 BoogieIcfgContainer [2018-02-04 13:54:04,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:54:04,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:54:04,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:54:04,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:54:04,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:54:04" (1/3) ... [2018-02-04 13:54:04,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873869f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:54:04, skipping insertion in model container [2018-02-04 13:54:04,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:04" (2/3) ... [2018-02-04 13:54:04,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873869f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:54:04, skipping insertion in model container [2018-02-04 13:54:04,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:54:04" (3/3) ... [2018-02-04 13:54:04,667 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-04 13:54:04,672 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:54:04,678 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 13:54:04,711 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:54:04,711 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:54:04,711 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:54:04,711 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:54:04,711 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:54:04,711 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:54:04,711 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:54:04,712 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:54:04,712 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:54:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 13:54:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:54:04,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:04,732 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:04,732 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-02-04 13:54:04,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:04,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:04,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:04,785 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:04,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:04,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:04,895 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 13:54:04,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:04,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:54:04,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:54:04,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:54:04,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:54:04,921 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 13:54:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:05,046 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 13:54:05,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:54:05,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 13:54:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:05,055 INFO L225 Difference]: With dead ends: 74 [2018-02-04 13:54:05,055 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 13:54:05,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 13:54:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 13:54:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-02-04 13:54:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 13:54:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 13:54:05,086 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-02-04 13:54:05,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:05,087 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 13:54:05,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:54:05,087 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 13:54:05,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:54:05,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:05,088 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:05,088 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-02-04 13:54:05,088 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:05,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:05,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:05,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:05,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:05,161 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 13:54:05,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:05,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:54:05,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:54:05,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:54:05,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:54:05,163 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-04 13:54:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:05,221 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-02-04 13:54:05,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:54:05,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 13:54:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:05,222 INFO L225 Difference]: With dead ends: 78 [2018-02-04 13:54:05,222 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 13:54:05,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 13:54:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-02-04 13:54:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 13:54:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 13:54:05,228 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-02-04 13:54:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:05,229 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 13:54:05,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:54:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 13:54:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 13:54:05,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:05,230 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 13:54:05,230 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:05,230 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-02-04 13:54:05,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:05,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:05,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:05,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:05,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:05,283 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 13:54:05,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:05,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:54:05,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:54:05,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:54:05,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:54:05,284 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-02-04 13:54:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:05,308 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-02-04 13:54:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:54:05,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 13:54:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:05,309 INFO L225 Difference]: With dead ends: 86 [2018-02-04 13:54:05,309 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 13:54:05,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:54:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 13:54:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-02-04 13:54:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 13:54:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-02-04 13:54:05,313 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-02-04 13:54:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:05,314 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-02-04 13:54:05,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:54:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-02-04 13:54:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 13:54:05,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:05,315 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:05,315 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-02-04 13:54:05,315 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:05,315 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:05,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,317 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:05,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:05,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:54:05,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:05,363 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 13:54:05,370 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:05,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:05,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:54:05,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-02-04 13:54:05,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:54:05,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:54:05,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:54:05,434 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-02-04 13:54:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:05,447 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 13:54:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:54:05,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 13:54:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:05,448 INFO L225 Difference]: With dead ends: 49 [2018-02-04 13:54:05,448 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 13:54:05,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:54:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 13:54:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 13:54:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 13:54:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 13:54:05,451 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-02-04 13:54:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:05,451 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 13:54:05,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:54:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 13:54:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 13:54:05,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:05,451 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:05,451 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:05,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-02-04 13:54:05,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:05,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:05,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,452 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:05,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:05,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:54:05,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:05,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:54:05,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:54:05,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:54:05,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:54:05,500 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-02-04 13:54:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:05,509 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-02-04 13:54:05,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:54:05,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 13:54:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:05,510 INFO L225 Difference]: With dead ends: 51 [2018-02-04 13:54:05,510 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 13:54:05,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:54:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 13:54:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-04 13:54:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 13:54:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 13:54:05,513 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-02-04 13:54:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:05,513 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 13:54:05,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:54:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 13:54:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 13:54:05,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:05,514 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] [2018-02-04 13:54:05,514 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:05,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-02-04 13:54:05,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:05,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:05,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:05,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:05,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:05,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:05,621 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 13:54:05,626 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:05,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:05,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 13:54:05,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:05,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:05,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:54:05,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:05,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:05,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 13:54:05,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:05,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:54:05,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 13:54:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:05,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:05,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-04 13:54:05,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:54:05,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:54:05,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:54:05,745 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states. [2018-02-04 13:54:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:05,988 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-02-04 13:54:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:54:05,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-04 13:54:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:05,989 INFO L225 Difference]: With dead ends: 72 [2018-02-04 13:54:05,990 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 13:54:05,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:54:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 13:54:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-02-04 13:54:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 13:54:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-04 13:54:05,994 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28 [2018-02-04 13:54:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:05,994 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-04 13:54:05,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:54:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-04 13:54:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 13:54:05,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:05,995 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] [2018-02-04 13:54:05,995 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:05,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-02-04 13:54:05,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:05,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:05,997 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:05,997 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:05,997 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:06,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:06,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:06,285 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 13:54:06,293 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:06,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:06,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 13:54:06,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:06,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 13:54:06,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:06,354 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 25 treesize of output 24 [2018-02-04 13:54:06,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:06,369 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 22 treesize of output 21 [2018-02-04 13:54:06,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:06,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:54:06,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 13:54:06,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:06,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:06,544 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 52 treesize of output 46 [2018-02-04 13:54:06,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:06,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:06,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:06,592 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 47 treesize of output 41 [2018-02-04 13:54:06,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:06,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-02-04 13:54:06,641 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:06,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:06,672 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 41 treesize of output 50 [2018-02-04 13:54:06,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:06,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 13:54:06,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 13:54:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:06,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:06,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-02-04 13:54:06,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:54:06,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:54:06,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=295, Unknown=1, NotChecked=0, Total=342 [2018-02-04 13:54:06,793 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 19 states. [2018-02-04 13:54:47,861 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 58 DAG size of output 46 [2018-02-04 13:54:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:47,985 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-02-04 13:54:48,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 13:54:48,012 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-02-04 13:54:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:48,013 INFO L225 Difference]: With dead ends: 103 [2018-02-04 13:54:48,013 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 13:54:48,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=122, Invalid=686, Unknown=4, NotChecked=0, Total=812 [2018-02-04 13:54:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 13:54:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 70. [2018-02-04 13:54:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 13:54:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-02-04 13:54:48,017 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 28 [2018-02-04 13:54:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:48,017 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-02-04 13:54:48,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:54:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-02-04 13:54:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:54:48,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:48,018 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:48,019 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1097237542, now seen corresponding path program 1 times [2018-02-04 13:54:48,019 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:48,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:48,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,020 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:48,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:48,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:54:48,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:48,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:54:48,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:54:48,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:54:48,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:54:48,046 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2018-02-04 13:54:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:48,063 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-04 13:54:48,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:54:48,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 13:54:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:48,064 INFO L225 Difference]: With dead ends: 67 [2018-02-04 13:54:48,064 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 13:54:48,065 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 13:54:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 13:54:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-04 13:54:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 13:54:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-02-04 13:54:48,067 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 29 [2018-02-04 13:54:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:48,067 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-02-04 13:54:48,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:54:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-02-04 13:54:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:54:48,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:48,068 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:48,068 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:48,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1190998490, now seen corresponding path program 1 times [2018-02-04 13:54:48,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:48,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:48,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,069 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:48,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:48,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:54:48,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:48,170 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 13:54:48,178 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:48,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:54:48,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:48,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-02-04 13:54:48,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:54:48,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:54:48,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-02-04 13:54:48,318 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 13 states. [2018-02-04 13:54:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:48,547 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-02-04 13:54:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:54:48,548 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-04 13:54:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:48,548 INFO L225 Difference]: With dead ends: 69 [2018-02-04 13:54:48,549 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 13:54:48,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306 [2018-02-04 13:54:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 13:54:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 13:54:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 13:54:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 13:54:48,553 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2018-02-04 13:54:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:48,554 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 13:54:48,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:54:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 13:54:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:54:48,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:48,555 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] [2018-02-04 13:54:48,555 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1833910404, now seen corresponding path program 1 times [2018-02-04 13:54:48,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:48,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:48,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:48,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:48,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:54:48,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:48,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:54:48,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:54:48,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:54:48,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:54:48,597 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-02-04 13:54:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:48,624 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-04 13:54:48,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:54:48,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 13:54:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:48,626 INFO L225 Difference]: With dead ends: 58 [2018-02-04 13:54:48,626 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 13:54:48,626 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 13:54:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 13:54:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-04 13:54:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 13:54:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-04 13:54:48,628 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34 [2018-02-04 13:54:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:48,629 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-04 13:54:48,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:54:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-04 13:54:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:54:48,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:48,629 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:48,629 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1409435322, now seen corresponding path program 1 times [2018-02-04 13:54:48,629 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:48,629 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:48,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,630 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:48,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:48,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 13:54:48,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:48,680 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 13:54:48,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:48,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 13:54:48,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:48,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-04 13:54:48,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:54:48,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:54:48,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:48,732 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states. [2018-02-04 13:54:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:48,764 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-02-04 13:54:48,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:54:48,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-04 13:54:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:48,766 INFO L225 Difference]: With dead ends: 87 [2018-02-04 13:54:48,766 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 13:54:48,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 13:54:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2018-02-04 13:54:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 13:54:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-02-04 13:54:48,769 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 34 [2018-02-04 13:54:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:48,770 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-02-04 13:54:48,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:54:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-02-04 13:54:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 13:54:48,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:48,771 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:48,771 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash 804244387, now seen corresponding path program 1 times [2018-02-04 13:54:48,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:48,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:48,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,773 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:48,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:48,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 13:54:49,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:49,038 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 13:54:49,044 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:49,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:49,073 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 23 treesize of output 22 [2018-02-04 13:54:49,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:49,085 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 26 treesize of output 25 [2018-02-04 13:54:49,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:49,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 13:54:49,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:49,097 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 22 treesize of output 21 [2018-02-04 13:54:49,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:49,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:54:49,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 13:54:49,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:49,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:49,342 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 16 treesize of output 25 [2018-02-04 13:54:49,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:49,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:49,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:49,370 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 13:54:49,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:49,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:54:49,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-02-04 13:54:49,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:49,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:49,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:49,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 34 [2018-02-04 13:54:49,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:49,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:49,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:49,568 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 13:54:49,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:49,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:54:49,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-02-04 13:54:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 13:54:49,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:49,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-02-04 13:54:49,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 13:54:49,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 13:54:49,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=528, Unknown=1, NotChecked=0, Total=600 [2018-02-04 13:54:49,683 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 25 states. [2018-02-04 13:54:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:50,206 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-02-04 13:54:50,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 13:54:50,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2018-02-04 13:54:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:50,207 INFO L225 Difference]: With dead ends: 86 [2018-02-04 13:54:50,207 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 13:54:50,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=983, Unknown=2, NotChecked=0, Total=1122 [2018-02-04 13:54:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 13:54:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-02-04 13:54:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 13:54:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2018-02-04 13:54:50,209 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 41 [2018-02-04 13:54:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:50,210 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2018-02-04 13:54:50,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 13:54:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2018-02-04 13:54:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 13:54:50,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:50,210 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2018-02-04 13:54:50,210 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash 835021389, now seen corresponding path program 1 times [2018-02-04 13:54:50,211 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:50,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:50,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:50,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:50,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:50,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 13:54:50,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:50,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:54:50,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:54:50,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:54:50,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:54:50,263 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 6 states. [2018-02-04 13:54:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:50,314 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-02-04 13:54:50,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:54:50,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-04 13:54:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:50,315 INFO L225 Difference]: With dead ends: 80 [2018-02-04 13:54:50,315 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 13:54:50,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 13:54:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 13:54:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 13:54:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-02-04 13:54:50,317 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 42 [2018-02-04 13:54:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:50,317 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-02-04 13:54:50,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:54:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-02-04 13:54:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 13:54:50,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:50,318 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2018-02-04 13:54:50,318 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:50,318 INFO L82 PathProgramCache]: Analyzing trace with hash 115859282, now seen corresponding path program 1 times [2018-02-04 13:54:50,318 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:50,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:50,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:50,318 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:50,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:50,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 13:54:50,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:50,456 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 13:54:50,461 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:50,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:50,503 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 13:54:50,504 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 13:54:50,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:50,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:50,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:50,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 13:54:50,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 13:54:50,627 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:54:50,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 13:54:50,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:50,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:50,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:50,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-02-04 13:54:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:54:50,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:50,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-02-04 13:54:50,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 13:54:50,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 13:54:50,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:54:50,654 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 20 states. [2018-02-04 13:54:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:50,877 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-04 13:54:50,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 13:54:50,878 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-02-04 13:54:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:50,878 INFO L225 Difference]: With dead ends: 93 [2018-02-04 13:54:50,878 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 13:54:50,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:54:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 13:54:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-02-04 13:54:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 13:54:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-02-04 13:54:50,881 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 43 [2018-02-04 13:54:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:50,881 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-02-04 13:54:50,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 13:54:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-02-04 13:54:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 13:54:50,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:50,882 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2018-02-04 13:54:50,882 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash 115859283, now seen corresponding path program 1 times [2018-02-04 13:54:50,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:50,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:50,883 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:50,883 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:50,883 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:50,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:54:51,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:51,086 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 13:54:51,094 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:51,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54: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 13:54:51,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:51,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:51,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:54:51,143 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 13:54:51,145 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 13:54:51,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:51,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:51,157 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 13:54:51,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 13:54:51,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-04 13:54:51,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:51,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:51,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-02-04 13:54:51,223 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 25 treesize of output 21 [2018-02-04 13:54:51,224 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:54:51,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 13:54:51,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:51,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:51,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:51,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-02-04 13:54:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:54:51,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:51,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2018-02-04 13:54:51,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:54:51,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:54:51,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-04 13:54:51,260 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 22 states. [2018-02-04 13:54:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:51,498 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-02-04 13:54:51,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 13:54:51,499 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-04 13:54:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:51,499 INFO L225 Difference]: With dead ends: 86 [2018-02-04 13:54:51,499 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 13:54:51,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-02-04 13:54:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 13:54:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 13:54:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 13:54:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2018-02-04 13:54:51,501 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 43 [2018-02-04 13:54:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:51,501 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2018-02-04 13:54:51,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:54:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-02-04 13:54:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 13:54:51,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:51,506 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:51,506 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:51,507 INFO L82 PathProgramCache]: Analyzing trace with hash -329856377, now seen corresponding path program 1 times [2018-02-04 13:54:51,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:51,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:51,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:51,508 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:51,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:51,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 13:54:51,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:51,541 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 13:54:51,546 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:51,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 13:54:51,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:54:51,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-02-04 13:54:51,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:54:51,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:54:51,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:54:51,594 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 6 states. [2018-02-04 13:54:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:51,612 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-04 13:54:51,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:54:51,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-04 13:54:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:51,612 INFO L225 Difference]: With dead ends: 84 [2018-02-04 13:54:51,613 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 13:54:51,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 13:54:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 13:54:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 13:54:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-04 13:54:51,616 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 45 [2018-02-04 13:54:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:51,616 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-04 13:54:51,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:54:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-04 13:54:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 13:54:51,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:51,617 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:51,617 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:51,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1632885427, now seen corresponding path program 2 times [2018-02-04 13:54:51,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:51,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:51,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:51,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:51,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:51,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 13:54:51,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:51,660 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 13:54:51,665 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:54:51,682 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:54:51,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:54:51,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 13:54:51,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:51,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 13:54:51,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:54:51,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:54:51,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:54:51,730 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 9 states. [2018-02-04 13:54:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:51,778 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-04 13:54:51,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:54:51,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-02-04 13:54:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:51,780 INFO L225 Difference]: With dead ends: 120 [2018-02-04 13:54:51,780 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 13:54:51,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:54:51,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 13:54:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2018-02-04 13:54:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 13:54:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-02-04 13:54:51,782 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 47 [2018-02-04 13:54:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:51,782 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-02-04 13:54:51,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:54:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-02-04 13:54:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 13:54:51,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:51,783 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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 13:54:51,783 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:51,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576177, now seen corresponding path program 1 times [2018-02-04 13:54:51,783 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:51,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:51,784 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:51,784 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:54:51,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:51,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:54:52,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:52,000 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 13:54:52,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:52,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:52,020 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 13:54:52,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:54:52,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:52,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:52,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:54:52,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-04 13:54:52,115 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 15 treesize of output 12 [2018-02-04 13:54:52,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, 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 11 [2018-02-04 13:54:52,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,122 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 13:54:52,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-02-04 13:54:52,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 13:54:52,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:54:52,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:31 [2018-02-04 13:54:52,314 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 36 treesize of output 30 [2018-02-04 13:54:52,316 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:54:52,316 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 30 treesize of output 20 [2018-02-04 13:54:52,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 13:54:52,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:52,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 13:54:52,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:52,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:54:52,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 13:54:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:52,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:52,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-02-04 13:54:52,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 13:54:52,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 13:54:52,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 13:54:52,401 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 33 states. [2018-02-04 13:54:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:53,322 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-02-04 13:54:53,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 13:54:53,322 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-02-04 13:54:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:53,323 INFO L225 Difference]: With dead ends: 100 [2018-02-04 13:54:53,323 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 13:54:53,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=2674, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 13:54:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 13:54:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-04 13:54:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 13:54:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-02-04 13:54:53,326 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 48 [2018-02-04 13:54:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:53,326 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-02-04 13:54:53,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 13:54:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-02-04 13:54:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 13:54:53,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:53,327 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2018-02-04 13:54:53,327 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:53,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576227, now seen corresponding path program 1 times [2018-02-04 13:54:53,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:53,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:53,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:53,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:53,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:53,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 13:54:53,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:53,386 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 13:54:53,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:53,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 13:54:53,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:53,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 13:54:53,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:54:53,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:54:53,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:53,466 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2018-02-04 13:54:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:53,506 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-02-04 13:54:53,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:54:53,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-04 13:54:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:53,507 INFO L225 Difference]: With dead ends: 95 [2018-02-04 13:54:53,507 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 13:54:53,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:54:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 13:54:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-02-04 13:54:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 13:54:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-02-04 13:54:53,509 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 48 [2018-02-04 13:54:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:53,509 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-02-04 13:54:53,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:54:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-02-04 13:54:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 13:54:53,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:53,510 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:53,510 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash 255829617, now seen corresponding path program 1 times [2018-02-04 13:54:53,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:53,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:53,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:53,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:53,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:53,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 13:54:54,242 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:54,242 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 13:54:54,246 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:54,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:54,458 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 49 treesize of output 46 [2018-02-04 13:54:54,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 13:54:54,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:54,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:54,471 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 49 treesize of output 46 [2018-02-04 13:54:54,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 13:54:54,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:54,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:54,508 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 13:54:54,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-02-04 13:54:54,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-02-04 13:54:54,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:54,646 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 53 treesize of output 35 [2018-02-04 13:54:54,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:54,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 13:54:54,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-02-04 13:54:56,705 WARN L146 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 41 DAG size of output 23 [2018-02-04 13:55:02,838 WARN L146 SmtUtils]: Spent 4037ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-02-04 13:55:04,978 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 66 [2018-02-04 13:55:07,053 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 13:55:07,069 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 1 case distinctions, treesize of input 106 treesize of output 102 [2018-02-04 13:55:07,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2018-02-04 13:55:07,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:55:07,113 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:55:07,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 62 [2018-02-04 13:55:07,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:55:07,154 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:55:07,160 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 2 case distinctions, treesize of input 94 treesize of output 82 [2018-02-04 13:55:07,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 13:55:07,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:55:07,208 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 75 treesize of output 67 [2018-02-04 13:55:07,210 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:55:07,211 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:55:07,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-02-04 13:55:07,211 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:55:07,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:55:07,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:55:07,242 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:182, output treesize:63 [2018-02-04 13:55:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:55:09,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:55:09,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2018-02-04 13:55:09,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 13:55:09,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 13:55:09,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1148, Unknown=24, NotChecked=0, Total=1260 [2018-02-04 13:55:09,502 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 36 states. [2018-02-04 13:55:26,341 WARN L146 SmtUtils]: Spent 6069ms on a formula simplification. DAG size of input: 150 DAG size of output 52 [2018-02-04 13:55:39,562 WARN L146 SmtUtils]: Spent 6872ms on a formula simplification. DAG size of input: 171 DAG size of output 44 [2018-02-04 13:55:47,692 WARN L146 SmtUtils]: Spent 4892ms on a formula simplification. DAG size of input: 181 DAG size of output 45 [2018-02-04 13:55:48,089 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 140 DAG size of output 88 [2018-02-04 13:55:48,367 WARN L146 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 130 DAG size of output 77 [2018-02-04 13:55:50,611 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 111 DAG size of output 63 [2018-02-04 13:55:50,859 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 127 DAG size of output 77 [2018-02-04 13:55:55,156 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 105 DAG size of output 79 [2018-02-04 13:56:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:04,388 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-02-04 13:56:04,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 13:56:04,388 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2018-02-04 13:56:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:04,389 INFO L225 Difference]: With dead ends: 107 [2018-02-04 13:56:04,389 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 13:56:04,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 50.8s TimeCoverageRelationStatistics Valid=386, Invalid=3341, Unknown=55, NotChecked=0, Total=3782 [2018-02-04 13:56:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 13:56:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-02-04 13:56:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 13:56:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-04 13:56:04,391 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 51 [2018-02-04 13:56:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:04,391 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-04 13:56:04,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 13:56:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-04 13:56:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 13:56:04,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:04,392 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:04,392 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:56:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash 797091222, now seen corresponding path program 2 times [2018-02-04 13:56:04,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:04,392 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:04,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:04,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:04,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:04,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 13:56:04,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:04,725 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 13:56:04,732 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:56:04,775 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:56:04,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:04,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:04,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 26 treesize of output 25 [2018-02-04 13:56:04,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:04,820 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 23 treesize of output 22 [2018-02-04 13:56:04,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:04,838 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 22 treesize of output 21 [2018-02-04 13:56:04,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:04,840 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 25 treesize of output 24 [2018-02-04 13:56:04,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:04,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:56:04,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 13:56:05,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,057 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 54 treesize of output 67 [2018-02-04 13:56:05,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:05,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,102 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 46 treesize of output 40 [2018-02-04 13:56:05,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:05,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,152 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 45 treesize of output 48 [2018-02-04 13:56:05,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:05,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,208 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 44 treesize of output 38 [2018-02-04 13:56:05,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:05,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 13:56:05,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 13:56:05,560 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 57 DAG size of output 54 [2018-02-04 13:56:05,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 92 [2018-02-04 13:56:05,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 13:56:05,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:05,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-04 13:56:05,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:06,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,177 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 59 treesize of output 53 [2018-02-04 13:56:06,177 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:06,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 80 [2018-02-04 13:56:06,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 13:56:06,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-02-04 13:56:06,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:06,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 80 [2018-02-04 13:56:06,698 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 13:56:06,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,909 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 60 treesize of output 54 [2018-02-04 13:56:06,909 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:06,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:06,912 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 54 treesize of output 48 [2018-02-04 13:56:06,913 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:07,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 58 [2018-02-04 13:56:07,109 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 13:56:07,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-02-04 13:56:07,327 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-02-04 13:56:07,781 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-02-04 13:56:07,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:07,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:07,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 90 [2018-02-04 13:56:08,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 13:56:08,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-02-04 13:56:08,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 13:56:08,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-02-04 13:56:08,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:08,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,597 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 54 treesize of output 48 [2018-02-04 13:56:08,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:08,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:08,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 92 [2018-02-04 13:56:08,815 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 13:56:09,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 90 [2018-02-04 13:56:09,114 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 13:56:09,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,463 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 54 treesize of output 48 [2018-02-04 13:56:09,463 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:09,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,466 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 60 treesize of output 54 [2018-02-04 13:56:09,467 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:09,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-02-04 13:56:09,800 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:09,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:09,803 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 52 treesize of output 46 [2018-02-04 13:56:09,803 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:10,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:10,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:10,144 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 52 treesize of output 46 [2018-02-04 13:56:10,144 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:10,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:10,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:56:10,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 58 treesize of output 52 [2018-02-04 13:56:10,156 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:10,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-02-04 13:56:10,379 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-02-04 13:56:10,767 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-02-04 13:56:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 13:56:10,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:10,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-02-04 13:56:10,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 13:56:10,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 13:56:10,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=678, Unknown=2, NotChecked=0, Total=756 [2018-02-04 13:56:10,827 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 28 states. [2018-02-04 13:56:33,616 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 52 DAG size of output 51 [2018-02-04 13:56:35,808 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 13:56:36,640 WARN L146 SmtUtils]: Spent 782ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 13:56:36,911 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-02-04 13:56:37,198 WARN L146 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-02-04 13:56:37,505 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 57 DAG size of output 55 [2018-02-04 13:56:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:37,914 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2018-02-04 13:56:37,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 13:56:37,915 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-02-04 13:56:37,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:37,915 INFO L225 Difference]: With dead ends: 110 [2018-02-04 13:56:37,915 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 13:56:37,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=206, Invalid=1594, Unknown=6, NotChecked=0, Total=1806 [2018-02-04 13:56:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 13:56:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2018-02-04 13:56:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 13:56:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-04 13:56:37,919 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 54 [2018-02-04 13:56:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:37,919 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-04 13:56:37,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 13:56:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-04 13:56:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 13:56:37,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:37,920 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2018-02-04 13:56:37,920 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:56:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602309, now seen corresponding path program 2 times [2018-02-04 13:56:37,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:37,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:37,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:37,921 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:37,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:37,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 13:56:38,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:38,100 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 13:56:38,105 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:56:38,118 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:56:38,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:38,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:38,161 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 13:56:38,162 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 13:56:38,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:38,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:56:38,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:56:38,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 13:56:44,251 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 13:56:44,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 13:56:44,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:44,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:56:44,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:56:44,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 13:56:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 13:56:44,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:44,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-02-04 13:56:44,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:56:44,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:56:44,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=366, Unknown=3, NotChecked=0, Total=420 [2018-02-04 13:56:44,281 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 21 states. [2018-02-04 13:56:46,486 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-04 13:56:48,579 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-04 13:56:50,717 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 23 [2018-02-04 13:56:52,795 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-04 13:56:54,812 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 28 [2018-02-04 13:56:56,831 WARN L143 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-04 13:56:58,850 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-04 13:57:00,874 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 26 [2018-02-04 13:57:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:57:00,875 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-04 13:57:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 13:57:00,876 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 13:57:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:57:00,876 INFO L225 Difference]: With dead ends: 114 [2018-02-04 13:57:00,876 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 13:57:00,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=253, Invalid=1814, Unknown=3, NotChecked=0, Total=2070 [2018-02-04 13:57:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 13:57:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2018-02-04 13:57:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 13:57:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-02-04 13:57:00,879 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 56 [2018-02-04 13:57:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:57:00,879 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-02-04 13:57:00,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:57:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-02-04 13:57:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 13:57:00,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:57:00,879 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2018-02-04 13:57:00,879 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:57:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602310, now seen corresponding path program 2 times [2018-02-04 13:57:00,880 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:57:00,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:57:00,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:00,880 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:57:00,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:00,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:57:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 13:57:01,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:57:01,066 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 13:57:01,071 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:57:01,084 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:57:01,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:57:01,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:57:01,105 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 13:57:01,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:01,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:01,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:57:01,133 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 13:57:01,134 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 13:57:01,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:01,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:01,139 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 13:57:01,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 13:57:01,169 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 11 treesize of output 1 [2018-02-04 13:57:01,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:01,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:01,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 13:57:01,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 13:57:01,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-02-04 13:57:01,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:01,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:01,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:01,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-04 13:57:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 13:57:01,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:57:01,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2018-02-04 13:57:01,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:57:01,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:57:01,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:57:01,219 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 23 states. [2018-02-04 13:57:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:57:01,592 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-02-04 13:57:01,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 13:57:01,593 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-02-04 13:57:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:57:01,593 INFO L225 Difference]: With dead ends: 90 [2018-02-04 13:57:01,593 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 13:57:01,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=1333, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 13:57:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 13:57:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2018-02-04 13:57:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 13:57:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-02-04 13:57:01,596 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 56 [2018-02-04 13:57:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:57:01,597 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-02-04 13:57:01,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:57:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-02-04 13:57:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 13:57:01,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:57:01,597 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:57:01,597 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:57:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1244279398, now seen corresponding path program 3 times [2018-02-04 13:57:01,598 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:57:01,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:57:01,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:01,598 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:57:01,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:01,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:57:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 13:57:01,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:57:01,638 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 13:57:01,650 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:57:01,674 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 13:57:01,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:57:01,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:57:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 13:57:01,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:57:01,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 13:57:01,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:57:01,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:57:01,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:57:01,728 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 11 states. [2018-02-04 13:57:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:57:01,765 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-02-04 13:57:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:57:01,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-02-04 13:57:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:57:01,766 INFO L225 Difference]: With dead ends: 142 [2018-02-04 13:57:01,766 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 13:57:01,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:57:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 13:57:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2018-02-04 13:57:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 13:57:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-04 13:57:01,768 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 60 [2018-02-04 13:57:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:57:01,768 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-04 13:57:01,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:57:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-04 13:57:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:57:01,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:57:01,769 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-04 13:57:01,769 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:57:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691215, now seen corresponding path program 1 times [2018-02-04 13:57:01,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:57:01,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:57:01,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:01,770 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:57:01,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:01,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:57:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:57:02,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:57:02,071 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 13:57:02,076 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:57:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:02,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:57:02,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:02,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:02,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:57:02,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:02,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:02,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-04 13:57:02,255 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 15 treesize of output 12 [2018-02-04 13:57:02,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 [2018-02-04 13:57:02,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:02,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:02,261 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 13:57:02,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-02-04 13:57:02,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 13:57:02,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:02,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:57:02,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:24 [2018-02-04 13:57:02,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-02-04 13:57:02,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-02-04 13:57:02,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:02,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:02,403 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 13:57:02,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-02-04 13:57:02,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:02,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 13:57:02,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:02,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:57:02,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 13:57:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 13:57:02,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:57:02,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2018-02-04 13:57:02,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 13:57:02,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 13:57:02,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:57:02,474 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 31 states. [2018-02-04 13:57:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:57:03,999 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-02-04 13:57:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 13:57:03,999 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2018-02-04 13:57:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:57:04,000 INFO L225 Difference]: With dead ends: 115 [2018-02-04 13:57:04,000 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 13:57:04,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=2506, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 13:57:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 13:57:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2018-02-04 13:57:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 13:57:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-02-04 13:57:04,003 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 61 [2018-02-04 13:57:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:57:04,003 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-02-04 13:57:04,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 13:57:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-02-04 13:57:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:57:04,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:57:04,004 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-04 13:57:04,004 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:57:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691216, now seen corresponding path program 2 times [2018-02-04 13:57:04,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:57:04,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:57:04,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:04,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:57:04,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:04,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:57:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 13:57:04,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:57:04,070 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 13:57:04,078 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:57:04,102 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:57:04,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:57:04,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:57:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 13:57:04,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:57:04,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-02-04 13:57:04,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:57:04,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:57:04,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:57:04,273 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 13 states. [2018-02-04 13:57:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:57:04,457 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 13:57:04,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:57:04,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-04 13:57:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:57:04,457 INFO L225 Difference]: With dead ends: 93 [2018-02-04 13:57:04,457 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 13:57:04,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:57:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 13:57:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-02-04 13:57:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 13:57:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-02-04 13:57:04,459 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 61 [2018-02-04 13:57:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:57:04,459 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-02-04 13:57:04,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:57:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-02-04 13:57:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 13:57:04,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:57:04,460 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:57:04,460 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:57:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081745, now seen corresponding path program 1 times [2018-02-04 13:57:04,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:57:04,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:57:04,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:04,461 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:57:04,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:04,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:57:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 13:57:04,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:57:04,753 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 13:57:04,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:57:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:04,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:57:04,823 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 13:57:04,824 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 13:57:04,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:04,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:04,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:04,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 13:57:05,105 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 27 treesize of output 22 [2018-02-04 13:57:05,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-02-04 13:57:05,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:05,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:05,114 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 13:57:05,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-04 13:57:07,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-02-04 13:57:07,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:07,610 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:57:07,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-02-04 13:57:07,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:07,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:07,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:07,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:50, output treesize:3 [2018-02-04 13:57:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 22 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:57:07,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:57:07,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 30 [2018-02-04 13:57:07,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 13:57:07,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 13:57:07,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=805, Unknown=1, NotChecked=0, Total=930 [2018-02-04 13:57:07,658 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 31 states. [2018-02-04 13:57:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:57:16,840 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-02-04 13:57:16,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 13:57:16,840 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2018-02-04 13:57:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:57:16,840 INFO L225 Difference]: With dead ends: 119 [2018-02-04 13:57:16,840 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 13:57:16,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=314, Invalid=2037, Unknown=1, NotChecked=0, Total=2352 [2018-02-04 13:57:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 13:57:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2018-02-04 13:57:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 13:57:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-02-04 13:57:16,843 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 62 [2018-02-04 13:57:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:57:16,843 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-02-04 13:57:16,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 13:57:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-02-04 13:57:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 13:57:16,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:57:16,843 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:57:16,843 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:57:16,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081744, now seen corresponding path program 1 times [2018-02-04 13:57:16,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:57:16,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:57:16,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:16,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:57:16,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:16,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:57:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:57:17,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:57:17,483 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 13:57:17,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:57:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:17,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:57:17,522 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 13:57:17,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:57:17,573 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 13:57:17,574 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 13:57:17,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,579 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 13:57:17,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 13:57:17,616 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 9 treesize of output 1 [2018-02-04 13:57:17,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-02-04 13:57:17,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:17,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:17,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 13:57:17,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:30 [2018-02-04 13:57:17,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-04 13:57:17,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:17,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-02-04 13:57:17,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,754 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 13:57:17,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:54 [2018-02-04 13:57:17,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-02-04 13:57:17,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:57:17,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:28 [2018-02-04 13:57:17,939 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:57:17,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,948 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:57:17,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:17,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 56 [2018-02-04 13:57:17,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:17,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:36 [2018-02-04 13:57:18,040 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 42 treesize of output 34 [2018-02-04 13:57:18,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:18,042 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:57:18,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:18,042 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 0 case distinctions, treesize of input 34 treesize of output 36 [2018-02-04 13:57:18,043 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:57:18,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:57:18,055 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 13:57:18,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:15 [2018-02-04 13:57:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:57:18,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:57:18,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43 [2018-02-04 13:57:18,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 13:57:18,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 13:57:18,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1751, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 13:57:18,132 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 44 states. [2018-02-04 13:57:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:57:21,363 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-04 13:57:21,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 13:57:21,363 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 62 [2018-02-04 13:57:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:57:21,364 INFO L225 Difference]: With dead ends: 117 [2018-02-04 13:57:21,364 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 13:57:21,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=322, Invalid=3838, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 13:57:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 13:57:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-02-04 13:57:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 13:57:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-04 13:57:21,366 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 62 [2018-02-04 13:57:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:57:21,367 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-04 13:57:21,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 13:57:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-04 13:57:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 13:57:21,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:57:21,367 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:57:21,367 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:57:21,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2094664908, now seen corresponding path program 2 times [2018-02-04 13:57:21,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:57:21,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:57:21,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:21,368 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:57:21,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:21,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:57:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 13:57:21,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:57:21,787 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 13:57:21,792 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:57:21,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:57:21,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:57:21,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:57:21,848 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 13:57:21,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:21,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:21,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:57:21,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:21,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:21,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:57:21,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:21,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:21,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-04 13:57:21,985 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 15 treesize of output 12 [2018-02-04 13:57:21,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 [2018-02-04 13:57:21,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:21,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:21,993 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 13:57:21,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:28 [2018-02-04 13:57:24,081 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~i~0_34 Int) (v_entry_point_~array~0.offset_BEFORE_CALL_22 Int) (v_entry_point_~array~0.base_BEFORE_CALL_24 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_entry_point_~array~0.base_BEFORE_CALL_24) (+ (* 4 v_entry_point_~i~0_34) v_entry_point_~array~0.offset_BEFORE_CALL_22)))) (and (not (= .cse0 v_entry_point_~array~0.base_BEFORE_CALL_24)) (not (= 0 .cse0)) (<= v_entry_point_~i~0_34 0)))) is different from true [2018-02-04 13:57:24,160 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 40 treesize of output 33 [2018-02-04 13:57:24,167 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-02-04 13:57:24,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 13:57:24,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:57:24,184 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 2 xjuncts. [2018-02-04 13:57:24,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2018-02-04 13:57:24,536 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 36 treesize of output 30 [2018-02-04 13:57:24,537 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:57:24,538 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 30 treesize of output 20 [2018-02-04 13:57:24,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:24,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:24,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:24,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 13:57:24,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:24,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 13:57:24,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:24,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:57:24,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 13:57:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 33 refuted. 4 times theorem prover too weak. 2 trivial. 9 not checked. [2018-02-04 13:57:24,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:57:24,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2018-02-04 13:57:24,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 13:57:24,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 13:57:24,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1221, Unknown=1, NotChecked=70, Total=1406 [2018-02-04 13:57:24,647 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 38 states. [2018-02-04 13:57:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:57:28,377 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-02-04 13:57:28,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 13:57:28,377 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 67 [2018-02-04 13:57:28,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:57:28,378 INFO L225 Difference]: With dead ends: 127 [2018-02-04 13:57:28,378 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 13:57:28,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=910, Invalid=5735, Unknown=1, NotChecked=160, Total=6806 [2018-02-04 13:57:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 13:57:28,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-02-04 13:57:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 13:57:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-04 13:57:28,382 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 67 [2018-02-04 13:57:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:57:28,382 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-04 13:57:28,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 13:57:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-04 13:57:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 13:57:28,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:57:28,383 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-02-04 13:57:28,383 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:57:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash -582418738, now seen corresponding path program 2 times [2018-02-04 13:57:28,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:57:28,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:57:28,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:28,384 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:57:28,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:57:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:57:28,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:57:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 13:57:30,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:57:30,859 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:57:30,863 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:57:30,882 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:57:30,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:57:30,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:57:31,181 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 69 treesize of output 66 [2018-02-04 13:57:31,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, 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 11 [2018-02-04 13:57:31,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:31,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:31,197 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 69 treesize of output 66 [2018-02-04 13:57:31,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 13:57:31,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:31,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:31,231 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 13:57:31,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:139, output treesize:157 [2018-02-04 13:57:31,452 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:57:31,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:31,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 86 [2018-02-04 13:57:31,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:57:31,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:57:31,484 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:57:31,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:31,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2018-02-04 13:57:31,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:31,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:31,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-02-04 13:57:31,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:57:31,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:57:31,513 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:57:31,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:57:31,516 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#valid_BEFORE_CALL_52| term size 31 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 13:57:31,519 INFO L168 Benchmark]: Toolchain (without parser) took 207204.89 ms. Allocated memory was 406.3 MB in the beginning and 729.3 MB in the end (delta: 323.0 MB). Free memory was 363.2 MB in the beginning and 463.8 MB in the end (delta: -100.6 MB). Peak memory consumption was 222.4 MB. Max. memory is 5.3 GB. [2018-02-04 13:57:31,520 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 406.3 MB. Free memory is still 369.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:57:31,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.42 ms. Allocated memory is still 406.3 MB. Free memory was 363.2 MB in the beginning and 350.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 13:57:31,520 INFO L168 Benchmark]: Boogie Preprocessor took 25.99 ms. Allocated memory is still 406.3 MB. Free memory was 350.0 MB in the beginning and 348.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:57:31,520 INFO L168 Benchmark]: RCFGBuilder took 160.29 ms. Allocated memory is still 406.3 MB. Free memory was 348.7 MB in the beginning and 330.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 13:57:31,521 INFO L168 Benchmark]: TraceAbstraction took 206855.24 ms. Allocated memory was 406.3 MB in the beginning and 729.3 MB in the end (delta: 323.0 MB). Free memory was 329.3 MB in the beginning and 463.8 MB in the end (delta: -134.4 MB). Peak memory consumption was 188.5 MB. Max. memory is 5.3 GB. [2018-02-04 13:57:31,522 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.11 ms. Allocated memory is still 406.3 MB. Free memory is still 369.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.42 ms. Allocated memory is still 406.3 MB. Free memory was 363.2 MB in the beginning and 350.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.99 ms. Allocated memory is still 406.3 MB. Free memory was 350.0 MB in the beginning and 348.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 160.29 ms. Allocated memory is still 406.3 MB. Free memory was 348.7 MB in the beginning and 330.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 206855.24 ms. Allocated memory was 406.3 MB in the beginning and 729.3 MB in the end (delta: 323.0 MB). Free memory was 329.3 MB in the beginning and 463.8 MB in the end (delta: -134.4 MB). Peak memory consumption was 188.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#valid_BEFORE_CALL_52| term size 31 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#valid_BEFORE_CALL_52| term size 31: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-57-31-526.csv [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...