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-ccafca9-m [2018-02-04 00:38:22,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:38:22,667 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:38:22,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:38:22,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:38:22,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:38:22,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:38:22,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:38:22,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:38:22,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:38:22,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:38:22,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:38:22,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:38:22,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:38:22,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:38:22,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:38:22,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:38:22,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:38:22,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:38:22,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:38:22,693 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:38:22,693 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:38:22,693 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:38:22,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:38:22,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:38:22,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:38:22,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:38:22,696 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:38:22,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:38:22,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:38:22,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:38:22,697 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 00:38:22,707 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:38:22,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:38:22,708 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:38:22,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:38:22,708 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:38:22,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:38:22,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:38:22,709 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:38:22,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:38:22,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:38:22,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:38:22,709 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:38:22,709 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:38:22,709 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:38:22,710 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:38:22,710 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:38:22,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:38:22,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:38:22,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:38:22,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:38:22,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:38:22,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:38:22,711 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:38:22,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:38:22,711 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:38:22,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:38:22,746 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:38:22,750 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:38:22,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:38:22,752 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:38:22,752 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 00:38:22,902 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:38:22,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:38:22,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:38:22,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:38:22,909 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:38:22,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:38:22" (1/1) ... [2018-02-04 00:38:22,912 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 12:38:22, skipping insertion in model container [2018-02-04 00:38:22,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:38:22" (1/1) ... [2018-02-04 00:38:22,926 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:38:22,961 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:38:23,037 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:38:23,049 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:38:23,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23 WrapperNode [2018-02-04 00:38:23,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:38:23,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:38:23,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:38:23,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:38:23,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23" (1/1) ... [2018-02-04 00:38:23,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23" (1/1) ... [2018-02-04 00:38:23,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23" (1/1) ... [2018-02-04 00:38:23,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23" (1/1) ... [2018-02-04 00:38:23,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23" (1/1) ... [2018-02-04 00:38:23,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23" (1/1) ... [2018-02-04 00:38:23,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23" (1/1) ... [2018-02-04 00:38:23,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:38:23,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:38:23,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:38:23,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:38:23,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23" (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 00:38:23,113 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:38:23,113 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:38:23,113 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:38:23,113 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:38:23,114 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:38:23,114 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:38:23,115 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:38:23,115 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:38:23,265 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:38:23,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:38:23 BoogieIcfgContainer [2018-02-04 00:38:23,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:38:23,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:38:23,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:38:23,268 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:38:23,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:38:22" (1/3) ... [2018-02-04 00:38:23,269 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 12:38:23, skipping insertion in model container [2018-02-04 00:38:23,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:23" (2/3) ... [2018-02-04 00:38:23,269 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 12:38:23, skipping insertion in model container [2018-02-04 00:38:23,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:38:23" (3/3) ... [2018-02-04 00:38:23,270 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-04 00:38:23,275 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:38:23,281 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 00:38:23,313 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:38:23,313 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:38:23,313 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:38:23,313 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:38:23,313 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:38:23,313 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:38:23,313 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:38:23,313 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:38:23,314 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:38:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 00:38:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:38:23,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:23,332 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 00:38:23,332 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 00:38:23,336 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-02-04 00:38:23,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:23,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:23,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:23,387 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:23,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:23,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:23,473 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 00:38:23,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:38:23,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:38:23,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:38:23,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:38:23,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:38:23,491 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 00:38:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:23,623 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 00:38:23,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:38:23,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 00:38:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:23,632 INFO L225 Difference]: With dead ends: 74 [2018-02-04 00:38:23,632 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 00:38:23,633 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 00:38:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 00:38:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-02-04 00:38:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 00:38:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 00:38:23,666 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-02-04 00:38:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:23,666 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 00:38:23,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:38:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 00:38:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:38:23,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:23,668 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 00:38:23,668 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 00:38:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-02-04 00:38:23,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:23,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:23,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:23,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:23,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:23,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:23,729 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 00:38:23,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:38:23,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:38:23,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:38:23,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:38:23,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:38:23,731 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-04 00:38:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:23,800 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-02-04 00:38:23,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:38:23,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:38:23,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:23,802 INFO L225 Difference]: With dead ends: 78 [2018-02-04 00:38:23,802 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 00:38:23,803 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 00:38:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 00:38:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-02-04 00:38:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 00:38:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 00:38:23,809 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-02-04 00:38:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:23,809 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 00:38:23,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:38:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 00:38:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 00:38:23,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:23,810 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 00:38:23,811 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 00:38:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-02-04 00:38:23,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:23,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:23,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:23,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:23,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:23,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:23,858 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 00:38:23,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:38:23,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:38:23,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:38:23,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:38:23,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:38:23,859 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-02-04 00:38:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:23,884 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-02-04 00:38:23,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:38:23,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 00:38:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:23,885 INFO L225 Difference]: With dead ends: 86 [2018-02-04 00:38:23,885 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:38:23,886 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 00:38:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:38:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-02-04 00:38:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 00:38:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-02-04 00:38:23,891 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-02-04 00:38:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:23,892 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-02-04 00:38:23,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:38:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-02-04 00:38:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:38:23,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:23,893 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 00:38:23,893 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 00:38:23,893 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-02-04 00:38:23,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:23,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:23,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:23,894 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:23,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:23,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:23,944 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 00:38:23,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:23,944 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 00:38:23,951 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:23,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:23,994 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 00:38:24,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:38:24,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-02-04 00:38:24,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:38:24,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:38:24,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:38:24,016 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-02-04 00:38:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:24,039 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 00:38:24,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:38:24,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 00:38:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:24,041 INFO L225 Difference]: With dead ends: 49 [2018-02-04 00:38:24,041 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 00:38:24,041 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 00:38:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 00:38:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 00:38:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 00:38:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 00:38:24,044 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-02-04 00:38:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:24,044 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 00:38:24,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:38:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 00:38:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 00:38:24,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:24,044 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 00:38:24,044 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 00:38:24,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-02-04 00:38:24,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:24,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:24,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:24,046 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:24,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:24,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:24,093 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 00:38:24,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:38:24,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:38:24,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:38:24,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:38:24,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:38:24,094 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-02-04 00:38:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:24,106 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-02-04 00:38:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:38:24,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 00:38:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:24,107 INFO L225 Difference]: With dead ends: 51 [2018-02-04 00:38:24,107 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 00:38:24,107 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 00:38:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 00:38:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-04 00:38:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 00:38:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 00:38:24,111 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-02-04 00:38:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:24,111 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 00:38:24,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:38:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 00:38:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:38:24,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:24,112 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 00:38:24,112 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 00:38:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-02-04 00:38:24,113 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:24,113 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:24,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:24,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:24,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:24,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:24,208 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 00:38:24,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:24,208 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 00:38:24,213 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:24,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:24,253 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 00:38:24,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:24,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:24,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:38:24,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:24,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:24,285 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 00:38:24,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:24,290 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 00:38:24,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 00:38:24,307 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 00:38:24,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:24,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-04 00:38:24,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:38:24,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:38:24,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:38:24,326 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states. [2018-02-04 00:38:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:24,540 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-02-04 00:38:24,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:38:24,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-04 00:38:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:24,541 INFO L225 Difference]: With dead ends: 72 [2018-02-04 00:38:24,541 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 00:38:24,541 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 00:38:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 00:38:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-02-04 00:38:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 00:38:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-04 00:38:24,545 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28 [2018-02-04 00:38:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:24,546 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-04 00:38:24,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:38:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-04 00:38:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:38:24,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:24,547 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 00:38:24,547 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 00:38:24,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-02-04 00:38:24,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:24,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:24,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:24,549 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:24,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:24,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:24,846 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 00:38:24,846 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:24,847 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 00:38:24,858 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:24,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:24,904 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 00:38:24,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:24,921 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 00:38:24,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:24,924 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 00:38:24,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:24,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 00:38:24,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:24,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:38:24,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:38:25,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:25,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:25,171 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 00:38:25,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:25,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:25,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:25,224 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 00:38:25,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:25,259 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 00:38:25,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:25,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:25,292 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 00:38:25,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:25,326 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 00:38:25,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 00:38:25,405 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 00:38:25,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:25,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-02-04 00:38:25,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:38:25,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:38:25,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=295, Unknown=1, NotChecked=0, Total=342 [2018-02-04 00:38:25,425 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 19 states. [2018-02-04 00:39:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:07,273 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-02-04 00:39:07,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 00:39:07,273 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-02-04 00:39:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:07,274 INFO L225 Difference]: With dead ends: 103 [2018-02-04 00:39:07,274 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 00:39:07,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=122, Invalid=686, Unknown=4, NotChecked=0, Total=812 [2018-02-04 00:39:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 00:39:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 70. [2018-02-04 00:39:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 00:39:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-02-04 00:39:07,278 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 28 [2018-02-04 00:39:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:07,279 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-02-04 00:39:07,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:39:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-02-04 00:39:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 00:39:07,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:07,280 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 00:39:07,280 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 00:39:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1097237542, now seen corresponding path program 1 times [2018-02-04 00:39:07,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:07,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:07,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:07,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:07,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:07,309 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 00:39:07,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:39:07,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:39:07,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:39:07,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:39:07,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:39:07,310 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2018-02-04 00:39:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:07,328 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-04 00:39:07,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:39:07,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 00:39:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:07,330 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:39:07,330 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 00:39:07,330 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 00:39:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 00:39:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-04 00:39:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 00:39:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-02-04 00:39:07,334 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 29 [2018-02-04 00:39:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:07,334 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-02-04 00:39:07,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:39:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-02-04 00:39:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:39:07,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:07,335 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 00:39:07,335 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 00:39:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1190998490, now seen corresponding path program 1 times [2018-02-04 00:39:07,336 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:07,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:07,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,337 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:07,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:07,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:07,419 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 00:39:07,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:07,419 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 00:39:07,424 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:07,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:07,498 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 00:39:07,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:07,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-02-04 00:39:07,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:39:07,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:39:07,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-02-04 00:39:07,523 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 13 states. [2018-02-04 00:39:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:07,727 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-02-04 00:39:07,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:39:07,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-04 00:39:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:07,728 INFO L225 Difference]: With dead ends: 69 [2018-02-04 00:39:07,728 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 00:39:07,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306 [2018-02-04 00:39:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 00:39:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 00:39:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 00:39:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 00:39:07,731 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2018-02-04 00:39:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:07,731 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 00:39:07,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:39:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 00:39:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:39:07,731 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:07,731 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 00:39:07,732 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 00:39:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1833910404, now seen corresponding path program 1 times [2018-02-04 00:39:07,732 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:07,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:07,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,732 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:07,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:07,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:07,768 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 00:39:07,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:39:07,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:39:07,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:39:07,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:39:07,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:39:07,769 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-02-04 00:39:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:07,821 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-04 00:39:07,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:39:07,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 00:39:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:07,822 INFO L225 Difference]: With dead ends: 58 [2018-02-04 00:39:07,822 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 00:39:07,822 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 00:39:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 00:39:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-04 00:39:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 00:39:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-04 00:39:07,825 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34 [2018-02-04 00:39:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:07,825 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-04 00:39:07,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:39:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-04 00:39:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:39:07,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:07,826 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 00:39:07,826 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 00:39:07,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1409435322, now seen corresponding path program 1 times [2018-02-04 00:39:07,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:07,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:07,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:07,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:07,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:07,878 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 00:39:07,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:07,878 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 00:39:07,884 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:07,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:07,920 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 00:39:07,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:07,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-04 00:39:07,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:39:07,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:39:07,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:39:07,942 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states. [2018-02-04 00:39:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:07,965 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-02-04 00:39:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:39:07,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-04 00:39:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:07,966 INFO L225 Difference]: With dead ends: 87 [2018-02-04 00:39:07,966 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 00:39:07,966 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 00:39:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 00:39:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2018-02-04 00:39:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 00:39:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-02-04 00:39:07,969 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 34 [2018-02-04 00:39:07,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:07,969 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-02-04 00:39:07,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:39:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-02-04 00:39:07,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:39:07,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:07,970 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 00:39:07,971 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 00:39:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash 804244387, now seen corresponding path program 1 times [2018-02-04 00:39:07,971 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:07,971 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:07,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,972 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:07,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:07,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:08,296 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 00:39:08,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:08,296 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 00:39:08,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:08,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:08,355 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 00:39:08,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:08,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 00:39:08,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:08,380 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 00:39:08,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:08,381 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 00:39:08,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:08,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:39:08,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:39:08,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:08,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:08,600 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 00:39:08,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:08,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:08,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:08,623 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 00:39:08,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:08,633 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 00:39:08,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-02-04 00:39:08,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:08,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:08,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:08,793 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 00:39:08,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:08,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:08,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:08,816 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 00:39:08,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:08,826 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 00:39:08,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-02-04 00:39:08,889 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 00:39:08,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:08,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-02-04 00:39:08,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:39:08,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:39:08,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=528, Unknown=1, NotChecked=0, Total=600 [2018-02-04 00:39:08,908 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 25 states. [2018-02-04 00:39:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:09,415 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-02-04 00:39:09,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:39:09,415 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2018-02-04 00:39:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:09,416 INFO L225 Difference]: With dead ends: 86 [2018-02-04 00:39:09,416 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:39:09,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=982, Unknown=3, NotChecked=0, Total=1122 [2018-02-04 00:39:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:39:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-02-04 00:39:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 00:39:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2018-02-04 00:39:09,419 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 41 [2018-02-04 00:39:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:09,419 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2018-02-04 00:39:09,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:39:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2018-02-04 00:39:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:39:09,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:09,420 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 00:39:09,420 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 00:39:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 835021389, now seen corresponding path program 1 times [2018-02-04 00:39:09,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:09,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:09,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:09,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:09,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:09,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:09,476 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 00:39:09,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:39:09,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:39:09,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:39:09,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:39:09,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:39:09,477 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 6 states. [2018-02-04 00:39:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:09,555 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-02-04 00:39:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:39:09,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-04 00:39:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:09,556 INFO L225 Difference]: With dead ends: 80 [2018-02-04 00:39:09,556 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:39:09,556 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 00:39:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:39:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 00:39:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 00:39:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-02-04 00:39:09,559 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 42 [2018-02-04 00:39:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:09,559 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-02-04 00:39:09,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:39:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-02-04 00:39:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 00:39:09,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:09,560 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 00:39:09,560 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 00:39:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash 115859282, now seen corresponding path program 1 times [2018-02-04 00:39:09,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:09,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:09,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:09,561 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:09,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:09,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:09,734 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 00:39:09,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:09,734 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 00:39:09,740 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:09,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:09,797 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 00:39:09,799 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 00:39:09,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:09,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:09,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:09,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 00:39:09,956 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 00:39:09,958 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:39:09,959 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 00:39:09,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:09,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:09,965 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 00:39:09,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-02-04 00:39:09,968 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 00:39:10,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:10,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-02-04 00:39:10,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 00:39:10,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 00:39:10,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:39:10,002 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 20 states. [2018-02-04 00:39:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:10,217 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-04 00:39:10,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:39:10,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-02-04 00:39:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:10,218 INFO L225 Difference]: With dead ends: 93 [2018-02-04 00:39:10,218 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 00:39:10,218 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 00:39:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 00:39:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-02-04 00:39:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 00:39:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-02-04 00:39:10,220 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 43 [2018-02-04 00:39:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:10,220 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-02-04 00:39:10,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 00:39:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-02-04 00:39:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 00:39:10,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:10,221 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 00:39:10,221 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 00:39:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash 115859283, now seen corresponding path program 1 times [2018-02-04 00:39:10,221 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:10,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:10,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:10,222 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:10,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:10,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:10,435 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 00:39:10,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:10,435 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 00:39:10,440 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:10,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:10,463 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 00:39:10,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:10,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:10,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:39:10,487 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 00:39:10,489 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 00:39:10,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:10,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:10,495 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 00:39:10,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 00:39:10,527 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 00:39:10,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:10,529 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 00:39:10,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-02-04 00:39:10,565 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 00:39:10,566 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:39:10,567 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 00:39:10,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:10,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:10,573 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 00:39:10,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-02-04 00:39:10,575 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 00:39:10,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:10,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2018-02-04 00:39:10,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:39:10,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:39:10,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:39:10,593 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 22 states. [2018-02-04 00:39:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:10,844 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-02-04 00:39:10,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:39:10,844 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-04 00:39:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:10,844 INFO L225 Difference]: With dead ends: 86 [2018-02-04 00:39:10,845 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:39:10,845 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 00:39:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:39:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 00:39:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 00:39:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2018-02-04 00:39:10,847 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 43 [2018-02-04 00:39:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:10,848 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2018-02-04 00:39:10,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:39:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-02-04 00:39:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 00:39:10,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:10,849 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 00:39:10,849 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 00:39:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash -329856377, now seen corresponding path program 1 times [2018-02-04 00:39:10,849 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:10,849 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:10,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:10,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:10,850 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:10,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:10,887 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 00:39:10,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:10,887 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 00:39:10,894 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:10,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:10,927 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 00:39:10,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:39:10,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-02-04 00:39:10,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:39:10,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:39:10,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:39:10,956 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 6 states. [2018-02-04 00:39:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:10,989 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-04 00:39:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:39:10,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-04 00:39:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:10,990 INFO L225 Difference]: With dead ends: 84 [2018-02-04 00:39:10,990 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 00:39:10,990 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 00:39:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 00:39:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 00:39:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 00:39:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-04 00:39:10,994 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 45 [2018-02-04 00:39:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:10,994 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-04 00:39:10,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:39:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-04 00:39:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 00:39:10,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:10,995 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 00:39:10,995 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 00:39:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1632885427, now seen corresponding path program 2 times [2018-02-04 00:39:10,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:10,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:10,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:10,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:10,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:11,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:11,032 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 00:39:11,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:11,033 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 00:39:11,044 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:39:11,068 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:39:11,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:39:11,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:11,104 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 00:39:11,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:11,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 00:39:11,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:39:11,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:39:11,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:39:11,136 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 9 states. [2018-02-04 00:39:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:11,187 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-04 00:39:11,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:39:11,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-02-04 00:39:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:11,188 INFO L225 Difference]: With dead ends: 120 [2018-02-04 00:39:11,188 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 00:39:11,188 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 00:39:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 00:39:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2018-02-04 00:39:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 00:39:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-02-04 00:39:11,192 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 47 [2018-02-04 00:39:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:11,192 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-02-04 00:39:11,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:39:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-02-04 00:39:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:39:11,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:11,193 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 00:39:11,193 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 00:39:11,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576177, now seen corresponding path program 1 times [2018-02-04 00:39:11,193 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:11,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:11,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:11,194 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:39:11,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:11,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:11,460 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 00:39:11,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:11,460 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 00:39:11,467 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:11,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:11,483 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 00:39:11,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:39:11,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:11,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:11,551 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 00:39:11,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-04 00:39:11,582 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 00:39:11,584 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 00:39:11,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,590 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 00:39:11,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-02-04 00:39:11,634 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 00:39:11,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,638 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 00:39:11,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:31 [2018-02-04 00:39:11,759 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 00:39:11,760 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:39:11,761 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 00:39:11,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,769 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 00:39:11,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 00:39:11,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:11,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:39:11,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:11,790 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 00:39:11,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 00:39:11,817 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 00:39:11,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:11,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-02-04 00:39:11,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 00:39:11,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 00:39:11,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 00:39:11,835 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 33 states. [2018-02-04 00:39:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:12,751 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-02-04 00:39:12,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 00:39:12,751 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-02-04 00:39:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:12,752 INFO L225 Difference]: With dead ends: 100 [2018-02-04 00:39:12,752 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 00:39:12,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=2674, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 00:39:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 00:39:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-04 00:39:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 00:39:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-02-04 00:39:12,755 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 48 [2018-02-04 00:39:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:12,755 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-02-04 00:39:12,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 00:39:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-02-04 00:39:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:39:12,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:12,756 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 00:39:12,756 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 00:39:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576227, now seen corresponding path program 1 times [2018-02-04 00:39:12,756 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:12,756 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:12,757 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:12,757 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:12,757 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:12,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:12,793 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 00:39:12,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:12,793 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 00:39:12,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:12,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:12,833 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 00:39:12,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:12,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 00:39:12,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:39:12,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:39:12,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:39:12,865 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2018-02-04 00:39:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:12,907 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-02-04 00:39:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:39:12,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-04 00:39:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:12,908 INFO L225 Difference]: With dead ends: 95 [2018-02-04 00:39:12,908 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 00:39:12,908 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 00:39:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 00:39:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-02-04 00:39:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 00:39:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-02-04 00:39:12,911 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 48 [2018-02-04 00:39:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:12,912 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-02-04 00:39:12,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:39:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-02-04 00:39:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 00:39:12,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:12,912 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 00:39:12,912 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 00:39:12,913 INFO L82 PathProgramCache]: Analyzing trace with hash 255829617, now seen corresponding path program 1 times [2018-02-04 00:39:12,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:12,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:12,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:12,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:12,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:12,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:13,696 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 00:39:13,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:13,696 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 00:39:13,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:13,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:13,924 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 00:39:13,925 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 00:39:13,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:13,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:13,935 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 00:39:13,937 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 00:39:13,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:13,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:13,963 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 00:39:13,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-02-04 00:39:14,089 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 00:39:14,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:14,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 53 treesize of output 35 [2018-02-04 00:39:14,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:14,112 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 00:39:14,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-02-04 00:39:20,325 WARN L146 SmtUtils]: Spent 4036ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-02-04 00:39:22,403 WARN L143 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 66 [2018-02-04 00:39:24,504 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 00:39:24,517 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 00:39:24,521 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 00:39:24,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:24,570 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:39:24,570 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 00:39:24,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:24,624 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:39:24,629 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 00:39:24,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 00:39:24,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:24,691 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 00:39:24,692 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:39:24,693 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:39:24,693 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 00:39:24,693 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:24,703 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:39:24,725 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 00:39:24,725 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:182, output treesize:63 [2018-02-04 00:39:26,930 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 00:39:26,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:26,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2018-02-04 00:39:26,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 00:39:26,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 00:39:26,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1147, Unknown=25, NotChecked=0, Total=1260 [2018-02-04 00:39:26,953 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 36 states. [2018-02-04 00:39:37,273 WARN L146 SmtUtils]: Spent 4817ms on a formula simplification. DAG size of input: 172 DAG size of output 41 [2018-02-04 00:39:44,039 WARN L146 SmtUtils]: Spent 6492ms on a formula simplification. DAG size of input: 181 DAG size of output 45 [2018-02-04 00:39:44,408 WARN L146 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 140 DAG size of output 88 [2018-02-04 00:39:44,645 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 130 DAG size of output 77 [2018-02-04 00:39:46,879 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 111 DAG size of output 63 [2018-02-04 00:39:47,155 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 127 DAG size of output 77 [2018-02-04 00:39:51,443 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 105 DAG size of output 79 [2018-02-04 00:39:56,044 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 89 DAG size of output 74 [2018-02-04 00:39:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:58,633 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-02-04 00:39:58,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 00:39:58,633 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2018-02-04 00:39:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:58,634 INFO L225 Difference]: With dead ends: 107 [2018-02-04 00:39:58,634 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:39:58,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=370, Invalid=3240, Unknown=50, NotChecked=0, Total=3660 [2018-02-04 00:39:58,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:39:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-02-04 00:39:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 00:39:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-04 00:39:58,637 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 51 [2018-02-04 00:39:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:58,638 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-04 00:39:58,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 00:39:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-04 00:39:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 00:39:58,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:58,639 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 00:39:58,639 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 00:39:58,639 INFO L82 PathProgramCache]: Analyzing trace with hash 797091222, now seen corresponding path program 2 times [2018-02-04 00:39:58,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:58,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:58,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:58,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:58,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:58,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:58,921 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 00:39:58,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:58,922 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 00:39:58,927 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:39:58,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:39:58,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:39:58,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:58,966 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 00:39:58,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:58,978 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 00:39:58,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:58,989 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 00:39:58,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:58,990 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 00:39:58,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:59,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:39:59,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:39:59,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:59,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:59,241 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 00:39:59,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:59,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:59,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:59,284 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 00:39:59,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:59,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:59,332 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 00:39:59,332 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:59,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:59,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:39:59,386 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 00:39:59,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:39:59,424 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 00:39:59,425 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 00:39:59,892 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 57 DAG size of output 54 [2018-02-04 00:40:00,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,100 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 00:40:00,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 00:40:00,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,264 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 00:40:00,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:00,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,438 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 00:40:00,438 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:00,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,626 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 00:40:00,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 00:40:00,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:00,850 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 00:40:00,851 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:01,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:01,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:01,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:01,021 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 00:40:01,022 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 00:40:01,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:01,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:01,257 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 00:40:01,257 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:01,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:01,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:01,262 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 00:40:01,263 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:01,496 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 00:40:01,497 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 00:40:01,804 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 00:40:01,804 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-02-04 00:40:02,346 WARN L146 SmtUtils]: Spent 291ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-02-04 00:40:02,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:02,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:02,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:02,616 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 00:40:02,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 00:40:02,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:02,801 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 00:40:02,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 00:40:03,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,004 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 00:40:03,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:03,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,007 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 00:40:03,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:03,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,221 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 00:40:03,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 00:40:03,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,535 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 00:40:03,536 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 00:40:03,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,848 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 00:40:03,849 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:03,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:03,852 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 00:40:03,852 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:04,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:04,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:04,252 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 00:40:04,252 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:04,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:04,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:04,255 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 00:40:04,255 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:04,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:04,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:04,564 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 00:40:04,564 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:04,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:04,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:04,574 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 00:40:04,574 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:04,819 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 00:40:04,820 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-02-04 00:40:05,226 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-02-04 00:40:05,253 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 00:40:05,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:05,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-02-04 00:40:05,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 00:40:05,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 00:40:05,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=678, Unknown=2, NotChecked=0, Total=756 [2018-02-04 00:40:05,276 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 28 states. [2018-02-04 00:40:28,261 WARN L146 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 52 DAG size of output 51 [2018-02-04 00:40:30,437 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 00:40:31,126 WARN L146 SmtUtils]: Spent 638ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 00:40:31,375 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-02-04 00:40:31,581 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-02-04 00:40:31,964 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 57 DAG size of output 55 [2018-02-04 00:40:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:32,354 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2018-02-04 00:40:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:40:32,354 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-02-04 00:40:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:32,355 INFO L225 Difference]: With dead ends: 110 [2018-02-04 00:40:32,355 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 00:40:32,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=206, Invalid=1594, Unknown=6, NotChecked=0, Total=1806 [2018-02-04 00:40:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 00:40:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2018-02-04 00:40:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 00:40:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-04 00:40:32,357 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 54 [2018-02-04 00:40:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:32,358 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-04 00:40:32,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 00:40:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-04 00:40:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:40:32,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:32,358 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 00:40:32,358 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 00:40:32,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602309, now seen corresponding path program 2 times [2018-02-04 00:40:32,358 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:32,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:32,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:32,359 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:32,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:32,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:32,500 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 00:40:32,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:32,500 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 00:40:32,505 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:40:32,519 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:40:32,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:32,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:32,558 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 00:40:32,559 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 00:40:32,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:32,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:40:32,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:40:32,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 00:40:38,628 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 00:40:38,629 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 00:40:38,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:38,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:40:38,630 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 00:40:38,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 00:40:38,632 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 00:40:38,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:38,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-02-04 00:40:38,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:40:38,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:40:38,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=366, Unknown=3, NotChecked=0, Total=420 [2018-02-04 00:40:38,650 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 21 states. [2018-02-04 00:40:40,891 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-04 00:40:42,985 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-04 00:40:45,142 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 23 [2018-02-04 00:40:47,223 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-04 00:40:49,248 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 28 [2018-02-04 00:40:51,265 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-04 00:40:53,291 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-04 00:40:55,313 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 26 [2018-02-04 00:40:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:55,314 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-04 00:40:55,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 00:40:55,315 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 00:40:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:55,315 INFO L225 Difference]: With dead ends: 114 [2018-02-04 00:40:55,315 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 00:40:55,316 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 00:40:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 00:40:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2018-02-04 00:40:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 00:40:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-02-04 00:40:55,318 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 56 [2018-02-04 00:40:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:55,318 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-02-04 00:40:55,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:40:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-02-04 00:40:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:40:55,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:55,318 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 00:40:55,318 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 00:40:55,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602310, now seen corresponding path program 2 times [2018-02-04 00:40:55,318 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:55,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:55,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:55,319 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:55,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:55,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:55,568 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 00:40:55,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:55,568 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 00:40:55,576 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:40:55,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:40:55,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:55,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:55,624 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 00:40:55,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:55,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:40:55,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:40:55,662 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 00:40:55,664 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 00:40:55,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:55,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:40:55,669 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 00:40:55,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 00:40:55,706 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 00:40:55,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:55,708 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 00:40:55,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 00:40:55,731 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 00:40:55,732 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 00:40:55,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:55,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:40:55,734 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 00:40:55,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-04 00:40:55,737 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 00:40:55,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:55,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2018-02-04 00:40:55,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:40:55,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:40:55,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:40:55,756 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 23 states. [2018-02-04 00:40:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:56,139 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-02-04 00:40:56,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 00:40:56,139 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-02-04 00:40:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:56,139 INFO L225 Difference]: With dead ends: 90 [2018-02-04 00:40:56,139 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 00:40:56,140 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 00:40:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 00:40:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2018-02-04 00:40:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 00:40:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-02-04 00:40:56,142 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 56 [2018-02-04 00:40:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:56,142 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-02-04 00:40:56,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:40:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-02-04 00:40:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 00:40:56,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:56,143 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 00:40:56,143 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 00:40:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1244279398, now seen corresponding path program 3 times [2018-02-04 00:40:56,143 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:56,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:56,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:56,144 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:56,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:56,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:56,194 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 00:40:56,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:56,195 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 00:40:56,202 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:40:56,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 00:40:56,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:56,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:56,257 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 00:40:56,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:56,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 00:40:56,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:40:56,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:40:56,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:40:56,276 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 11 states. [2018-02-04 00:40:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:56,305 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-02-04 00:40:56,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:40:56,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-02-04 00:40:56,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:56,306 INFO L225 Difference]: With dead ends: 142 [2018-02-04 00:40:56,306 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 00:40:56,306 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 00:40:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 00:40:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2018-02-04 00:40:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 00:40:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-04 00:40:56,308 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 60 [2018-02-04 00:40:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:56,308 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-04 00:40:56,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:40:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-04 00:40:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:40:56,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:56,308 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 00:40:56,308 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 00:40:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691215, now seen corresponding path program 1 times [2018-02-04 00:40:56,309 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:56,309 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:56,309 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:56,309 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:56,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:56,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:56,578 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 00:40:56,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:56,578 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 00:40:56,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:56,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:56,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:56,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:56,669 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 00:40:56,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:56,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:40:56,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-04 00:40:56,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 00:40:56,701 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 00:40:56,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:56,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:40:56,706 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 00:40:56,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-02-04 00:40:56,743 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 00:40:56,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:56,746 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 00:40:56,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:24 [2018-02-04 00:40:56,932 WARN L143 SmtUtils]: Spent 152ms on a formula simplification that was a NOOP. DAG size: 18 [2018-02-04 00:40:56,982 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 00:40:56,983 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 00:40:56,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:56,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:40:56,987 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 00:40:56,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-02-04 00:40:57,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:40:57,013 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 00:40:57,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:57,017 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 00:40:57,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 00:40:57,040 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 00:40:57,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:57,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2018-02-04 00:40:57,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 00:40:57,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 00:40:57,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2018-02-04 00:40:57,057 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 31 states. [2018-02-04 00:41:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:00,875 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-02-04 00:41:00,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 00:41:00,876 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2018-02-04 00:41:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:00,876 INFO L225 Difference]: With dead ends: 115 [2018-02-04 00:41:00,876 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 00:41:00,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=250, Invalid=2505, Unknown=1, NotChecked=0, Total=2756 [2018-02-04 00:41:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 00:41:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2018-02-04 00:41:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 00:41:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-02-04 00:41:00,879 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 61 [2018-02-04 00:41:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:00,879 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-02-04 00:41:00,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 00:41:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-02-04 00:41:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:41:00,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:00,880 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 00:41:00,880 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 00:41:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691216, now seen corresponding path program 2 times [2018-02-04 00:41:00,880 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:00,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:00,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:00,881 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:00,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:00,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:00,947 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 00:41:00,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:41:00,947 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 00:41:00,953 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:41:00,971 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:41:00,972 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:41:00,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:41:01,132 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 00:41:01,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:41:01,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-02-04 00:41:01,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:41:01,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:41:01,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:41:01,150 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 13 states. [2018-02-04 00:41:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:01,354 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 00:41:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:41:01,354 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-04 00:41:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:01,354 INFO L225 Difference]: With dead ends: 93 [2018-02-04 00:41:01,354 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 00:41:01,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:41:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 00:41:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-02-04 00:41:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 00:41:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-02-04 00:41:01,357 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 61 [2018-02-04 00:41:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:01,357 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-02-04 00:41:01,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:41:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-02-04 00:41:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 00:41:01,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:01,358 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 00:41:01,358 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 00:41:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081745, now seen corresponding path program 1 times [2018-02-04 00:41:01,358 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:01,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:01,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:01,359 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:41:01,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:01,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:01,695 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 00:41:01,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:41:01,695 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 00:41:01,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:01,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:41:01,764 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 00:41:01,766 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 00:41:01,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:01,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:01,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:01,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 00:41:02,081 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 00:41:02,083 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 00:41:02,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:02,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:02,090 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 00:41:02,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-04 00:41:04,719 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 00:41:04,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:04,721 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:41:04,722 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 00:41:04,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:04,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:04,728 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 00:41:04,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:50, output treesize:3 [2018-02-04 00:41:04,735 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 00:41:04,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:41:04,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 30 [2018-02-04 00:41:04,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 00:41:04,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 00:41:04,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=805, Unknown=1, NotChecked=0, Total=930 [2018-02-04 00:41:04,752 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 31 states. [2018-02-04 00:41:11,519 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 54 DAG size of output 31 [2018-02-04 00:41:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:16,252 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-02-04 00:41:16,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 00:41:16,252 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2018-02-04 00:41:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:16,252 INFO L225 Difference]: With dead ends: 119 [2018-02-04 00:41:16,252 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 00:41:16,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=299, Invalid=1956, Unknown=1, NotChecked=0, Total=2256 [2018-02-04 00:41:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 00:41:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2018-02-04 00:41:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 00:41:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-02-04 00:41:16,255 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 62 [2018-02-04 00:41:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:16,255 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-02-04 00:41:16,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 00:41:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-02-04 00:41:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 00:41:16,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:16,255 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 00:41:16,255 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 00:41:16,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081744, now seen corresponding path program 1 times [2018-02-04 00:41:16,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:16,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:16,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:16,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:16,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:16,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:16,868 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 00:41:16,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:41:16,869 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 00:41:16,873 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:16,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:41:16,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:41:16,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:16,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:16,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:41:16,959 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 00:41:16,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:41:16,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:16,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:16,964 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 00:41:16,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 00:41:16,997 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 00:41:16,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:16,997 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 00:41:16,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-02-04 00:41:17,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:17,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:17,047 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 00:41:17,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:17,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:17,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:30 [2018-02-04 00:41:17,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:41:17,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:17,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:41:17,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:17,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:17,128 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 00:41:17,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:54 [2018-02-04 00:41:17,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 00:41:17,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:17,197 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 00:41:17,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:28 [2018-02-04 00:41:17,307 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 00:41:17,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:17,314 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:41:17,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:17,315 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 00:41:17,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:17,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:17,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:36 [2018-02-04 00:41:17,403 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 00:41:17,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:17,405 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:41:17,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:17,406 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 00:41:17,407 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 00:41:17,411 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 00:41:17,415 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 00:41:17,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:15 [2018-02-04 00:41:17,451 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 00:41:17,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:41:17,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43 [2018-02-04 00:41:17,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 00:41:17,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 00:41:17,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1751, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 00:41:17,469 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 44 states. [2018-02-04 00:41:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:20,584 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-04 00:41:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 00:41:20,584 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 62 [2018-02-04 00:41:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:20,585 INFO L225 Difference]: With dead ends: 117 [2018-02-04 00:41:20,585 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 00:41:20,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=322, Invalid=3838, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 00:41:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 00:41:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-02-04 00:41:20,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 00:41:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-04 00:41:20,587 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 62 [2018-02-04 00:41:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:20,588 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-04 00:41:20,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 00:41:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-04 00:41:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 00:41:20,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:20,588 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 00:41:20,588 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 00:41:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2094664908, now seen corresponding path program 2 times [2018-02-04 00:41:20,588 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:20,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:20,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:20,589 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:20,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:20,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:20,910 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 00:41:20,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:41:20,910 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 00:41:20,919 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:41:20,940 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:41:20,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:41:20,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:41:20,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:41:20,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:20,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:20,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:41:21,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:21,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:21,034 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 00:41:21,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:21,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:21,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-04 00:41:21,087 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 00:41:21,088 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 00:41:21,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:21,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:21,095 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 00:41:21,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:28 [2018-02-04 00:41:21,946 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 00:41:21,952 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 00:41:21,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 00:41:21,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:41:21,969 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 00:41:21,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2018-02-04 00:41:22,889 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 00:41:22,890 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:41:22,890 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 00:41:22,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:22,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:22,904 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 00:41:22,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 00:41:22,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:22,985 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 00:41:22,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:22,989 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 00:41:22,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 00:41:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:41:24,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:41:24,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2018-02-04 00:41:24,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 00:41:24,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 00:41:24,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 00:41:24,163 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 38 states. [2018-02-04 00:41:30,855 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 79 DAG size of output 41 [2018-02-04 00:41:31,273 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 74 DAG size of output 36 [2018-02-04 00:41:31,675 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 81 DAG size of output 42 [2018-02-04 00:41:32,136 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 76 DAG size of output 37 [2018-02-04 00:41:32,418 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 80 DAG size of output 41 [2018-02-04 00:41:35,204 WARN L146 SmtUtils]: Spent 2459ms on a formula simplification. DAG size of input: 66 DAG size of output 50 [2018-02-04 00:41:35,617 WARN L146 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 89 DAG size of output 49 [2018-02-04 00:41:36,143 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 88 DAG size of output 49 [2018-02-04 00:41:36,594 WARN L146 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 82 DAG size of output 43 [2018-02-04 00:41:36,911 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 82 DAG size of output 42 [2018-02-04 00:41:37,728 WARN L146 SmtUtils]: Spent 321ms on a formula simplification. DAG size of input: 61 DAG size of output 45 [2018-02-04 00:41:38,577 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 88 DAG size of output 47 [2018-02-04 00:41:39,050 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 62 DAG size of output 46 [2018-02-04 00:41:41,468 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 66 DAG size of output 36 [2018-02-04 00:41:43,647 WARN L146 SmtUtils]: Spent 2055ms on a formula simplification. DAG size of input: 70 DAG size of output 53 [2018-02-04 00:41:50,162 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 70 DAG size of output 41 [2018-02-04 00:41:50,493 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 67 DAG size of output 38 [2018-02-04 00:41:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:53,630 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-02-04 00:41:53,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 00:41:53,631 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 67 [2018-02-04 00:41:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:53,631 INFO L225 Difference]: With dead ends: 129 [2018-02-04 00:41:53,631 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 00:41:53,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=940, Invalid=5866, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 00:41:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 00:41:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-02-04 00:41:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 00:41:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-04 00:41:53,635 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 67 [2018-02-04 00:41:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:53,635 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-04 00:41:53,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 00:41:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-04 00:41:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 00:41:53,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:53,636 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 00:41:53,636 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 00:41:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash -582418738, now seen corresponding path program 2 times [2018-02-04 00:41:53,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:53,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:53,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:53,636 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:41:53,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:53,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 00:41:55,273 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 00:41:55,276 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 00:41:55,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:41:55 BoogieIcfgContainer [2018-02-04 00:41:55,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:41:55,277 INFO L168 Benchmark]: Toolchain (without parser) took 212374.45 ms. Allocated memory was 400.0 MB in the beginning and 697.3 MB in the end (delta: 297.3 MB). Free memory was 356.7 MB in the beginning and 656.3 MB in the end (delta: -299.6 MB). Peak memory consumption was 247.1 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:55,278 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:41:55,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.67 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 343.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:55,279 INFO L168 Benchmark]: Boogie Preprocessor took 26.90 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 342.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:55,279 INFO L168 Benchmark]: RCFGBuilder took 184.87 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 323.6 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:55,279 INFO L168 Benchmark]: TraceAbstraction took 212010.35 ms. Allocated memory was 400.0 MB in the beginning and 697.3 MB in the end (delta: 297.3 MB). Free memory was 322.3 MB in the beginning and 656.3 MB in the end (delta: -334.0 MB). Peak memory consumption was 212.7 MB. Max. memory is 5.3 GB. [2018-02-04 00:41:55,280 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.13 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.67 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 343.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.90 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 342.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 184.87 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 323.6 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 212010.35 ms. Allocated memory was 400.0 MB in the beginning and 697.3 MB in the end (delta: 297.3 MB). Free memory was 322.3 MB in the beginning and 656.3 MB in the end (delta: -334.0 MB). Peak memory consumption was 212.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 211.9s OverallTime, 30 OverallIterations, 4 TraceHistogramMax, 168.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1171 SDtfs, 2819 SDslu, 7670 SDs, 0 SdLazy, 9204 SolverSat, 815 SolverUnsat, 106 SolverUnknown, 0 SolverNotchecked, 94.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1678 GetRequests, 928 SyntacticMatches, 53 SemanticMatches, 697 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6912 ImplicationChecksByTransitivity, 104.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 411 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 2290 NumberOfCodeBlocks, 2290 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2239 ConstructedInterpolants, 239 QuantifiedInterpolants, 1231428 SizeOfPredicates, 121 NumberOfNonLiveVariables, 3764 ConjunctsInSsa, 492 ConjunctsInUnsatCore, 51 InterpolantComputations, 9 PerfectInterpolantSequences, 725/1379 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-41-55-285.csv 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-TraceAbstractionBenchmarks-0-2018-02-04_00-41-55-285.csv Completed graceful shutdown