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_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:54:20,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:54:20,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:54:20,508 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:54:20,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:54:20,509 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:54:20,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:54:20,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:54:20,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:54:20,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:54:20,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:54:20,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:54:20,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:54:20,516 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:54:20,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:54:20,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:54:20,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:54:20,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:54:20,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:54:20,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:54:20,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:54:20,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:54:20,525 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:54:20,526 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:54:20,527 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:54:20,528 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:54:20,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:54:20,528 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:54:20,529 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:54:20,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:54:20,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:54:20,529 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:54:20,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:54:20,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:54:20,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:54:20,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:54:20,541 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:54:20,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:54:20,541 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:54:20,541 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:54:20,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:54:20,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:54:20,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:54:20,542 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:54:20,542 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:54:20,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:54:20,542 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:54:20,542 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:54:20,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:54:20,543 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:54:20,543 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:54:20,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:54:20,543 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:54:20,543 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:54:20,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:54:20,544 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:54:20,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:54:20,581 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:54:20,585 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:54:20,586 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:54:20,587 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:54:20,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-02-04 13:54:20,737 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:54:20,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:54:20,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:54:20,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:54:20,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:54:20,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:54:20" (1/1) ... [2018-02-04 13:54:20,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582cacdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20, skipping insertion in model container [2018-02-04 13:54:20,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:54:20" (1/1) ... [2018-02-04 13:54:20,761 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:54:20,796 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:54:20,873 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:54:20,883 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:54:20,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20 WrapperNode [2018-02-04 13:54:20,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:54:20,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:54:20,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:54:20,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:54:20,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20" (1/1) ... [2018-02-04 13:54:20,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20" (1/1) ... [2018-02-04 13:54:20,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20" (1/1) ... [2018-02-04 13:54:20,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20" (1/1) ... [2018-02-04 13:54:20,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20" (1/1) ... [2018-02-04 13:54:20,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20" (1/1) ... [2018-02-04 13:54:20,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20" (1/1) ... [2018-02-04 13:54:20,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:54:20,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:54:20,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:54:20,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:54:20,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:54:20,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:54:20,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:54:20,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 13:54:20,947 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 13:54:20,947 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:54:20,948 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:54:21,047 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:54:21,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:54:21 BoogieIcfgContainer [2018-02-04 13:54:21,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:54:21,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:54:21,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:54:21,050 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:54:21,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:54:20" (1/3) ... [2018-02-04 13:54:21,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bd15a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:54:21, skipping insertion in model container [2018-02-04 13:54:21,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:54:20" (2/3) ... [2018-02-04 13:54:21,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bd15a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:54:21, skipping insertion in model container [2018-02-04 13:54:21,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:54:21" (3/3) ... [2018-02-04 13:54:21,052 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-02-04 13:54:21,057 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:54:21,062 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 13:54:21,089 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:54:21,089 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:54:21,089 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:54:21,090 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:54:21,090 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:54:21,090 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:54:21,090 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:54:21,090 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:54:21,090 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:54:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-04 13:54:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:54:21,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:21,106 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:21,106 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash -144006031, now seen corresponding path program 1 times [2018-02-04 13:54:21,110 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:21,110 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:21,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,144 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:21,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:21,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:21,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:21,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:54:21,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:54:21,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:54:21,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:54:21,249 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-02-04 13:54:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:21,360 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-02-04 13:54:21,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:54:21,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 13:54:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:21,367 INFO L225 Difference]: With dead ends: 46 [2018-02-04 13:54:21,367 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 13:54:21,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:54:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 13:54:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-04 13:54:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 13:54:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-02-04 13:54:21,392 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2018-02-04 13:54:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:21,392 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-02-04 13:54:21,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:54:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-02-04 13:54:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:54:21,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:21,393 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:21,393 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:21,393 INFO L82 PathProgramCache]: Analyzing trace with hash -716261389, now seen corresponding path program 1 times [2018-02-04 13:54:21,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:21,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:21,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,395 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:21,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:21,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:21,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:21,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:54:21,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:54:21,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:54:21,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:54:21,455 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 6 states. [2018-02-04 13:54:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:21,521 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-02-04 13:54:21,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:54:21,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 13:54:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:21,523 INFO L225 Difference]: With dead ends: 48 [2018-02-04 13:54:21,523 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 13:54:21,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 13:54:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-02-04 13:54:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 13:54:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-02-04 13:54:21,530 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-02-04 13:54:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:21,530 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-02-04 13:54:21,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:54:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-02-04 13:54:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 13:54:21,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:21,531 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:21,531 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:21,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1119113233, now seen corresponding path program 1 times [2018-02-04 13:54:21,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:21,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:21,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,533 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:21,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:21,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:21,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:21,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:54:21,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:54:21,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:54:21,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:54:21,588 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-02-04 13:54:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:21,617 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-02-04 13:54:21,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:54:21,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 13:54:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:21,618 INFO L225 Difference]: With dead ends: 52 [2018-02-04 13:54:21,618 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 13:54:21,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:54:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 13:54:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-02-04 13:54:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 13:54:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-02-04 13:54:21,623 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-02-04 13:54:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:21,624 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-02-04 13:54:21,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:54:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-02-04 13:54:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 13:54:21,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:21,625 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:21,625 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:21,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1380395530, now seen corresponding path program 1 times [2018-02-04 13:54:21,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:21,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:21,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,627 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:21,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:21,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:54:21,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:21,684 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:54:21,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:21,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:21,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:54:21,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-02-04 13:54:21,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:54:21,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:54:21,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:54:21,762 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2018-02-04 13:54:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:21,772 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 13:54:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:54:21,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 13:54:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:21,772 INFO L225 Difference]: With dead ends: 34 [2018-02-04 13:54:21,772 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 13:54:21,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:54:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 13:54:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 13:54:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 13:54:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-04 13:54:21,775 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-02-04 13:54:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:21,775 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-04 13:54:21,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:54:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-04 13:54:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 13:54:21,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:21,776 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] [2018-02-04 13:54:21,776 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:21,777 INFO L82 PathProgramCache]: Analyzing trace with hash 679154700, now seen corresponding path program 1 times [2018-02-04 13:54:21,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:21,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:21,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,778 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:21,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:21,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:21,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:21,838 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:54:21,846 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:21,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:21,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:54:21,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:21,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:21,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:54:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:21,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:21,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 13:54:21,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:54:21,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:54:21,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:21,920 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-02-04 13:54:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:21,978 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 13:54:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:54:21,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-04 13:54:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:21,978 INFO L225 Difference]: With dead ends: 35 [2018-02-04 13:54:21,978 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 13:54:21,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:54:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 13:54:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-02-04 13:54:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 13:54:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-02-04 13:54:21,981 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-02-04 13:54:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:21,981 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-02-04 13:54:21,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:54:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-02-04 13:54:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 13:54:21,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:21,981 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] [2018-02-04 13:54:21,981 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:21,981 INFO L82 PathProgramCache]: Analyzing trace with hash 679154701, now seen corresponding path program 1 times [2018-02-04 13:54:21,982 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:21,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:21,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,983 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:21,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:21,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:22,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:22,211 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:54:22,218 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:22,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 13:54:22,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:22,271 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 17 treesize of output 16 [2018-02-04 13:54:22,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:22,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:54:22,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 13:54:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:22,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:22,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-02-04 13:54:22,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:54:22,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:54:22,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:54:22,443 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 15 states. [2018-02-04 13:54:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:22,712 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-02-04 13:54:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:54:22,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-04 13:54:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:22,712 INFO L225 Difference]: With dead ends: 38 [2018-02-04 13:54:22,713 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 13:54:22,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:54:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 13:54:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 13:54:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 13:54:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-02-04 13:54:22,715 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 25 [2018-02-04 13:54:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:22,716 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-02-04 13:54:22,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:54:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-02-04 13:54:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 13:54:22,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:22,716 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] [2018-02-04 13:54:22,716 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043850, now seen corresponding path program 1 times [2018-02-04 13:54:22,717 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:22,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:22,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:22,718 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:22,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:22,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:22,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:22,798 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:54:22,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:22,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:22,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:54:22,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:22,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:54:22,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:54:22,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:22,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:22,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 13:54:22,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:22,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:54:22,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 13:54:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:22,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:22,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-04 13:54:22,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:54:22,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:54:22,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:54:22,869 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 11 states. [2018-02-04 13:54:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:22,962 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-02-04 13:54:22,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:54:22,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 13:54:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:22,963 INFO L225 Difference]: With dead ends: 47 [2018-02-04 13:54:22,963 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 13:54:22,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:54:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 13:54:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-02-04 13:54:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 13:54:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-04 13:54:22,965 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-04 13:54:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:22,966 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-04 13:54:22,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:54:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-04 13:54:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 13:54:22,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:22,966 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] [2018-02-04 13:54:22,966 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:22,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043851, now seen corresponding path program 1 times [2018-02-04 13:54:22,966 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:22,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:22,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:22,967 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:22,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:22,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:23,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:23,138 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:54:23,143 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:23,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:23,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 13:54:23,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:23,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 13:54:23,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:23,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 13:54:23,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:23,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 13:54:23,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:23,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:54:23,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 13:54:23,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:23,467 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 13:54:23,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:23,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:23,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:23,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-04 13:54:23,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:23,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:23,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:23,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-02-04 13:54:23,553 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:23,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:23,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-04 13:54:23,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:23,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 13:54:23,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 13:54:23,846 WARN L143 SmtUtils]: Spent 204ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 13:54:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:23,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:23,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-02-04 13:54:23,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:54:23,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:54:23,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=295, Unknown=1, NotChecked=0, Total=342 [2018-02-04 13:54:23,874 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 19 states. [2018-02-04 13:54:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:44,690 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-04 13:54:44,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 13:54:44,691 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2018-02-04 13:54:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:44,691 INFO L225 Difference]: With dead ends: 49 [2018-02-04 13:54:44,691 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 13:54:44,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=113, Invalid=639, Unknown=4, NotChecked=0, Total=756 [2018-02-04 13:54:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 13:54:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-02-04 13:54:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 13:54:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-04 13:54:44,694 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-04 13:54:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:44,694 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-04 13:54:44,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:54:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-04 13:54:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:54:44,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:44,695 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:44,695 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:44,695 INFO L82 PathProgramCache]: Analyzing trace with hash 622132427, now seen corresponding path program 1 times [2018-02-04 13:54:44,695 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:44,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:44,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:44,696 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:44,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:44,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:54:44,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:44,733 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:54:44,738 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:44,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:54:44,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:44,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-04 13:54:44,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:54:44,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:54:44,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:44,807 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-02-04 13:54:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:44,844 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-04 13:54:44,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:54:44,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 13:54:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:44,845 INFO L225 Difference]: With dead ends: 42 [2018-02-04 13:54:44,845 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 13:54:44,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:54:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 13:54:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-04 13:54:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 13:54:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-02-04 13:54:44,848 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-02-04 13:54:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:44,852 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-02-04 13:54:44,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:54:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-02-04 13:54:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:54:44,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:44,853 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:44,853 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1092971799, now seen corresponding path program 1 times [2018-02-04 13:54:44,854 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:44,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:44,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:44,855 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:44,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:44,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:54:45,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:45,045 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:54:45,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:45,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:45,084 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 17 treesize of output 16 [2018-02-04 13:54:45,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:45,094 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 20 treesize of output 19 [2018-02-04 13:54:45,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:45,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:54:45,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 13:54:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:54:45,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:45,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-02-04 13:54:45,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:54:45,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:54:45,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:54:45,210 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 19 states. [2018-02-04 13:54:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:45,485 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-02-04 13:54:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:54:45,485 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-02-04 13:54:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:45,486 INFO L225 Difference]: With dead ends: 58 [2018-02-04 13:54:45,486 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 13:54:45,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:54:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 13:54:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-02-04 13:54:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 13:54:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-04 13:54:45,491 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 35 [2018-02-04 13:54:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:45,491 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-04 13:54:45,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:54:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-04 13:54:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 13:54:45,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:45,492 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] [2018-02-04 13:54:45,492 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:54:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1217560473, now seen corresponding path program 2 times [2018-02-04 13:54:45,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:45,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:45,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:45,494 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:45,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:45,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:45,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:54:45,721 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:54:45,725 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:54:45,739 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:54:45,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:54:45,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:54:45,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 13:54:45,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:45,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 13:54:45,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:45,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 13:54:45,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:45,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 13:54:45,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:45,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:54:45,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 13:54:45,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:45,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:45,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-04 13:54:45,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:46,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:46,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-02-04 13:54:46,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:46,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:46,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-04 13:54:46,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:46,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:46,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:54:46,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-04 13:54:46,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:54:46,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 13:54:46,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 13:54:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:54:48,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:54:48,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2018-02-04 13:54:48,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 13:54:48,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 13:54:48,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=488, Unknown=6, NotChecked=0, Total=552 [2018-02-04 13:54:48,496 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 24 states. [2018-02-04 13:55:09,555 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 55 DAG size of output 51 [2018-02-04 13:55:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:55:12,210 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-02-04 13:55:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:55:12,211 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-02-04 13:55:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:55:12,211 INFO L225 Difference]: With dead ends: 63 [2018-02-04 13:55:12,212 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 13:55:12,212 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=193, Invalid=1280, Unknown=9, NotChecked=0, Total=1482 [2018-02-04 13:55:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 13:55:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2018-02-04 13:55:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 13:55:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-02-04 13:55:12,214 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2018-02-04 13:55:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:55:12,215 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-02-04 13:55:12,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 13:55:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-02-04 13:55:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 13:55:12,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:55:12,216 INFO L351 BasicCegarLoop]: trace histogram [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, 1] [2018-02-04 13:55:12,216 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:55:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash -13048153, now seen corresponding path program 2 times [2018-02-04 13:55:12,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:55:12,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:55:12,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:12,217 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:55:12,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:55:12,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:55:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 13:55:12,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:55:12,264 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:55:12,271 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:55:12,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:55:12,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:55:12,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:55:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 13:55:12,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:55:12,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 13:55:12,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:55:12,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:55:12,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:55:12,321 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-02-04 13:55:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:55:12,346 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-02-04 13:55:12,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:55:12,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 13:55:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:55:12,347 INFO L225 Difference]: With dead ends: 46 [2018-02-04 13:55:12,347 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 13:55:12,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:55:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 13:55:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-02-04 13:55:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 13:55:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-02-04 13:55:12,351 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 41 [2018-02-04 13:55:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:55:12,351 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-02-04 13:55:12,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:55:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-02-04 13:55:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 13:55:12,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:55:12,352 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:55:12,352 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:55:12,352 INFO L82 PathProgramCache]: Analyzing trace with hash -455660157, now seen corresponding path program 3 times [2018-02-04 13:55:12,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:55:12,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:55:12,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:12,353 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:55:12,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:55:12,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:55:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 13:55:12,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:55:12,391 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:55:12,396 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:55:12,420 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 13:55:12,420 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:55:12,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:55:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 13:55:12,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:55:12,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 13:55:12,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:55:12,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:55:12,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:55:12,478 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 11 states. [2018-02-04 13:55:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:55:12,511 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-04 13:55:12,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:55:12,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-02-04 13:55:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:55:12,512 INFO L225 Difference]: With dead ends: 52 [2018-02-04 13:55:12,512 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 13:55:12,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:55:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 13:55:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-02-04 13:55:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 13:55:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-02-04 13:55:12,516 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 51 [2018-02-04 13:55:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:55:12,516 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-02-04 13:55:12,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:55:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-02-04 13:55:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:55:12,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:55:12,517 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:55:12,517 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:55:12,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1516212575, now seen corresponding path program 4 times [2018-02-04 13:55:12,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:55:12,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:55:12,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:12,518 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:55:12,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:55:12,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:55:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-04 13:55:12,570 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:55:12,570 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:55:12,578 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:55:12,600 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:55:12,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:55:12,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:55:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-04 13:55:12,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:55:12,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 13:55:12,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:55:12,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:55:12,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:55:12,672 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 13 states. [2018-02-04 13:55:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:55:12,714 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-02-04 13:55:12,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:55:12,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-04 13:55:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:55:12,715 INFO L225 Difference]: With dead ends: 58 [2018-02-04 13:55:12,715 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 13:55:12,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:55:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 13:55:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-02-04 13:55:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 13:55:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 13:55:12,726 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2018-02-04 13:55:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:55:12,726 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 13:55:12,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:55:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 13:55:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 13:55:12,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:55:12,727 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:55:12,727 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:55:12,728 INFO L82 PathProgramCache]: Analyzing trace with hash -342764997, now seen corresponding path program 5 times [2018-02-04 13:55:12,728 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:55:12,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:55:12,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:12,729 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:55:12,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:55:12,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:55:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 13:55:12,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:55:12,806 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:55:12,814 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:55:12,847 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 13:55:12,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:55:12,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:55:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 13:55:12,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:55:12,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 13:55:12,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:55:12,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:55:12,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:55:12,912 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 15 states. [2018-02-04 13:55:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:55:12,981 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-02-04 13:55:12,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:55:12,981 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2018-02-04 13:55:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:55:12,982 INFO L225 Difference]: With dead ends: 64 [2018-02-04 13:55:12,982 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 13:55:12,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:55:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 13:55:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-04 13:55:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 13:55:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-02-04 13:55:12,986 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 71 [2018-02-04 13:55:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:55:12,986 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-02-04 13:55:12,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:55:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-02-04 13:55:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 13:55:12,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:55:12,988 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:55:12,988 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:55:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1199419415, now seen corresponding path program 6 times [2018-02-04 13:55:12,988 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:55:12,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:55:12,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:12,989 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:55:12,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:55:13,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:55:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-02-04 13:55:13,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:55:13,072 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:55:13,080 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:55:13,126 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 13:55:13,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:55:13,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:55:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-02-04 13:55:13,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:55:13,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-04 13:55:13,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:55:13,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:55:13,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:55:13,194 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 17 states. [2018-02-04 13:55:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:55:13,245 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-02-04 13:55:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:55:13,245 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-02-04 13:55:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:55:13,245 INFO L225 Difference]: With dead ends: 70 [2018-02-04 13:55:13,245 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 13:55:13,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:55:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 13:55:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-02-04 13:55:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 13:55:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-02-04 13:55:13,248 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 81 [2018-02-04 13:55:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:55:13,248 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-02-04 13:55:13,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:55:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-02-04 13:55:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 13:55:13,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:55:13,249 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:55:13,249 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:55:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1552083699, now seen corresponding path program 7 times [2018-02-04 13:55:13,249 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:55:13,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:55:13,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:13,250 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:55:13,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:55:13,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:55:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-04 13:55:13,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:55:13,354 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:55:13,359 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:55:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:55:13,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:55:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-04 13:55:13,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:55:13,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 13:55:13,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:55:13,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:55:13,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:55:13,492 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 19 states. [2018-02-04 13:55:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:55:13,565 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-02-04 13:55:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:55:13,565 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2018-02-04 13:55:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:55:13,566 INFO L225 Difference]: With dead ends: 76 [2018-02-04 13:55:13,566 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 13:55:13,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:55:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 13:55:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-02-04 13:55:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 13:55:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2018-02-04 13:55:13,568 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 91 [2018-02-04 13:55:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:55:13,568 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2018-02-04 13:55:13,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:55:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2018-02-04 13:55:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 13:55:13,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:55:13,569 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:55:13,569 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:55:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1951482575, now seen corresponding path program 8 times [2018-02-04 13:55:13,569 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:55:13,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:55:13,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:13,570 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:55:13,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:55:13,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:55:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-02-04 13:55:13,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:55:13,660 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:55:13,665 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:55:13,688 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:55:13,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:55:13,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:55:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-02-04 13:55:13,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:55:13,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 13:55:13,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:55:13,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:55:13,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:55:13,765 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 21 states. [2018-02-04 13:55:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:55:13,833 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-02-04 13:55:13,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:55:13,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 101 [2018-02-04 13:55:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:55:13,833 INFO L225 Difference]: With dead ends: 82 [2018-02-04 13:55:13,833 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 13:55:13,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:55:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 13:55:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-02-04 13:55:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 13:55:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2018-02-04 13:55:13,836 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 101 [2018-02-04 13:55:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:55:13,836 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2018-02-04 13:55:13,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:55:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2018-02-04 13:55:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 13:55:13,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:55:13,837 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:55:13,837 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:55:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1340635051, now seen corresponding path program 9 times [2018-02-04 13:55:13,837 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:55:13,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:55:13,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:13,838 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:55:13,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:55:13,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:55:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-04 13:55:13,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:55:13,948 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:55:13,962 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:55:14,038 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 13:55:14,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:55:14,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:55:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-04 13:55:14,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:55:14,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-04 13:55:14,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:55:14,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:55:14,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:55:14,130 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand 23 states. [2018-02-04 13:55:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:55:14,224 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-02-04 13:55:14,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:55:14,224 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 111 [2018-02-04 13:55:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:55:14,225 INFO L225 Difference]: With dead ends: 88 [2018-02-04 13:55:14,225 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 13:55:14,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2018-02-04 13:55:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 13:55:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-02-04 13:55:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 13:55:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-02-04 13:55:14,227 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 111 [2018-02-04 13:55:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:55:14,228 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-02-04 13:55:14,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:55:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-02-04 13:55:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 13:55:14,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:55:14,229 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:55:14,229 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:55:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1134053767, now seen corresponding path program 10 times [2018-02-04 13:55:14,229 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:55:14,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:55:14,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:14,230 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:55:14,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:55:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:55:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:55:14,275 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 13:55:14,294 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 13:55:14,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:55:14 BoogieIcfgContainer [2018-02-04 13:55:14,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:55:14,314 INFO L168 Benchmark]: Toolchain (without parser) took 53576.51 ms. Allocated memory was 406.8 MB in the beginning and 747.1 MB in the end (delta: 340.3 MB). Free memory was 363.7 MB in the beginning and 642.2 MB in the end (delta: -278.5 MB). Peak memory consumption was 61.8 MB. Max. memory is 5.3 GB. [2018-02-04 13:55:14,314 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 406.8 MB. Free memory is still 370.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:55:14,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.54 ms. Allocated memory is still 406.8 MB. Free memory was 363.7 MB in the beginning and 350.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 13:55:14,315 INFO L168 Benchmark]: Boogie Preprocessor took 24.58 ms. Allocated memory is still 406.8 MB. Free memory was 350.5 MB in the beginning and 349.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:55:14,315 INFO L168 Benchmark]: RCFGBuilder took 134.07 ms. Allocated memory is still 406.8 MB. Free memory was 349.1 MB in the beginning and 333.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:55:14,315 INFO L168 Benchmark]: TraceAbstraction took 53265.31 ms. Allocated memory was 406.8 MB in the beginning and 747.1 MB in the end (delta: 340.3 MB). Free memory was 333.8 MB in the beginning and 642.2 MB in the end (delta: -308.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 5.3 GB. [2018-02-04 13:55:14,316 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.15 ms. Allocated memory is still 406.8 MB. Free memory is still 370.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.54 ms. Allocated memory is still 406.8 MB. Free memory was 363.7 MB in the beginning and 350.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.58 ms. Allocated memory is still 406.8 MB. Free memory was 350.5 MB in the beginning and 349.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 134.07 ms. Allocated memory is still 406.8 MB. Free memory was 349.1 MB in the beginning and 333.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53265.31 ms. Allocated memory was 406.8 MB in the beginning and 747.1 MB in the end (delta: 340.3 MB). Free memory was 333.8 MB in the beginning and 642.2 MB in the end (delta: -308.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1452]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1453] CALL entry_point() [L1439] int len = 10; VAL [len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] RET return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] [L1440] EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_malloc(sizeof(struct A18*)*len)={42:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; VAL [array={42:0}, i=0, len=10] [L1443] COND FALSE !(!array) VAL [array={42:0}, i=0, len=10] [L1444] COND TRUE i