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-ccafca9-m [2018-02-04 00:38:26,134 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:38:26,135 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:38:26,147 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:38:26,147 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:38:26,148 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:38:26,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:38:26,150 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:38:26,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:38:26,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:38:26,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:38:26,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:38:26,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:38:26,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:38:26,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:38:26,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:38:26,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:38:26,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:38:26,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:38:26,162 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:38:26,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:38:26,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:38:26,164 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:38:26,165 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:38:26,166 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:38:26,167 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:38:26,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:38:26,167 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:38:26,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:38:26,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:38:26,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:38:26,168 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:38:26,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:38:26,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:38:26,178 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:38:26,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:38:26,178 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:38:26,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:38:26,178 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:38:26,178 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:38:26,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:38:26,178 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:38:26,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:38:26,179 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:38:26,179 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:38:26,179 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:38:26,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:38:26,179 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:38:26,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:38:26,179 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:38:26,179 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:38:26,179 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:38:26,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:38:26,180 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:38:26,180 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:38:26,180 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:38:26,180 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:38:26,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:38:26,213 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:38:26,215 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:38:26,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:38:26,216 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:38:26,217 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 00:38:26,343 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:38:26,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:38:26,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:38:26,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:38:26,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:38:26,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:38:26" (1/1) ... [2018-02-04 00:38:26,351 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 12:38:26, skipping insertion in model container [2018-02-04 00:38:26,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:38:26" (1/1) ... [2018-02-04 00:38:26,361 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:38:26,394 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:38:26,477 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:38:26,491 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:38:26,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26 WrapperNode [2018-02-04 00:38:26,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:38:26,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:38:26,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:38:26,497 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:38:26,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26" (1/1) ... [2018-02-04 00:38:26,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26" (1/1) ... [2018-02-04 00:38:26,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26" (1/1) ... [2018-02-04 00:38:26,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26" (1/1) ... [2018-02-04 00:38:26,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26" (1/1) ... [2018-02-04 00:38:26,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26" (1/1) ... [2018-02-04 00:38:26,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26" (1/1) ... [2018-02-04 00:38:26,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:38:26,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:38:26,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:38:26,523 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:38:26,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:38:26,557 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:38:26,557 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:38:26,557 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:38:26,557 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:38:26,558 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:38:26,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:38:26,654 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:38:26,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:38:26 BoogieIcfgContainer [2018-02-04 00:38:26,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:38:26,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:38:26,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:38:26,657 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:38:26,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:38:26" (1/3) ... [2018-02-04 00:38:26,658 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 12:38:26, skipping insertion in model container [2018-02-04 00:38:26,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:38:26" (2/3) ... [2018-02-04 00:38:26,658 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 12:38:26, skipping insertion in model container [2018-02-04 00:38:26,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:38:26" (3/3) ... [2018-02-04 00:38:26,659 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-02-04 00:38:26,664 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:38:26,669 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 00:38:26,699 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:38:26,699 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:38:26,699 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:38:26,699 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:38:26,700 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:38:26,700 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:38:26,700 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:38:26,700 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:38:26,701 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:38:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-04 00:38:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:38:26,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:26,721 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:38:26,721 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash -144006031, now seen corresponding path program 1 times [2018-02-04 00:38:26,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:26,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:26,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:26,772 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:26,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:26,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:38:26,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:38:26,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:38:26,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:38:26,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:38:26,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:38:26,878 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-02-04 00:38:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:26,998 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-02-04 00:38:26,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:38:26,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 00:38:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:27,005 INFO L225 Difference]: With dead ends: 46 [2018-02-04 00:38:27,005 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 00:38:27,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:38:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 00:38:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-04 00:38:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 00:38:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-02-04 00:38:27,033 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2018-02-04 00:38:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:27,034 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-02-04 00:38:27,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:38:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-02-04 00:38:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:38:27,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:27,035 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:38:27,036 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash -716261389, now seen corresponding path program 1 times [2018-02-04 00:38:27,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:27,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:27,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,038 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:27,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:27,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:38:27,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:38:27,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:38:27,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:38:27,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:38:27,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:38:27,112 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 6 states. [2018-02-04 00:38:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:27,154 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-02-04 00:38:27,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:38:27,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:38:27,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:27,155 INFO L225 Difference]: With dead ends: 48 [2018-02-04 00:38:27,155 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 00:38:27,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:38:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 00:38:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-02-04 00:38:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 00:38:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-02-04 00:38:27,160 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-02-04 00:38:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:27,160 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-02-04 00:38:27,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:38:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-02-04 00:38:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 00:38:27,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:27,161 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:38:27,161 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1119113233, now seen corresponding path program 1 times [2018-02-04 00:38:27,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:27,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:27,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:27,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:27,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:38:27,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:38:27,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:38:27,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:38:27,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:38:27,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:38:27,207 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-02-04 00:38:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:27,241 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-02-04 00:38:27,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:38:27,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 00:38:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:27,242 INFO L225 Difference]: With dead ends: 52 [2018-02-04 00:38:27,242 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 00:38:27,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:38:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 00:38:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-02-04 00:38:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 00:38:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-02-04 00:38:27,246 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-02-04 00:38:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:27,246 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-02-04 00:38:27,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:38:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-02-04 00:38:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:38:27,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:27,247 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 00:38:27,247 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:27,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1380395530, now seen corresponding path program 1 times [2018-02-04 00:38:27,247 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:27,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:27,248 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,249 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:27,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:27,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:38:27,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:27,306 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:38:27,312 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:27,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:38:27,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:38:27,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-02-04 00:38:27,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:38:27,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:38:27,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:38:27,372 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2018-02-04 00:38:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:27,382 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 00:38:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:38:27,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 00:38:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:27,385 INFO L225 Difference]: With dead ends: 34 [2018-02-04 00:38:27,385 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 00:38:27,386 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 00:38:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 00:38:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 00:38:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 00:38:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-04 00:38:27,389 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-02-04 00:38:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:27,389 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-04 00:38:27,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:38:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-04 00:38:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 00:38:27,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:27,390 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 00:38:27,390 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash 679154700, now seen corresponding path program 1 times [2018-02-04 00:38:27,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:27,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:27,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:27,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:27,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:27,455 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 00:38:27,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:27,455 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:38:27,462 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:27,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:27,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:38:27,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:27,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:27,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:38:27,517 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 00:38:27,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:27,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 00:38:27,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:38:27,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:38:27,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:38:27,542 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-02-04 00:38:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:27,588 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 00:38:27,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:38:27,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-04 00:38:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:27,589 INFO L225 Difference]: With dead ends: 35 [2018-02-04 00:38:27,589 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 00:38:27,589 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 00:38:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 00:38:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-02-04 00:38:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 00:38:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-02-04 00:38:27,592 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-02-04 00:38:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:27,592 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-02-04 00:38:27,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:38:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-02-04 00:38:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 00:38:27,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:27,593 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 00:38:27,593 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:27,593 INFO L82 PathProgramCache]: Analyzing trace with hash 679154701, now seen corresponding path program 1 times [2018-02-04 00:38:27,594 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:27,594 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:27,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,595 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:27,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:27,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:27,790 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 00:38:27,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:27,790 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:38:27,797 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:27,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:27,843 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 00:38:27,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:27,854 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 00:38:27,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:27,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:38:27,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:38:28,011 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 00:38:28,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:28,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-02-04 00:38:28,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:38:28,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:38:28,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:38:28,040 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 15 states. [2018-02-04 00:38:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:28,363 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-02-04 00:38:28,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:38:28,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-04 00:38:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:28,364 INFO L225 Difference]: With dead ends: 38 [2018-02-04 00:38:28,364 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 00:38:28,364 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 00:38:28,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 00:38:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 00:38:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 00:38:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-02-04 00:38:28,366 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 25 [2018-02-04 00:38:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:28,367 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-02-04 00:38:28,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:38:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-02-04 00:38:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 00:38:28,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:28,367 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 00:38:28,367 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043850, now seen corresponding path program 1 times [2018-02-04 00:38:28,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:28,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:28,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:28,368 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:28,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:28,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:38:28,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:28,460 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:38:28,465 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:28,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:28,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:38:28,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:28,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:28,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:38:28,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:28,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:28,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 00:38:28,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:28,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:38:28,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 00:38:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:38:28,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:28,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-04 00:38:28,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:38:28,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:38:28,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:38:28,530 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 11 states. [2018-02-04 00:38:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:28,629 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-02-04 00:38:28,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:38:28,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 00:38:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:28,629 INFO L225 Difference]: With dead ends: 47 [2018-02-04 00:38:28,629 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 00:38:28,630 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 00:38:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 00:38:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-02-04 00:38:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 00:38:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-04 00:38:28,632 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-04 00:38:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:28,632 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-04 00:38:28,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:38:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-04 00:38:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 00:38:28,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:28,633 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 00:38:28,633 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043851, now seen corresponding path program 1 times [2018-02-04 00:38:28,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:28,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:28,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:28,634 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:28,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:28,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:38:28,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:28,817 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:38:28,827 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:28,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:28,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 00:38:28,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:28,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 00:38:28,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:28,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 00:38:28,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:28,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 00:38:28,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:28,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:38:28,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:38:29,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:29,099 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 00:38:29,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:29,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:29,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:29,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-04 00:38:29,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:29,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:29,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:29,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-02-04 00:38:29,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:29,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:29,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-04 00:38:29,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:29,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 00:38:29,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 00:38:29,470 WARN L143 SmtUtils]: Spent 204ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 00:38:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:38:29,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:29,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-02-04 00:38:29,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:38:29,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:38:29,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=295, Unknown=1, NotChecked=0, Total=342 [2018-02-04 00:38:29,503 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 19 states. [2018-02-04 00:38:52,179 WARN L146 SmtUtils]: Spent 2083ms on a formula simplification. DAG size of input: 58 DAG size of output 55 [2018-02-04 00:38:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:52,242 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-04 00:38:52,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:38:52,242 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2018-02-04 00:38:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:52,243 INFO L225 Difference]: With dead ends: 49 [2018-02-04 00:38:52,243 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 00:38:52,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=113, Invalid=639, Unknown=4, NotChecked=0, Total=756 [2018-02-04 00:38:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 00:38:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-02-04 00:38:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 00:38:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-04 00:38:52,246 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-04 00:38:52,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:52,247 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-04 00:38:52,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:38:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-04 00:38:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:38:52,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:52,248 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 00:38:52,248 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash 622132427, now seen corresponding path program 1 times [2018-02-04 00:38:52,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:52,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:52,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:52,250 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:52,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:52,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:52,296 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 00:38:52,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:52,296 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:38:52,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:52,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:52,347 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 00:38:52,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:52,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-04 00:38:52,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:38:52,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:38:52,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:38:52,365 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-02-04 00:38:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:52,393 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-04 00:38:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:38:52,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 00:38:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:52,394 INFO L225 Difference]: With dead ends: 42 [2018-02-04 00:38:52,394 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 00:38:52,394 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 00:38:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 00:38:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-04 00:38:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 00:38:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-02-04 00:38:52,397 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-02-04 00:38:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:52,397 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-02-04 00:38:52,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:38:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-02-04 00:38:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:38:52,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:52,398 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 00:38:52,398 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:52,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1092971799, now seen corresponding path program 1 times [2018-02-04 00:38:52,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:52,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:52,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:52,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:52,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:52,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:52,573 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 00:38:52,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:52,573 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:38:52,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:52,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:52,612 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 00:38:52,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:52,623 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 00:38:52,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:52,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:38:52,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:38:52,798 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 00:38:52,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:52,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-02-04 00:38:52,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:38:52,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:38:52,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:38:52,816 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 19 states. [2018-02-04 00:38:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:53,084 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-02-04 00:38:53,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:38:53,085 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-02-04 00:38:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:53,086 INFO L225 Difference]: With dead ends: 58 [2018-02-04 00:38:53,086 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 00:38:53,086 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 00:38:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 00:38:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-02-04 00:38:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 00:38:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-04 00:38:53,090 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 35 [2018-02-04 00:38:53,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:53,090 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-04 00:38:53,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:38:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-04 00:38:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 00:38:53,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:53,091 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 00:38:53,091 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:38:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1217560473, now seen corresponding path program 2 times [2018-02-04 00:38:53,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:53,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:53,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:53,092 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:53,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:53,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:53,386 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 00:38:53,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:53,386 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:38:53,391 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:38:53,406 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:38:53,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:38:53,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:53,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 00:38:53,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:53,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 00:38:53,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:53,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 00:38:53,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:53,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 00:38:53,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:53,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:38:53,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:38:53,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:53,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:53,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-04 00:38:53,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:53,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:53,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-02-04 00:38:53,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:53,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:53,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-04 00:38:53,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:53,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:53,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:53,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-04 00:38:53,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:53,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 00:38:53,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 00:38:54,170 WARN L143 SmtUtils]: Spent 315ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 00:38:54,380 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 00:38:54,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:54,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2018-02-04 00:38:54,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 00:38:54,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 00:38:54,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=489, Unknown=5, NotChecked=0, Total=552 [2018-02-04 00:38:54,399 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 24 states. [2018-02-04 00:39:17,579 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 59 DAG size of output 55 [2018-02-04 00:39:18,072 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 56 DAG size of output 52 [2018-02-04 00:39:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:18,095 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-02-04 00:39:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:39:18,095 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-02-04 00:39:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:18,096 INFO L225 Difference]: With dead ends: 63 [2018-02-04 00:39:18,096 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 00:39:18,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=193, Invalid=1281, Unknown=8, NotChecked=0, Total=1482 [2018-02-04 00:39:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 00:39:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2018-02-04 00:39:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 00:39:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-02-04 00:39:18,100 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2018-02-04 00:39:18,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:18,100 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-02-04 00:39:18,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 00:39:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-02-04 00:39:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:39:18,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:18,101 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 00:39:18,101 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:39:18,102 INFO L82 PathProgramCache]: Analyzing trace with hash -13048153, now seen corresponding path program 2 times [2018-02-04 00:39:18,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:18,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:18,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,103 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:39:18,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:18,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:18,139 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 00:39:18,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:18,140 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:39:18,144 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:39:18,155 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:39:18,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:39:18,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:18,178 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 00:39:18,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:18,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 00:39:18,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:39:18,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:39:18,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:39:18,196 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-02-04 00:39:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:18,222 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-02-04 00:39:18,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:39:18,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 00:39:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:18,223 INFO L225 Difference]: With dead ends: 46 [2018-02-04 00:39:18,223 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 00:39:18,223 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 00:39:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 00:39:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-02-04 00:39:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 00:39:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-02-04 00:39:18,227 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 41 [2018-02-04 00:39:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:18,227 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-02-04 00:39:18,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:39:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-02-04 00:39:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 00:39:18,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:18,228 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 00:39:18,228 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:39:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash -455660157, now seen corresponding path program 3 times [2018-02-04 00:39:18,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:18,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:18,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,229 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:39:18,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:18,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:18,278 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 00:39:18,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:18,278 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:39:18,283 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:39:18,309 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 00:39:18,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:39:18,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:18,340 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 00:39:18,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:18,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 00:39:18,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:39:18,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:39:18,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:39:18,358 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 11 states. [2018-02-04 00:39:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:18,391 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-04 00:39:18,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:39:18,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-02-04 00:39:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:18,392 INFO L225 Difference]: With dead ends: 52 [2018-02-04 00:39:18,392 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 00:39:18,392 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 00:39:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 00:39:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-02-04 00:39:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 00:39:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-02-04 00:39:18,395 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 51 [2018-02-04 00:39:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:18,395 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-02-04 00:39:18,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:39:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-02-04 00:39:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:39:18,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:18,396 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 00:39:18,396 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:39:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1516212575, now seen corresponding path program 4 times [2018-02-04 00:39:18,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:18,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:18,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,397 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:39:18,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:18,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:18,452 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 00:39:18,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:18,452 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:39:18,460 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:39:18,481 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:39:18,481 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:39:18,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:18,527 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 00:39:18,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:18,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 00:39:18,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:39:18,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:39:18,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:39:18,553 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 13 states. [2018-02-04 00:39:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:18,586 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-02-04 00:39:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:39:18,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-04 00:39:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:18,587 INFO L225 Difference]: With dead ends: 58 [2018-02-04 00:39:18,587 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 00:39:18,587 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 00:39:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 00:39:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-02-04 00:39:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 00:39:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 00:39:18,590 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2018-02-04 00:39:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:18,590 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 00:39:18,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:39:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 00:39:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 00:39:18,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:18,591 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 00:39:18,591 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:39:18,591 INFO L82 PathProgramCache]: Analyzing trace with hash -342764997, now seen corresponding path program 5 times [2018-02-04 00:39:18,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:18,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:18,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,593 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:39:18,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:18,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:18,662 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 00:39:18,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:18,662 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:39:18,671 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:39:18,699 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 00:39:18,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:39:18,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:18,743 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 00:39:18,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:18,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 00:39:18,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:39:18,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:39:18,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:39:18,767 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 15 states. [2018-02-04 00:39:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:18,817 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-02-04 00:39:18,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:39:18,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2018-02-04 00:39:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:18,818 INFO L225 Difference]: With dead ends: 64 [2018-02-04 00:39:18,818 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 00:39:18,818 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 00:39:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 00:39:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-04 00:39:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 00:39:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-02-04 00:39:18,821 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 71 [2018-02-04 00:39:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:18,821 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-02-04 00:39:18,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:39:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-02-04 00:39:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 00:39:18,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:18,822 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 00:39:18,822 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:39:18,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1199419415, now seen corresponding path program 6 times [2018-02-04 00:39:18,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:18,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:18,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,824 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:39:18,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:18,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:18,897 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 00:39:18,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:18,897 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:39:18,902 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:39:18,945 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 00:39:18,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:39:18,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:19,006 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 00:39:19,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:19,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-04 00:39:19,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 00:39:19,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 00:39:19,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:39:19,024 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 17 states. [2018-02-04 00:39:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:19,075 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-02-04 00:39:19,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:39:19,075 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-02-04 00:39:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:19,076 INFO L225 Difference]: With dead ends: 70 [2018-02-04 00:39:19,076 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 00:39:19,076 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 00:39:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 00:39:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-02-04 00:39:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 00:39:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-02-04 00:39:19,079 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 81 [2018-02-04 00:39:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:19,080 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-02-04 00:39:19,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 00:39:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-02-04 00:39:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 00:39:19,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:19,081 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 00:39:19,081 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:39:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1552083699, now seen corresponding path program 7 times [2018-02-04 00:39:19,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:19,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:19,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:19,083 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:39:19,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:19,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:19,175 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 00:39:19,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:19,175 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:39:19,183 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:19,229 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:19,314 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 00:39:19,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:19,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 00:39:19,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:39:19,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:39:19,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:39:19,332 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 19 states. [2018-02-04 00:39:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:19,376 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-02-04 00:39:19,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:39:19,377 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2018-02-04 00:39:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:19,377 INFO L225 Difference]: With dead ends: 76 [2018-02-04 00:39:19,377 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 00:39:19,378 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 00:39:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 00:39:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-02-04 00:39:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 00:39:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2018-02-04 00:39:19,381 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 91 [2018-02-04 00:39:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:19,381 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2018-02-04 00:39:19,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:39:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2018-02-04 00:39:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 00:39:19,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:19,382 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 00:39:19,382 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:39:19,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1951482575, now seen corresponding path program 8 times [2018-02-04 00:39:19,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:19,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:19,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:19,384 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:39:19,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:19,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:19,481 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 00:39:19,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:19,481 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:39:19,486 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:39:19,510 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:39:19,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:39:19,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:19,565 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 00:39:19,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:19,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 00:39:19,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:39:19,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:39:19,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:39:19,583 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 21 states. [2018-02-04 00:39:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:19,647 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-02-04 00:39:19,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:39:19,647 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 101 [2018-02-04 00:39:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:19,648 INFO L225 Difference]: With dead ends: 82 [2018-02-04 00:39:19,648 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 00:39:19,648 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 00:39:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 00:39:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-02-04 00:39:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 00:39:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2018-02-04 00:39:19,652 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 101 [2018-02-04 00:39:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:19,652 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2018-02-04 00:39:19,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:39:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2018-02-04 00:39:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 00:39:19,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:19,653 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 00:39:19,653 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:39:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1340635051, now seen corresponding path program 9 times [2018-02-04 00:39:19,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:19,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:19,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:19,654 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:39:19,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:39:19,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:39:19,802 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 00:39:19,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:39:19,802 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:39:19,811 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:39:19,883 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 00:39:19,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:39:19,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:39:19,960 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 00:39:19,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:39:19,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-04 00:39:19,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:39:19,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:39:19,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:39:19,978 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand 23 states. [2018-02-04 00:39:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:39:20,087 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-02-04 00:39:20,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:39:20,087 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 111 [2018-02-04 00:39:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:39:20,088 INFO L225 Difference]: With dead ends: 88 [2018-02-04 00:39:20,088 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 00:39:20,088 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 00:39:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 00:39:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-02-04 00:39:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 00:39:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-02-04 00:39:20,092 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 111 [2018-02-04 00:39:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:39:20,092 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-02-04 00:39:20,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:39:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-02-04 00:39:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 00:39:20,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:39:20,093 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 00:39:20,093 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 00:39:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1134053767, now seen corresponding path program 10 times [2018-02-04 00:39:20,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:39:20,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:39:20,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:20,095 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:39:20,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:39:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:39:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:39:20,155 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 00:39:20,174 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 00:39:20,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:39:20 BoogieIcfgContainer [2018-02-04 00:39:20,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:39:20,194 INFO L168 Benchmark]: Toolchain (without parser) took 53850.91 ms. Allocated memory was 407.4 MB in the beginning and 745.0 MB in the end (delta: 337.6 MB). Free memory was 364.2 MB in the beginning and 605.5 MB in the end (delta: -241.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:39:20,195 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 407.4 MB. Free memory is still 370.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:39:20,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.51 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 351.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:39:20,196 INFO L168 Benchmark]: Boogie Preprocessor took 25.65 ms. Allocated memory is still 407.4 MB. Free memory was 351.0 MB in the beginning and 349.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:39:20,196 INFO L168 Benchmark]: RCFGBuilder took 131.76 ms. Allocated memory is still 407.4 MB. Free memory was 349.7 MB in the beginning and 334.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. [2018-02-04 00:39:20,196 INFO L168 Benchmark]: TraceAbstraction took 53538.60 ms. Allocated memory was 407.4 MB in the beginning and 745.0 MB in the end (delta: 337.6 MB). Free memory was 334.3 MB in the beginning and 605.5 MB in the end (delta: -271.2 MB). Peak memory consumption was 66.4 MB. Max. memory is 5.3 GB. [2018-02-04 00:39:20,197 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 407.4 MB. Free memory is still 370.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.51 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 351.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.65 ms. Allocated memory is still 407.4 MB. Free memory was 351.0 MB in the beginning and 349.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 131.76 ms. Allocated memory is still 407.4 MB. Free memory was 349.7 MB in the beginning and 334.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53538.60 ms. Allocated memory was 407.4 MB in the beginning and 745.0 MB in the end (delta: 337.6 MB). Free memory was 334.3 MB in the beginning and 605.5 MB in the end (delta: -271.2 MB). Peak memory consumption was 66.4 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: - UnprovableResult [Line: 1452]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1452. Possible 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