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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:04:54,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:04:54,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:04:54,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:04:54,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:04:54,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:04:54,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:04:54,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:04:54,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:04:54,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:04:54,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:04:54,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:04:54,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:04:54,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:04:54,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:04:54,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:04:54,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:04:54,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:04:54,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:04:54,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:04:54,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:04:54,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:04:54,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:04:54,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:04:54,235 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:04:54,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:04:54,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:04:54,236 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:04:54,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:04:54,236 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:04:54,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:04:54,237 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 14:04:54,246 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:04:54,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:04:54,247 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:04:54,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:04:54,247 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:04:54,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:04:54,247 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:04:54,248 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:04:54,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:04:54,248 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:04:54,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:04:54,248 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:04:54,248 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:04:54,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:04:54,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:04:54,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:04:54,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:04:54,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:04:54,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:04:54,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:04:54,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:04:54,250 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 14:04:54,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 14:04:54,250 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 14:04:54,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:04:54,289 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:04:54,295 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:04:54,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:04:54,296 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:04:54,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 14:04:54,450 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:04:54,451 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:04:54,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:04:54,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:04:54,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:04:54,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:04:54" (1/1) ... [2018-02-04 14:04:54,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8b5bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54, skipping insertion in model container [2018-02-04 14:04:54,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:04:54" (1/1) ... [2018-02-04 14:04:54,468 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:04:54,501 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:04:54,591 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:04:54,602 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:04:54,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54 WrapperNode [2018-02-04 14:04:54,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:04:54,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:04:54,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:04:54,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:04:54,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54" (1/1) ... [2018-02-04 14:04:54,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54" (1/1) ... [2018-02-04 14:04:54,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54" (1/1) ... [2018-02-04 14:04:54,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54" (1/1) ... [2018-02-04 14:04:54,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54" (1/1) ... [2018-02-04 14:04:54,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54" (1/1) ... [2018-02-04 14:04:54,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54" (1/1) ... [2018-02-04 14:04:54,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:04:54,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:04:54,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:04:54,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:04:54,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54" (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 14:04:54,666 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:04:54,666 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:04:54,666 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 14:04:54,666 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 14:04:54,667 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:04:54,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:04:54,668 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:04:54,821 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:04:54,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:04:54 BoogieIcfgContainer [2018-02-04 14:04:54,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:04:54,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:04:54,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:04:54,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:04:54,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:04:54" (1/3) ... [2018-02-04 14:04:54,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2c93db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:04:54, skipping insertion in model container [2018-02-04 14:04:54,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:54" (2/3) ... [2018-02-04 14:04:54,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2c93db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:04:54, skipping insertion in model container [2018-02-04 14:04:54,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:04:54" (3/3) ... [2018-02-04 14:04:54,825 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 14:04:54,830 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:04:54,834 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 14:04:54,860 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:04:54,860 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:04:54,860 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 14:04:54,861 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 14:04:54,861 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:04:54,861 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:04:54,861 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:04:54,861 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:04:54,862 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:04:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 14:04:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 14:04:54,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:54,884 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 14:04:54,884 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 14:04:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-02-04 14:04:54,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:54,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:54,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:54,932 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:54,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:54,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:55,019 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 14:04:55,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:04:55,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:04:55,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:04:55,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:04:55,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:04:55,037 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 14:04:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:55,166 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 14:04:55,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:04:55,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 14:04:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:55,175 INFO L225 Difference]: With dead ends: 74 [2018-02-04 14:04:55,175 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 14:04:55,176 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 14:04:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 14:04:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-02-04 14:04:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 14:04:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-02-04 14:04:55,206 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-02-04 14:04:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:55,206 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-02-04 14:04:55,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:04:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-02-04 14:04:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:04:55,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:55,207 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 14:04:55,207 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 14:04:55,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-02-04 14:04:55,208 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:55,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:55,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,209 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:55,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:55,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:55,271 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 14:04:55,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:04:55,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:04:55,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:04:55,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:04:55,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:04:55,274 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-02-04 14:04:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:55,333 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-02-04 14:04:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:04:55,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 14:04:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:55,335 INFO L225 Difference]: With dead ends: 71 [2018-02-04 14:04:55,335 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 14:04:55,335 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 14:04:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 14:04:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-02-04 14:04:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 14:04:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 14:04:55,340 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-02-04 14:04:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:55,341 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 14:04:55,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:04:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 14:04:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:04:55,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:55,342 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] [2018-02-04 14:04:55,342 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 14:04:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-02-04 14:04:55,342 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:55,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:55,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:55,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:55,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:55,400 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 14:04:55,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:04:55,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:04:55,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:04:55,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:04:55,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:04:55,401 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-04 14:04:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:55,442 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-04 14:04:55,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:04:55,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 14:04:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:55,443 INFO L225 Difference]: With dead ends: 69 [2018-02-04 14:04:55,443 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 14:04:55,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 14:04:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 14:04:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-02-04 14:04:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 14:04:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-02-04 14:04:55,448 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-02-04 14:04:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:55,449 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-02-04 14:04:55,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:04:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-02-04 14:04:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:04:55,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:55,449 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] [2018-02-04 14:04:55,449 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 14:04:55,449 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-02-04 14:04:55,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:55,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:55,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:55,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:55,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:55,482 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 14:04:55,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:04:55,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:04:55,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:04:55,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:04:55,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:04:55,484 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-02-04 14:04:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:55,528 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-04 14:04:55,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:04:55,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 14:04:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:55,530 INFO L225 Difference]: With dead ends: 70 [2018-02-04 14:04:55,530 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 14:04:55,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 14:04:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 14:04:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-04 14:04:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 14:04:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-02-04 14:04:55,535 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-02-04 14:04:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:55,535 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-02-04 14:04:55,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:04:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-02-04 14:04:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:04:55,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:55,536 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] [2018-02-04 14:04:55,536 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 14:04:55,536 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-02-04 14:04:55,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:55,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:55,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:55,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:55,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:55,577 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 14:04:55,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:04:55,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:04:55,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:04:55,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:04:55,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:04:55,578 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-02-04 14:04:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:55,590 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-04 14:04:55,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:04:55,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 14:04:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:55,591 INFO L225 Difference]: With dead ends: 47 [2018-02-04 14:04:55,591 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 14:04:55,591 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 14:04:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 14:04:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 14:04:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 14:04:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-04 14:04:55,593 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-02-04 14:04:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:55,595 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-04 14:04:55,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:04:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-04 14:04:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 14:04:55,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:55,595 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:04:55,595 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 14:04:55,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-02-04 14:04:55,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:55,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:55,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:55,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:55,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:55,635 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 14:04:55,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:04:55,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:04:55,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:04:55,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:04:55,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:04:55,636 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-04 14:04:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:55,662 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-04 14:04:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:04:55,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 14:04:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:55,663 INFO L225 Difference]: With dead ends: 44 [2018-02-04 14:04:55,663 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 14:04:55,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 14:04:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 14:04:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 14:04:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 14:04:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-04 14:04:55,666 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-02-04 14:04:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:55,667 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-04 14:04:55,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:04:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-04 14:04:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 14:04:55,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:55,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, 1, 1, 1] [2018-02-04 14:04:55,668 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 14:04:55,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-02-04 14:04:55,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:55,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:55,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,669 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:55,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:55,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:55,719 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 14:04:55,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:04:55,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:04:55,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:04:55,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:04:55,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:04:55,720 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-04 14:04:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:55,820 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 14:04:55,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:04:55,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 14:04:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:55,820 INFO L225 Difference]: With dead ends: 50 [2018-02-04 14:04:55,820 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 14:04:55,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 14:04:55,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 14:04:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-04 14:04:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 14:04:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 14:04:55,823 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-04 14:04:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:55,823 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 14:04:55,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:04:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 14:04:55,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 14:04:55,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:55,824 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:04:55,824 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 14:04:55,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-02-04 14:04:55,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:55,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:55,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,825 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:55,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:55,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:55,850 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 14:04:55,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:04:55,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:04:55,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:04:55,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:04:55,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:04:55,851 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-02-04 14:04:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:55,866 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-02-04 14:04:55,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:04:55,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 14:04:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:55,868 INFO L225 Difference]: With dead ends: 73 [2018-02-04 14:04:55,868 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 14:04:55,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 14:04:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 14:04:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-02-04 14:04:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 14:04:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 14:04:55,879 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-02-04 14:04:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:55,879 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 14:04:55,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:04:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 14:04:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 14:04:55,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:55,880 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 14:04:55,880 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 14:04:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-02-04 14:04:55,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:55,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:55,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,882 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:55,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:55,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:55,932 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 14:04:55,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:04:55,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:04:55,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:04:55,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:04:55,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:04:55,934 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-04 14:04:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:55,947 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 14:04:55,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:04:55,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 14:04:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:55,949 INFO L225 Difference]: With dead ends: 67 [2018-02-04 14:04:55,949 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 14:04:55,949 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 14:04:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 14:04:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-02-04 14:04:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 14:04:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 14:04:55,953 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-02-04 14:04:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:55,953 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 14:04:55,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:04:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 14:04:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:04:55,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:55,954 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 14:04:55,954 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 14:04:55,954 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-02-04 14:04:55,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:55,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:55,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:55,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:55,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:56,075 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 14:04:56,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:04:56,076 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 14:04:56,084 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:56,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:04:56,135 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 14:04:56,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:56,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:04:56,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 14:04:56,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:04:56,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:04:56,179 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 14:04:56,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:56,193 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 14:04:56,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 14:04:56,214 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 14:04:56,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:04:56,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-04 14:04:56,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:04:56,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:04:56,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:04:56,233 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 11 states. [2018-02-04 14:04:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:04:56,396 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-02-04 14:04:56,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:04:56,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-04 14:04:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:04:56,398 INFO L225 Difference]: With dead ends: 72 [2018-02-04 14:04:56,398 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 14:04:56,398 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 14:04:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 14:04:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2018-02-04 14:04:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 14:04:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 14:04:56,403 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2018-02-04 14:04:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:04:56,403 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 14:04:56,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:04:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 14:04:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:04:56,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:04:56,404 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 14:04:56,404 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 14:04:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-02-04 14:04:56,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:04:56,405 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:04:56,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:56,406 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:56,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:04:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:56,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:04:56,662 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 14:04:56,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:04:56,662 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 14:04:56,667 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:04:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:04:56,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:04:56,698 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 14:04:56,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:56,713 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 14:04:56,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:56,718 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 14:04:56,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:56,735 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 14:04:56,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:56,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:04:56,748 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 14:04:56,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:04:56,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:04:56,958 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 14:04:56,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:56,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:04:56,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:04:57,000 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 14:04:57,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:57,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:04:57,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14:04:57,038 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:57,075 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 14:04:57,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:04:57,291 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 14:04:57,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 14:04:57,384 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 14:04:57,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:04:57,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-04 14:04:57,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 14:04:57,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 14:04:57,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-02-04 14:04:57,402 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 21 states. [2018-02-04 14:05:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:36,704 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-02-04 14:05:36,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 14:05:36,704 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-02-04 14:05:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:36,705 INFO L225 Difference]: With dead ends: 116 [2018-02-04 14:05:36,705 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 14:05:36,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=151, Invalid=901, Unknown=4, NotChecked=0, Total=1056 [2018-02-04 14:05:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 14:05:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 55. [2018-02-04 14:05:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 14:05:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-02-04 14:05:36,711 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 28 [2018-02-04 14:05:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:36,711 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-02-04 14:05:36,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 14:05:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-02-04 14:05:36,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 14:05:36,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:36,712 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 14:05:36,712 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 14:05:36,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1623272965, now seen corresponding path program 1 times [2018-02-04 14:05:36,713 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:36,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:36,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:36,714 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:36,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:36,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:36,737 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 14:05:36,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:05:36,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:05:36,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:05:36,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:05:36,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:05:36,739 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2018-02-04 14:05:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:36,760 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-02-04 14:05:36,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:05:36,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 14:05:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:36,762 INFO L225 Difference]: With dead ends: 64 [2018-02-04 14:05:36,762 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 14:05:36,762 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 14:05:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 14:05:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-04 14:05:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 14:05:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 14:05:36,766 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29 [2018-02-04 14:05:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:36,766 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 14:05:36,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:05:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 14:05:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 14:05:36,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:36,767 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 14:05:36,767 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 14:05:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1889590311, now seen corresponding path program 1 times [2018-02-04 14:05:36,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:36,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:36,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:36,769 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:36,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:36,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:36,879 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 14:05:36,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:36,879 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 14:05:36,886 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:36,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:37,000 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 14:05:37,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:05:37,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-02-04 14:05:37,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:05:37,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:05:37,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-02-04 14:05:37,031 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 13 states. [2018-02-04 14:05:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:37,273 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-02-04 14:05:37,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:05:37,273 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-04 14:05:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:37,274 INFO L225 Difference]: With dead ends: 67 [2018-02-04 14:05:37,274 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 14:05:37,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306 [2018-02-04 14:05:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 14:05:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 14:05:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 14:05:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-04 14:05:37,277 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 32 [2018-02-04 14:05:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:37,277 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-04 14:05:37,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:05:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-04 14:05:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 14:05:37,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:37,278 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 14:05:37,278 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 14:05:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1399829189, now seen corresponding path program 1 times [2018-02-04 14:05:37,278 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:37,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:37,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:37,279 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:37,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:37,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:37,308 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 14:05:37,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:05:37,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:05:37,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:05:37,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:05:37,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:05:37,309 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-02-04 14:05:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:37,333 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-02-04 14:05:37,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:05:37,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 14:05:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:37,334 INFO L225 Difference]: With dead ends: 74 [2018-02-04 14:05:37,334 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 14:05:37,335 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 14:05:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 14:05:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2018-02-04 14:05:37,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 14:05:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-04 14:05:37,337 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2018-02-04 14:05:37,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:37,337 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-04 14:05:37,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:05:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-04 14:05:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 14:05:37,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:37,338 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, 1] [2018-02-04 14:05:37,338 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 14:05:37,338 INFO L82 PathProgramCache]: Analyzing trace with hash -172063678, now seen corresponding path program 1 times [2018-02-04 14:05:37,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:37,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:37,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:37,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:37,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:37,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:37,368 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 14:05:37,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:37,369 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 14:05:37,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:37,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:37,433 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 14:05:37,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:05:37,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-04 14:05:37,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:05:37,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:05:37,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:05:37,451 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 7 states. [2018-02-04 14:05:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:37,482 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-04 14:05:37,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:05:37,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-02-04 14:05:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:37,483 INFO L225 Difference]: With dead ends: 85 [2018-02-04 14:05:37,483 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 14:05:37,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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 14:05:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 14:05:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2018-02-04 14:05:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 14:05:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-04 14:05:37,486 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 35 [2018-02-04 14:05:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:37,486 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-04 14:05:37,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:05:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-04 14:05:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 14:05:37,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:37,488 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 14:05:37,488 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 14:05:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1801461727, now seen corresponding path program 1 times [2018-02-04 14:05:37,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:37,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:37,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:37,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:37,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:37,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:37,795 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 14:05:37,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:37,796 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 14:05:37,800 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:37,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:37,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 14:05:37,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:37,852 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 14:05:37,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:37,864 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 14:05:37,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:37,868 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 14:05:37,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:37,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:05:37,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 14:05:38,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:38,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:38,143 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 14:05:38,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:38,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:38,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:38,163 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 14:05:38,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:38,173 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 14:05:38,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-02-04 14:05:38,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:38,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:38,357 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 14:05:38,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:38,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:38,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:38,371 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 14:05:38,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:38,398 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 14:05:38,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-02-04 14:05:38,450 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 14:05:38,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:05:38,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-02-04 14:05:38,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 14:05:38,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 14:05:38,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=617, Unknown=1, NotChecked=0, Total=702 [2018-02-04 14:05:38,471 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 27 states. [2018-02-04 14:05:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:39,187 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-02-04 14:05:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 14:05:39,188 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2018-02-04 14:05:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:39,188 INFO L225 Difference]: With dead ends: 99 [2018-02-04 14:05:39,188 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 14:05:39,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=1230, Unknown=4, NotChecked=0, Total=1406 [2018-02-04 14:05:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 14:05:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2018-02-04 14:05:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 14:05:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-04 14:05:39,192 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 41 [2018-02-04 14:05:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:39,192 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-04 14:05:39,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 14:05:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-04 14:05:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 14:05:39,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:39,193 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 14:05:39,194 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 14:05:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash -867371792, now seen corresponding path program 1 times [2018-02-04 14:05:39,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:39,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:39,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:39,195 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:39,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:39,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:39,260 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 14:05:39,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:05:39,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:05:39,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:05:39,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:05:39,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:05:39,261 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states. [2018-02-04 14:05:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:39,336 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-04 14:05:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:05:39,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-04 14:05:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:39,337 INFO L225 Difference]: With dead ends: 64 [2018-02-04 14:05:39,337 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 14:05:39,337 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 14:05:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 14:05:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-02-04 14:05:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 14:05:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-02-04 14:05:39,340 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 42 [2018-02-04 14:05:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:39,340 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-02-04 14:05:39,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:05:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-02-04 14:05:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 14:05:39,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:39,341 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 14:05:39,341 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 14:05:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721778, now seen corresponding path program 1 times [2018-02-04 14:05:39,342 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:39,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:39,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:39,343 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:39,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:39,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:39,533 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 14:05:39,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:39,533 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 14:05:39,540 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:39,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:39,589 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 14:05:39,590 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 14:05:39,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:39,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:39,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:39,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 14:05:39,681 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 14:05:39,684 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:05:39,684 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 14:05:39,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:39,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:39,691 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 14:05:39,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-02-04 14:05:39,693 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 14:05:39,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:05:39,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-02-04 14:05:39,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 14:05:39,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 14:05:39,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:05:39,712 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 21 states. [2018-02-04 14:05:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:39,914 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-02-04 14:05:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 14:05:39,914 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-02-04 14:05:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:39,915 INFO L225 Difference]: With dead ends: 92 [2018-02-04 14:05:39,915 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 14:05:39,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2018-02-04 14:05:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 14:05:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-02-04 14:05:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 14:05:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-02-04 14:05:39,918 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 43 [2018-02-04 14:05:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:39,918 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-02-04 14:05:39,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 14:05:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-02-04 14:05:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 14:05:39,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:39,919 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 14:05:39,919 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 14:05:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721777, now seen corresponding path program 1 times [2018-02-04 14:05:39,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:39,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:39,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:39,920 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:39,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:39,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:40,127 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 14:05:40,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:40,127 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 14:05:40,132 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:40,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:40,157 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 14:05:40,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:40,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:40,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 14:05:40,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14:05:40,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 14:05:40,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:40,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:40,187 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 14:05:40,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 14:05:40,235 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 14:05:40,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:40,238 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 14:05:40,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-02-04 14:05:40,299 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 14:05:40,302 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:05:40,302 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 14:05:40,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:40,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:40,308 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 14:05:40,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-02-04 14:05:40,330 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 14:05:40,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:05:40,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2018-02-04 14:05:40,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 14:05:40,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 14:05:40,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-04 14:05:40,348 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 23 states. [2018-02-04 14:05:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:40,606 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-02-04 14:05:40,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 14:05:40,606 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-02-04 14:05:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:40,607 INFO L225 Difference]: With dead ends: 84 [2018-02-04 14:05:40,607 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 14:05:40,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-02-04 14:05:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 14:05:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 14:05:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 14:05:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-02-04 14:05:40,609 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 43 [2018-02-04 14:05:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:40,609 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-02-04 14:05:40,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 14:05:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-02-04 14:05:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 14:05:40,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:40,610 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 14:05:40,610 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 14:05:40,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1351278396, now seen corresponding path program 1 times [2018-02-04 14:05:40,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:40,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:40,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:40,611 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:40,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:40,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:40,642 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 14:05:40,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:40,643 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 14:05:40,652 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:40,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:40,677 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 14:05:40,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:05:40,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-02-04 14:05:40,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:05:40,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:05:40,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:05:40,703 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 6 states. [2018-02-04 14:05:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:40,734 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-04 14:05:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:05:40,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-04 14:05:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:40,735 INFO L225 Difference]: With dead ends: 82 [2018-02-04 14:05:40,735 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 14:05:40,735 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 14:05:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 14:05:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 14:05:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 14:05:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 14:05:40,737 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 45 [2018-02-04 14:05:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:40,737 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 14:05:40,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:05:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 14:05:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 14:05:40,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:40,738 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 14:05:40,738 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 14:05:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811508, now seen corresponding path program 1 times [2018-02-04 14:05:40,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:40,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:40,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:40,739 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:40,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:40,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:41,001 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 14:05:41,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:41,001 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 14:05:41,006 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:41,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:41,024 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 14:05:41,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 14:05:41,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:41,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:41,092 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 14:05:41,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-04 14:05:41,120 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 14:05:41,121 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 14:05:41,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,126 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 14:05:41,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-02-04 14:05:41,175 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 14:05:41,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,178 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 14:05:41,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:31 [2018-02-04 14:05:41,284 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 14:05:41,285 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:05:41,285 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 14:05:41,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,295 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 14:05:41,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 14:05:41,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:05:41,312 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 14:05:41,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:41,315 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 14:05:41,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 14:05:41,338 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 14:05:41,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:05:41,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-02-04 14:05:41,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 14:05:41,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 14:05:41,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 14:05:41,356 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 34 states. [2018-02-04 14:05:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:46,042 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-02-04 14:05:46,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 14:05:46,043 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-02-04 14:05:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:46,043 INFO L225 Difference]: With dead ends: 119 [2018-02-04 14:05:46,043 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 14:05:46,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=572, Invalid=3588, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 14:05:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 14:05:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2018-02-04 14:05:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 14:05:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-02-04 14:05:46,048 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 48 [2018-02-04 14:05:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:46,048 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-02-04 14:05:46,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 14:05:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-02-04 14:05:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 14:05:46,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:46,049 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 14:05:46,049 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 14:05:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811558, now seen corresponding path program 1 times [2018-02-04 14:05:46,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:46,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:46,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:46,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:46,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:46,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:46,077 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 14:05:46,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:46,077 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 14:05:46,089 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:46,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:46,117 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 14:05:46,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:05:46,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 14:05:46,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:05:46,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:05:46,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:05:46,135 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 7 states. [2018-02-04 14:05:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:46,157 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-02-04 14:05:46,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:05:46,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-04 14:05:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:46,158 INFO L225 Difference]: With dead ends: 90 [2018-02-04 14:05:46,158 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 14:05:46,158 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 14:05:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 14:05:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2018-02-04 14:05:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 14:05:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-02-04 14:05:46,160 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 48 [2018-02-04 14:05:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:46,160 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-02-04 14:05:46,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:05:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-02-04 14:05:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 14:05:46,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:46,161 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, 1, 1] [2018-02-04 14:05:46,161 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 14:05:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1145466009, now seen corresponding path program 1 times [2018-02-04 14:05:46,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:46,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:46,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:46,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:46,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:46,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:46,198 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 14:05:46,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:46,198 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 14:05:46,208 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:46,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:46,257 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 14:05:46,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:05:46,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 14:05:46,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:05:46,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:05:46,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:05:46,274 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 9 states. [2018-02-04 14:05:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:05:46,300 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-02-04 14:05:46,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:05:46,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-02-04 14:05:46,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:05:46,300 INFO L225 Difference]: With dead ends: 124 [2018-02-04 14:05:46,301 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 14:05:46,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 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 14:05:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 14:05:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-02-04 14:05:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 14:05:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-04 14:05:46,303 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 49 [2018-02-04 14:05:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:05:46,304 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-04 14:05:46,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:05:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-04 14:05:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 14:05:46,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:05:46,304 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 14:05:46,304 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 14:05:46,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1267150670, now seen corresponding path program 1 times [2018-02-04 14:05:46,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:05:46,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:05:46,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:46,305 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:46,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:05:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:46,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:05:46,996 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 14:05:46,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:05:46,997 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 14:05:47,001 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:05:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:05:47,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:05:47,235 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 14:05:47,237 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 14:05:47,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:47,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:47,257 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 14:05:47,258 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 14:05:47,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:47,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:05:47,288 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 14:05:47,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-02-04 14:05:47,406 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 14:05:47,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:47,419 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 14:05:47,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:05:47,438 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 14:05:47,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-02-04 14:05:48,645 WARN L146 SmtUtils]: Spent 1176ms on a formula simplification. DAG size of input: 41 DAG size of output 23 [2018-02-04 14:05:56,761 WARN L146 SmtUtils]: Spent 4037ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-02-04 14:05:58,842 WARN L143 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 66 [2018-02-04 14:06:00,934 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 14:06:00,946 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 14:06:00,950 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 14:06:00,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:06:00,991 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:06:00,992 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 14:06:00,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:06:01,028 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:06:01,032 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 14:06:01,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 14:06:01,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:06:01,086 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 14:06:01,088 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:06:01,088 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:06:01,088 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 14:06:01,088 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:06:01,098 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:06:01,123 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 14:06:01,123 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:182, output treesize:63 [2018-02-04 14:06:03,297 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 14:06:03,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:06:03,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-02-04 14:06:03,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 14:06:03,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 14:06:03,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1213, Unknown=23, NotChecked=0, Total=1332 [2018-02-04 14:06:03,316 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 37 states. [2018-02-04 14:06:24,193 WARN L146 SmtUtils]: Spent 6061ms on a formula simplification. DAG size of input: 148 DAG size of output 52 [2018-02-04 14:06:32,556 WARN L146 SmtUtils]: Spent 6086ms on a formula simplification. DAG size of input: 170 DAG size of output 57 [2018-02-04 14:06:44,979 WARN L146 SmtUtils]: Spent 10165ms on a formula simplification. DAG size of input: 179 DAG size of output 45 [2018-02-04 14:06:45,304 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 138 DAG size of output 87 [2018-02-04 14:06:45,586 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 128 DAG size of output 76 [2018-02-04 14:06:47,805 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 102 DAG size of output 61 [2018-02-04 14:06:48,128 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 118 DAG size of output 75 [2018-02-04 14:06:52,416 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 105 DAG size of output 79 [2018-02-04 14:06:56,982 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 87 DAG size of output 74 [2018-02-04 14:07:02,423 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 107 DAG size of output 90 [2018-02-04 14:07:02,744 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 109 DAG size of output 92 [2018-02-04 14:07:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:07:02,771 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-04 14:07:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 14:07:02,771 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2018-02-04 14:07:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:07:02,772 INFO L225 Difference]: With dead ends: 111 [2018-02-04 14:07:02,772 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 14:07:02,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 56.3s TimeCoverageRelationStatistics Valid=447, Invalid=3669, Unknown=44, NotChecked=0, Total=4160 [2018-02-04 14:07:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 14:07:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2018-02-04 14:07:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 14:07:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-04 14:07:02,775 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 51 [2018-02-04 14:07:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:07:02,775 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-04 14:07:02,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 14:07:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-04 14:07:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 14:07:02,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:07:02,776 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 14:07:02,776 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 14:07:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 498105172, now seen corresponding path program 2 times [2018-02-04 14:07:02,776 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:07:02,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:07:02,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:07:02,777 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:07:02,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:07:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:07:02,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:07:03,075 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 14:07:03,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:07:03,075 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 14:07:03,080 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 14:07:03,106 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 14:07:03,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 14:07:03,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:07:03,123 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 14:07:03,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:03,135 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 14:07:03,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:03,147 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 14:07:03,147 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:03,152 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 14:07:03,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:03,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:07:03,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 14:07:03,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:03,394 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 52 treesize of output 55 [2018-02-04 14:07:03,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:03,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:03,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:03,458 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 14:07:03,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:03,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:03,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:03,515 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 47 treesize of output 60 [2018-02-04 14:07:03,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:03,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:03,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:03,733 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 14:07:03,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:03,766 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 14:07:03,766 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 14:07:04,268 WARN L143 SmtUtils]: Spent 338ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 14:07:04,514 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 57 DAG size of output 54 [2018-02-04 14:07:04,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:04,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:04,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:04,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:04,684 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 14:07:04,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 14:07:04,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:04,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:04,861 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 14:07:04,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:05,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,009 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 14:07:05,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:05,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,012 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 14:07:05,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:05,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,139 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 14:07:05,140 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:05,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,286 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 14:07:05,286 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 14:07:05,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:05,527 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 14:07:05,528 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 14:07:05,773 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 14:07:05,773 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 14:07:06,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:06,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:06,118 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 14:07:06,118 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:06,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:06,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:06,121 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 14:07:06,121 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:06,349 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 14:07:06,349 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-02-04 14:07:06,809 WARN L146 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-02-04 14:07:07,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,062 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 61 treesize of output 55 [2018-02-04 14:07:07,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:07,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,193 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 55 treesize of output 82 [2018-02-04 14:07:07,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 14:07:07,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,395 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 14:07:07,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 14:07:07,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,647 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 14:07:07,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:07,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,651 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 14:07:07,651 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:07,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:07,899 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 14:07:07,900 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 14:07:08,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,208 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 14:07:08,208 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 14:07:08,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,484 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 14:07:08,485 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:08,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 14:07:08,488 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:08,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,804 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 14:07:08,805 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:08,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:07:08,808 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 14:07:08,808 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:09,513 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 14:07:09,514 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-02-04 14:07:09,834 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-02-04 14:07:09,849 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 14:07:09,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:07:09,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-04 14:07:09,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 14:07:09,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 14:07:09,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=728, Unknown=2, NotChecked=0, Total=812 [2018-02-04 14:07:09,871 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 29 states. [2018-02-04 14:07:22,632 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 52 DAG size of output 51 [2018-02-04 14:07:24,821 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 14:07:24,993 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 14:07:25,196 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-02-04 14:07:25,427 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-02-04 14:07:25,668 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 57 DAG size of output 55 [2018-02-04 14:07:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:07:26,358 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-02-04 14:07:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 14:07:26,359 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-02-04 14:07:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:07:26,359 INFO L225 Difference]: With dead ends: 141 [2018-02-04 14:07:26,359 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 14:07:26,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=270, Invalid=1980, Unknown=6, NotChecked=0, Total=2256 [2018-02-04 14:07:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 14:07:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 81. [2018-02-04 14:07:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 14:07:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 14:07:26,363 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 54 [2018-02-04 14:07:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:07:26,363 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 14:07:26,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 14:07:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 14:07:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 14:07:26,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:07:26,364 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 14:07:26,364 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 14:07:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash 486079299, now seen corresponding path program 2 times [2018-02-04 14:07:26,364 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:07:26,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:07:26,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:07:26,365 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 14:07:26,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:07:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:07:26,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:07:26,584 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 14:07:26,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:07:26,584 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 14:07:26,593 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 14:07:26,617 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 14:07:26,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 14:07:26,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:07:26,689 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 14:07:26,690 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 14:07:26,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:26,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:07:26,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:07:26,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 14:07:32,856 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 14:07:32,858 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 14:07:32,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:07:32,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:07:32,860 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 14:07:32,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 14:07:32,862 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 14:07:32,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:07:32,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-02-04 14:07:32,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 14:07:32,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 14:07:32,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=405, Unknown=3, NotChecked=0, Total=462 [2018-02-04 14:07:32,881 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 22 states. Received shutdown request... [2018-02-04 14:08:33,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 14:08:33,715 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 14:08:33,718 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 14:08:33,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:08:33 BoogieIcfgContainer [2018-02-04 14:08:33,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:08:33,719 INFO L168 Benchmark]: Toolchain (without parser) took 219268.29 ms. Allocated memory was 399.5 MB in the beginning and 716.7 MB in the end (delta: 317.2 MB). Free memory was 353.6 MB in the beginning and 650.0 MB in the end (delta: -296.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-04 14:08:33,720 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 399.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:08:33,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.32 ms. Allocated memory is still 399.5 MB. Free memory was 353.6 MB in the beginning and 340.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:08:33,720 INFO L168 Benchmark]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 399.5 MB. Free memory was 340.3 MB in the beginning and 339.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:08:33,720 INFO L168 Benchmark]: RCFGBuilder took 187.84 ms. Allocated memory is still 399.5 MB. Free memory was 339.0 MB in the beginning and 320.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-02-04 14:08:33,720 INFO L168 Benchmark]: TraceAbstraction took 218897.11 ms. Allocated memory was 399.5 MB in the beginning and 716.7 MB in the end (delta: 317.2 MB). Free memory was 319.2 MB in the beginning and 650.0 MB in the end (delta: -330.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:08:33,721 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.14 ms. Allocated memory is still 399.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.32 ms. Allocated memory is still 399.5 MB. Free memory was 353.6 MB in the beginning and 340.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.86 ms. Allocated memory is still 399.5 MB. Free memory was 340.3 MB in the beginning and 339.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 187.84 ms. Allocated memory is still 399.5 MB. Free memory was 339.0 MB in the beginning and 320.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 218897.11 ms. Allocated memory was 399.5 MB in the beginning and 716.7 MB in the end (delta: 317.2 MB). Free memory was 319.2 MB in the beginning and 650.0 MB in the end (delta: -330.8 MB). There was no memory consumed. 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 constructing difference of abstraction (81states) and interpolant automaton (currently 31 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 31 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 31 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 31 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 31 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 31 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 31 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 31 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 31 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (103 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 218.8s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 183.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1043 SDtfs, 2064 SDslu, 5433 SDs, 0 SdLazy, 5871 SolverSat, 491 SolverUnsat, 105 SolverUnknown, 0 SolverNotchecked, 114.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1007 GetRequests, 550 SyntacticMatches, 21 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3631 ImplicationChecksByTransitivity, 95.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=23, 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, 25 MinimizatonAttempts, 428 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 1495 NumberOfCodeBlocks, 1495 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1455 ConstructedInterpolants, 137 QuantifiedInterpolants, 681331 SizeOfPredicates, 74 NumberOfNonLiveVariables, 2175 ConjunctsInSsa, 318 ConjunctsInUnsatCore, 40 InterpolantComputations, 13 PerfectInterpolantSequences, 360/633 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-08-33-725.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-08-33-725.csv Completed graceful shutdown