java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:12:27,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:12:27,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:12:27,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:12:27,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:12:27,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:12:27,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:12:27,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:12:27,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:12:27,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:12:27,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:12:27,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:12:27,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:12:27,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:12:27,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:12:27,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:12:27,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:12:27,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:12:27,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:12:27,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:12:27,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:12:27,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:12:27,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:12:27,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:12:27,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:12:27,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:12:27,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:12:27,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:12:27,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:12:27,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:12:27,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:12:27,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:12:27,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:12:27,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:12:27,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:12:27,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:12:27,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:12:27,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:12:27,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:12:27,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:12:27,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:12:27,185 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:12:27,214 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:12:27,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:12:27,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:12:27,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:12:27,218 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:12:27,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:12:27,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:12:27,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:12:27,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:12:27,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:12:27,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:12:27,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:12:27,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:12:27,220 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:12:27,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:12:27,221 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:12:27,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:12:27,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:12:27,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:12:27,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:12:27,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:12:27,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:12:27,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:12:27,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:12:27,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:12:27,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:12:27,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:12:27,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:12:27,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:12:27,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:12:27,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:12:27,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:12:27,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:12:27,285 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:12:27,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann03.c [2019-09-08 06:12:27,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16035096/f598c5d81784492ea4be2a31e75d8472/FLAG52e3e280b [2019-09-08 06:12:27,823 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:12:27,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann03.c [2019-09-08 06:12:27,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16035096/f598c5d81784492ea4be2a31e75d8472/FLAG52e3e280b [2019-09-08 06:12:28,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16035096/f598c5d81784492ea4be2a31e75d8472 [2019-09-08 06:12:28,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:12:28,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:12:28,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:12:28,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:12:28,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:12:28,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:12:28" (1/1) ... [2019-09-08 06:12:28,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625b54e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28, skipping insertion in model container [2019-09-08 06:12:28,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:12:28" (1/1) ... [2019-09-08 06:12:28,277 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:12:28,294 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:12:28,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:12:28,489 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:12:28,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:12:28,516 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:12:28,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28 WrapperNode [2019-09-08 06:12:28,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:12:28,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:12:28,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:12:28,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:12:28,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28" (1/1) ... [2019-09-08 06:12:28,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28" (1/1) ... [2019-09-08 06:12:28,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28" (1/1) ... [2019-09-08 06:12:28,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28" (1/1) ... [2019-09-08 06:12:28,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28" (1/1) ... [2019-09-08 06:12:28,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28" (1/1) ... [2019-09-08 06:12:28,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28" (1/1) ... [2019-09-08 06:12:28,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:12:28,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:12:28,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:12:28,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:12:28,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-08 06:12:28,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:12:28,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:12:28,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-09-08 06:12:28,684 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:12:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:12:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:12:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-09-08 06:12:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:12:28,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:12:28,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:12:28,875 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:12:28,875 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 06:12:28,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:12:28 BoogieIcfgContainer [2019-09-08 06:12:28,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:12:28,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:12:28,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:12:28,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:12:28,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:12:28" (1/3) ... [2019-09-08 06:12:28,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dc1944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:12:28, skipping insertion in model container [2019-09-08 06:12:28,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:28" (2/3) ... [2019-09-08 06:12:28,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dc1944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:12:28, skipping insertion in model container [2019-09-08 06:12:28,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:12:28" (3/3) ... [2019-09-08 06:12:28,898 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2019-09-08 06:12:28,913 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:12:28,935 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:12:28,967 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:12:28,999 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:12:28,999 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:12:29,000 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:12:29,000 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:12:29,000 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:12:29,000 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:12:29,000 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:12:29,001 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:12:29,001 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:12:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-08 06:12:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 06:12:29,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:29,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:29,030 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:29,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1796234678, now seen corresponding path program 1 times [2019-09-08 06:12:29,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:29,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:29,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:29,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:29,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:29,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:29,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:12:29,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:12:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:12:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:12:29,235 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-09-08 06:12:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:29,389 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2019-09-08 06:12:29,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:12:29,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-08 06:12:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:29,405 INFO L225 Difference]: With dead ends: 55 [2019-09-08 06:12:29,406 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 06:12:29,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 06:12:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-08 06:12:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 06:12:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-09-08 06:12:29,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2019-09-08 06:12:29,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:29,470 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-09-08 06:12:29,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:12:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-09-08 06:12:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 06:12:29,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:29,475 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:29,475 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash -895156504, now seen corresponding path program 1 times [2019-09-08 06:12:29,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:29,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:29,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:29,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:29,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:12:29,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:29,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-08 06:12:29,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:29,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 06:12:29,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:12:29,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:29,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 06:12:29,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:12:29,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:12:29,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:12:29,672 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2019-09-08 06:12:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:29,762 INFO L93 Difference]: Finished difference Result 52 states and 77 transitions. [2019-09-08 06:12:29,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:12:29,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-09-08 06:12:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:29,765 INFO L225 Difference]: With dead ends: 52 [2019-09-08 06:12:29,766 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 06:12:29,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 06:12:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 06:12:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 06:12:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-09-08 06:12:29,778 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2019-09-08 06:12:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:29,778 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-09-08 06:12:29,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:12:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2019-09-08 06:12:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-08 06:12:29,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:29,781 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-08 06:12:29,781 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:29,781 INFO L82 PathProgramCache]: Analyzing trace with hash 718507263, now seen corresponding path program 1 times [2019-09-08 06:12:29,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:29,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:29,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:29,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:29,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:12:29,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:29,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-08 06:12:29,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:29,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:12:29,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:12:29,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:29,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 06:12:29,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:12:29,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:12:29,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:29,945 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 6 states. [2019-09-08 06:12:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:30,083 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2019-09-08 06:12:30,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:12:30,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-09-08 06:12:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:30,087 INFO L225 Difference]: With dead ends: 48 [2019-09-08 06:12:30,087 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 06:12:30,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:12:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 06:12:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-08 06:12:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 06:12:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2019-09-08 06:12:30,102 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 35 [2019-09-08 06:12:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:30,103 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2019-09-08 06:12:30,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:12:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2019-09-08 06:12:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 06:12:30,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:30,107 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-09-08 06:12:30,107 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash -506207890, now seen corresponding path program 2 times [2019-09-08 06:12:30,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:30,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:30,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 06:12:30,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:30,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-08 06:12:30,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:30,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:12:30,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:30,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:12:30,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:12:30,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:30,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-09-08 06:12:30,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:12:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:12:30,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:12:30,356 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand 7 states. [2019-09-08 06:12:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:30,475 INFO L93 Difference]: Finished difference Result 83 states and 143 transitions. [2019-09-08 06:12:30,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:12:30,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-09-08 06:12:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:30,479 INFO L225 Difference]: With dead ends: 83 [2019-09-08 06:12:30,479 INFO L226 Difference]: Without dead ends: 79 [2019-09-08 06:12:30,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:12:30,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-08 06:12:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-09-08 06:12:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 06:12:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-09-08 06:12:30,502 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 48 [2019-09-08 06:12:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:30,502 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-09-08 06:12:30,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:12:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-09-08 06:12:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 06:12:30,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:30,509 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:30,510 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:30,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:30,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2091057537, now seen corresponding path program 3 times [2019-09-08 06:12:30,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:30,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:30,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:30,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:30,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 106 proven. 138 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-08 06:12:30,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:30,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-08 06:12:30,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:30,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-08 06:12:30,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:30,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:12:30,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 196 proven. 31 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-08 06:12:31,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:31,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-08 06:12:31,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 06:12:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 06:12:31,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:12:31,069 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 15 states. [2019-09-08 06:12:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:31,592 INFO L93 Difference]: Finished difference Result 222 states and 608 transitions. [2019-09-08 06:12:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:12:31,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 122 [2019-09-08 06:12:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:31,598 INFO L225 Difference]: With dead ends: 222 [2019-09-08 06:12:31,598 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 06:12:31,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-09-08 06:12:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 06:12:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-08 06:12:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-08 06:12:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2019-09-08 06:12:31,626 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 122 [2019-09-08 06:12:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:31,627 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2019-09-08 06:12:31,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 06:12:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2019-09-08 06:12:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 06:12:31,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:31,636 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:31,637 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash 984881173, now seen corresponding path program 4 times [2019-09-08 06:12:31,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:31,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:31,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:31,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:31,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 87 proven. 74 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 06:12:31,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:31,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-08 06:12:31,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:12:31,964 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:12:31,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:31,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 06:12:31,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:12:32,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:32,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 17 [2019-09-08 06:12:32,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 06:12:32,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 06:12:32,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:12:32,006 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand 17 states. [2019-09-08 06:12:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:32,404 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2019-09-08 06:12:32,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:12:32,404 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2019-09-08 06:12:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:32,406 INFO L225 Difference]: With dead ends: 103 [2019-09-08 06:12:32,410 INFO L226 Difference]: Without dead ends: 65 [2019-09-08 06:12:32,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:12:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-08 06:12:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-09-08 06:12:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-08 06:12:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2019-09-08 06:12:32,422 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 82 [2019-09-08 06:12:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:32,423 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2019-09-08 06:12:32,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 06:12:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2019-09-08 06:12:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 06:12:32,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:32,425 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:32,425 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:32,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2010206023, now seen corresponding path program 5 times [2019-09-08 06:12:32,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:32,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:32,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:32,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:32,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 140 proven. 174 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-08 06:12:32,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:32,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-08 06:12:32,726 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:32,766 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-08 06:12:32,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:32,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 06:12:32,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 286 proven. 71 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-09-08 06:12:32,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:32,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 20 [2019-09-08 06:12:32,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:12:32,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:12:32,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:12:32,830 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand 20 states. [2019-09-08 06:12:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:33,514 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2019-09-08 06:12:33,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 06:12:33,515 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-09-08 06:12:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:33,517 INFO L225 Difference]: With dead ends: 103 [2019-09-08 06:12:33,517 INFO L226 Difference]: Without dead ends: 65 [2019-09-08 06:12:33,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 06:12:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-08 06:12:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-09-08 06:12:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-08 06:12:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2019-09-08 06:12:33,529 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 108 [2019-09-08 06:12:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:33,530 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2019-09-08 06:12:33,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:12:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2019-09-08 06:12:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:12:33,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:33,532 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:33,532 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1835077495, now seen corresponding path program 6 times [2019-09-08 06:12:33,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:33,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:33,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 139 proven. 297 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-09-08 06:12:33,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:33,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-08 06:12:33,700 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:12:33,782 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-08 06:12:33,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:33,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 06:12:33,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:12:33,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:33,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-08 06:12:33,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:12:33,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:12:33,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:12:33,836 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 14 states. [2019-09-08 06:12:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:34,317 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2019-09-08 06:12:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 06:12:34,328 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 134 [2019-09-08 06:12:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:34,330 INFO L225 Difference]: With dead ends: 113 [2019-09-08 06:12:34,330 INFO L226 Difference]: Without dead ends: 75 [2019-09-08 06:12:34,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 06:12:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-08 06:12:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-09-08 06:12:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-08 06:12:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2019-09-08 06:12:34,341 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 134 [2019-09-08 06:12:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:34,342 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2019-09-08 06:12:34,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:12:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2019-09-08 06:12:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 06:12:34,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:34,344 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:34,344 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1434361927, now seen corresponding path program 7 times [2019-09-08 06:12:34,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:34,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:34,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:34,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2019-09-08 06:12:34,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:34,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-08 06:12:34,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:34,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 06:12:34,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2019-09-08 06:12:34,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:34,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-08 06:12:34,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:12:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:12:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:12:34,803 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand 20 states. [2019-09-08 06:12:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:35,605 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2019-09-08 06:12:35,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 06:12:35,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 160 [2019-09-08 06:12:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:35,607 INFO L225 Difference]: With dead ends: 135 [2019-09-08 06:12:35,607 INFO L226 Difference]: Without dead ends: 95 [2019-09-08 06:12:35,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=456, Invalid=2196, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 06:12:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-08 06:12:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2019-09-08 06:12:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-08 06:12:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2019-09-08 06:12:35,621 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 160 [2019-09-08 06:12:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:35,621 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2019-09-08 06:12:35,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:12:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2019-09-08 06:12:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 06:12:35,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:35,624 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:35,624 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash -66876812, now seen corresponding path program 8 times [2019-09-08 06:12:35,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:35,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:35,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-09-08 06:12:35,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:35,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-08 06:12:35,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:12:35,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:12:35,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:35,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 06:12:35,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:12:36,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:36,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-08 06:12:36,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 06:12:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 06:12:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-09-08 06:12:36,056 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand 21 states. [2019-09-08 06:12:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:36,923 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2019-09-08 06:12:36,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 06:12:36,923 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 173 [2019-09-08 06:12:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:36,926 INFO L225 Difference]: With dead ends: 150 [2019-09-08 06:12:36,926 INFO L226 Difference]: Without dead ends: 105 [2019-09-08 06:12:36,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=536, Invalid=2544, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 06:12:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-08 06:12:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2019-09-08 06:12:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-08 06:12:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2019-09-08 06:12:36,939 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 173 [2019-09-08 06:12:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:36,940 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2019-09-08 06:12:36,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 06:12:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2019-09-08 06:12:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 06:12:36,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:36,942 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:36,943 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1028004289, now seen corresponding path program 9 times [2019-09-08 06:12:36,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:36,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:36,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2019-09-08 06:12:37,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:37,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-08 06:12:37,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:37,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 06:12:37,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:37,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 06:12:37,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2019-09-08 06:12:37,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:37,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-08 06:12:37,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 06:12:37,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 06:12:37,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:12:37,568 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand 23 states. [2019-09-08 06:12:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:38,837 INFO L93 Difference]: Finished difference Result 131 states and 172 transitions. [2019-09-08 06:12:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 06:12:38,838 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 186 [2019-09-08 06:12:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:38,841 INFO L225 Difference]: With dead ends: 131 [2019-09-08 06:12:38,842 INFO L226 Difference]: Without dead ends: 127 [2019-09-08 06:12:38,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 192 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=1833, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 06:12:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-08 06:12:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 87. [2019-09-08 06:12:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-08 06:12:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2019-09-08 06:12:38,854 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 186 [2019-09-08 06:12:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:38,855 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2019-09-08 06:12:38,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 06:12:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2019-09-08 06:12:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 06:12:38,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:38,858 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:38,859 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2090243986, now seen corresponding path program 10 times [2019-09-08 06:12:38,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:38,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:38,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 535 proven. 610 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2019-09-08 06:12:39,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:39,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-08 06:12:39,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:39,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:12:39,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:39,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 06:12:39,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-09-08 06:12:40,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:40,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2019-09-08 06:12:40,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 06:12:40,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 06:12:40,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1804, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 06:12:40,362 INFO L87 Difference]: Start difference. First operand 87 states and 120 transitions. Second operand 45 states. [2019-09-08 06:12:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:44,690 INFO L93 Difference]: Finished difference Result 267 states and 492 transitions. [2019-09-08 06:12:44,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 06:12:44,691 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 199 [2019-09-08 06:12:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:44,694 INFO L225 Difference]: With dead ends: 267 [2019-09-08 06:12:44,694 INFO L226 Difference]: Without dead ends: 165 [2019-09-08 06:12:44,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=956, Invalid=6184, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 06:12:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-08 06:12:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 129. [2019-09-08 06:12:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-08 06:12:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-09-08 06:12:44,724 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 199 [2019-09-08 06:12:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:44,727 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-09-08 06:12:44,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 06:12:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-09-08 06:12:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 06:12:44,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:44,730 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:44,731 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash 469178039, now seen corresponding path program 11 times [2019-09-08 06:12:44,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:44,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:44,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:44,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 214 proven. 772 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2019-09-08 06:12:45,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:45,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-08 06:12:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:12:45,147 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-08 06:12:45,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:45,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 06:12:45,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:12:45,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:12:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:12:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1296 proven. 226 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:12:45,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:45,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 17 [2019-09-08 06:12:45,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 06:12:45,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 06:12:45,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:12:45,235 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 17 states. [2019-09-08 06:12:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:46,878 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2019-09-08 06:12:46,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 06:12:46,879 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 212 [2019-09-08 06:12:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:46,882 INFO L225 Difference]: With dead ends: 225 [2019-09-08 06:12:46,882 INFO L226 Difference]: Without dead ends: 151 [2019-09-08 06:12:46,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 213 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=306, Invalid=1500, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 06:12:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-08 06:12:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2019-09-08 06:12:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-08 06:12:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2019-09-08 06:12:46,897 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 160 transitions. Word has length 212 [2019-09-08 06:12:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:46,897 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 160 transitions. [2019-09-08 06:12:46,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 06:12:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2019-09-08 06:12:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 06:12:46,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:46,902 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:46,903 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024914, now seen corresponding path program 12 times [2019-09-08 06:12:46,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:46,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:46,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:46,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 210 proven. 402 refuted. 0 times theorem prover too weak. 3717 trivial. 0 not checked. [2019-09-08 06:12:47,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:47,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-08 06:12:47,134 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:47,259 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-09-08 06:12:47,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:47,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 06:12:47,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:47,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:12:47,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:12:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 210 proven. 398 refuted. 0 times theorem prover too weak. 3721 trivial. 0 not checked. [2019-09-08 06:12:47,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:47,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-09-08 06:12:47,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:12:47,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:12:47,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:12:47,330 INFO L87 Difference]: Start difference. First operand 140 states and 160 transitions. Second operand 9 states. [2019-09-08 06:12:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:47,649 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2019-09-08 06:12:47,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:12:47,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 284 [2019-09-08 06:12:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:47,651 INFO L225 Difference]: With dead ends: 143 [2019-09-08 06:12:47,651 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 06:12:47,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 283 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:12:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 06:12:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 06:12:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 06:12:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 06:12:47,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2019-09-08 06:12:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:47,654 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 06:12:47,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:12:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 06:12:47,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 06:12:47,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 06:12:48,151 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 70 [2019-09-08 06:12:49,056 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 16 [2019-09-08 06:12:51,000 WARN L188 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 197 DAG size of output: 60 [2019-09-08 06:12:51,234 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 16 [2019-09-08 06:12:51,300 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-08 06:12:51,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 06:12:51,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 06:12:51,300 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 06:12:51,301 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 06:12:51,301 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 06:12:51,301 INFO L443 ceAbstractionStarter]: For program point ackermannEXIT(lines 14 22) no Hoare annotation was computed. [2019-09-08 06:12:51,301 INFO L446 ceAbstractionStarter]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2019-09-08 06:12:51,301 INFO L439 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (<= ackermann_~n |ackermann_#in~n|) (or (not (<= 0 |ackermann_#in~n|)) (not (<= |ackermann_#in~n| 0))) (<= |ackermann_#in~n| ackermann_~n) (not (= ackermann_~m 0))) [2019-09-08 06:12:51,302 INFO L443 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-09-08 06:12:51,302 INFO L439 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: (and (not (<= 1 |ackermann_#in~n|)) (= ackermann_~m |ackermann_#in~m|) (<= ackermann_~n |ackermann_#in~n|) (<= |ackermann_#in~n| ackermann_~n) (<= 0 |ackermann_#in~n|) (not (= ackermann_~m 0))) [2019-09-08 06:12:51,302 INFO L439 ceAbstractionStarter]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse10 (<= (+ |ackermann_#in~n| 1) |ackermann_#t~ret1|)) (.cse19 (<= 2 |ackermann_#in~m|)) (.cse9 (<= ackermann_~n |ackermann_#in~n|)) (.cse15 (<= 6 |ackermann_#in~n|))) (let ((.cse7 (<= 2 |ackermann_#in~n|)) (.cse17 (<= |ackermann_#t~ret1| 5)) (.cse12 (<= 3 |ackermann_#in~n|)) (.cse18 (<= 4 |ackermann_#in~n|)) (.cse21 (or (<= |ackermann_#in~n| 4) .cse15)) (.cse20 (and (<= 5 |ackermann_#t~ret1|) (and .cse10 .cse19) .cse9)) (.cse16 (<= 5 |ackermann_#in~n|))) (let ((.cse0 (<= |ackermann_#t~ret1| 3)) (.cse13 (<= 1 |ackermann_#in~n|)) (.cse14 (<= |ackermann_#in~n| 1)) (.cse1 (and .cse20 .cse16)) (.cse2 (and .cse20 .cse18 .cse21)) (.cse4 (<= 3 |ackermann_#in~m|)) (.cse5 (<= |ackermann_#in~m| 1)) (.cse3 (and .cse20 .cse12 (or (<= |ackermann_#in~n| 3) .cse16) .cse21)) (.cse6 (and .cse7 .cse20 (<= |ackermann_#in~n| 2) .cse17))) (and (or .cse0 (or .cse1 .cse2 .cse3) .cse4 .cse5 .cse6) (let ((.cse8 (= ackermann_~m |ackermann_#in~m|)) (.cse11 (<= |ackermann_#in~n| ackermann_~n))) (or (and .cse7 .cse8 .cse9 .cse10 .cse0 .cse11) (and .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ackermann_#t~ret1| 4)) (and .cse8 .cse9 .cse13 .cse11 .cse14 (<= 2 |ackermann_#t~ret1|) (<= |ackermann_#t~ret1| 2)) (and .cse8 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse9 .cse10 .cse11 (<= |ackermann_#t~ret1| 6) .cse16) (and .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse8 .cse11 .cse19))) (or (and (<= 3 |ackermann_#t~ret1|) .cse9 .cse13 .cse14) .cse1 .cse2 .cse4 (and (<= 1 |ackermann_#in~m|) .cse5) .cse3 .cse6))))) [2019-09-08 06:12:51,302 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 20) no Hoare annotation was computed. [2019-09-08 06:12:51,303 INFO L443 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-09-08 06:12:51,303 INFO L443 ceAbstractionStarter]: For program point L21-3(line 21) no Hoare annotation was computed. [2019-09-08 06:12:51,303 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-09-08 06:12:51,303 INFO L443 ceAbstractionStarter]: For program point ackermannFINAL(lines 14 22) no Hoare annotation was computed. [2019-09-08 06:12:51,303 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-09-08 06:12:51,303 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 25 45) the Hoare annotation is: true [2019-09-08 06:12:51,304 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-09-08 06:12:51,304 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 25 45) no Hoare annotation was computed. [2019-09-08 06:12:51,304 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 25 45) no Hoare annotation was computed. [2019-09-08 06:12:51,304 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-08 06:12:51,304 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 44) no Hoare annotation was computed. [2019-09-08 06:12:51,304 INFO L446 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: true [2019-09-08 06:12:51,304 INFO L443 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2019-09-08 06:12:51,305 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-09-08 06:12:51,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:12:51 BoogieIcfgContainer [2019-09-08 06:12:51,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 06:12:51,315 INFO L168 Benchmark]: Toolchain (without parser) took 23047.87 ms. Allocated memory was 133.7 MB in the beginning and 509.1 MB in the end (delta: 375.4 MB). Free memory was 88.8 MB in the beginning and 321.0 MB in the end (delta: -232.2 MB). Peak memory consumption was 388.3 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:51,316 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 06:12:51,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.09 ms. Allocated memory is still 133.7 MB. Free memory was 88.6 MB in the beginning and 78.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:51,318 INFO L168 Benchmark]: Boogie Preprocessor took 116.63 ms. Allocated memory was 133.7 MB in the beginning and 198.7 MB in the end (delta: 65.0 MB). Free memory was 78.8 MB in the beginning and 174.8 MB in the end (delta: -96.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:51,319 INFO L168 Benchmark]: RCFGBuilder took 247.55 ms. Allocated memory is still 198.7 MB. Free memory was 174.8 MB in the beginning and 162.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:51,322 INFO L168 Benchmark]: TraceAbstraction took 22426.69 ms. Allocated memory was 198.7 MB in the beginning and 509.1 MB in the end (delta: 310.4 MB). Free memory was 162.9 MB in the beginning and 321.0 MB in the end (delta: -158.1 MB). Peak memory consumption was 397.4 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:51,331 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 253.09 ms. Allocated memory is still 133.7 MB. Free memory was 88.6 MB in the beginning and 78.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.63 ms. Allocated memory was 133.7 MB in the beginning and 198.7 MB in the end (delta: 65.0 MB). Free memory was 78.8 MB in the beginning and 174.8 MB in the end (delta: -96.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 247.55 ms. Allocated memory is still 198.7 MB. Free memory was 174.8 MB in the beginning and 162.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22426.69 ms. Allocated memory was 198.7 MB in the beginning and 509.1 MB in the end (delta: 310.4 MB). Free memory was 162.9 MB in the beginning and 321.0 MB in the end (delta: -158.1 MB). Peak memory consumption was 397.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 22.3s OverallTime, 14 OverallIterations, 42 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 402 SDtfs, 437 SDslu, 2530 SDs, 0 SdLazy, 5558 SolverSat, 822 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2284 GetRequests, 1843 SyntacticMatches, 17 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3804 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 142 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 477 PreInvPairs, 1205 NumberOfFragments, 436 HoareAnnotationTreeSize, 477 FomulaSimplifications, 127819 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 17953 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 3545 NumberOfCodeBlocks, 3204 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 3518 ConstructedInterpolants, 0 QuantifiedInterpolants, 1354110 SizeOfPredicates, 97 NumberOfNonLiveVariables, 4202 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 25460/31024 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...